Filters








307 Hits in 2.5 sec

On asynchrony in name-passing calculi

MASSIMO MERRO, DAVIDE SANGIORGI
2004 Mathematical Structures in Computer Science  
We focus on bisimulation-based behavioural equivalences, precisely on barbed congruence. We prove two coinductive characterisations of barbed congruence in L , and some basic algebraic laws.  ...  However, at a closer inspection, these languages are based on an even simpler calculus, called Local (L ), where: (a) only the output capability of names may be transmitted; (b) there is no matching or  ...  Operational soundness of CPS axioms Thielecke studies the target calculi of Continuation Passing Style transforms 39].  ... 
doi:10.1017/s0960129504004323 fatcat:w7u6xktqrjh65hzwtivpjhld4m

That's Enough: Asynchrony with Standard Choreography Primitives [article]

Luís Cruz-Filipe, Fabrizio Montesi
2017 arXiv   pre-print
spawning and name mobility.  ...  Since asynchronous communications are ubiquitous in real-world systems, previous works have proposed different approaches for the formal modelling of asynchrony in choreographies.  ...  Then one message is passed in each of these channels, as dictated by the encoding.  ... 
arXiv:1711.08700v2 fatcat:7jk7e3alfjh4tovl2bayxv5gx4

On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi [chapter]

Ivan Lanese, Jorge A. Pérez, Davide Sangiorgi, Alan Schmitt
2010 Lecture Notes in Computer Science  
on public names.  ...  context can only use the names contained in a process in a restricted way, namely the way decreed by the sender process. 4 In a process-passing setting, sharing of (private) names is thus rather limited  ...  Valencia for discussions on the topics of this paper, and to the anonymous reviewers for their suggestions.  ... 
doi:10.1007/978-3-642-14162-1_37 fatcat:sx6vrnrqcnf6tj57rzfv5tafu4

A Universal Session Type for Untyped Asynchronous Communication

Stephanie Balzer, Frank Pfenning, Bernardo Toninho, Michael Wagner
2018 International Conference on Concurrency Theory  
In this paper, we show that shared channels with a corresponding sharing semantics (based on the language SILL S developed in prior work) are enough to embed the untyped asynchronous π-calculus via a universal  ...  In contrast, in the session-typed π-calculus, recursion alone is insufficient to recover the untyped π-calculus, primarily due to linearity: each channel just has two unique endpoints.  ...  New name creation ( νx P ) simply spawns a new buffer, offering on some fresh name x.  ... 
doi:10.4230/lipics.concur.2018.30 dblp:conf/concur/BalzerPT18 fatcat:zsy5536sx5hv3pnlchl733ikxe

Concurrency Can't Be Observed, Asynchronously [chapter]

Paolo Baldan, Filippo Bonchi, Fabio Gadducci, Giacoma Valentina Monreale
2010 Lecture Notes in Computer Science  
The theory is validated on two case studies, related to nominal calculi (π-calculus) and visual specification formalisms (Petri nets).  ...  This notion is then exploited in order to prove that concurrency cannot be observed through asynchronous interactions, i.e., that the interleaving and concurrent versions of a suitable asynchronous weak  ...  Indeed, for all processes p, q, a concrete test forā on p and q can be tā x = a.x, for x ∈ N a name that syntactically occurs neither in p nor in q.  ... 
doi:10.1007/978-3-642-17164-2_29 fatcat:3k47gaehkreinmq2nxqpb5qxe4

Name-passing calculi: From fusions to preorders and types

Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi
2016 Information and Computation  
We propose a modification of fusion calculi in which the name equivalences produced by fusions are replaced by name preorders, and with a distinction between positive and negative occurrences of names.  ...  We highlight a major difference between these calculi and the pi-calculus from the point of view of types, proving some impossibility results for subtyping in fusion calculi.  ...  Types are indeed a fundamental aspect of the π-calculus theory, and one of the most important differences between name-passing calculi and process calculi such as CCS in which names may not be passed.  ... 
doi:10.1016/j.ic.2016.10.003 fatcat:6dfwb7pglbbctcuyyojonat4o4

Name-Passing Calculi: From Fusions to Preorders and Types

Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi
2013 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science  
We propose a modification of fusion calculi in which the name equivalences produced by fusions are replaced by name preorders, and with a distinction between positive and negative occurrences of names.  ...  We highlight a major difference between these calculi and the pi-calculus from the point of view of types, proving some impossibility results for subtyping in fusion calculi.  ...  Types are indeed a fundamental aspect of the π-calculus theory, and one of the most important differences between name-passing calculi and process calculi such as CCS in which names may not be passed.  ... 
doi:10.1109/lics.2013.44 dblp:conf/lics/HirschkoffMS13 fatcat:5flwsbq7urccvcdcqv4kc2i37y

Page 4560 of Mathematical Reviews Vol. , Issue 98G [page]

1998 Mathematical Reviews  
(electronic)); Thomas Gehrke and Arend Rensink, Process creation and full sequen- tial composition in a name-passing calculus (20 pp. (electronic) ); F. Laroussinie and Ph.  ...  (electronic)); Philippa Gardner, A name-free account of action calculi (18 pp. (electronic)); Andrew D. Gordon, Bisimilarity as a theory of functional programming (21 pp. (electronic)); D. N.  ... 

Bisimulations for Asynchronous Mobile Processes

Martin Hansen, Hans Hüttel, Josva Kleist
1996 BRICS Report Series  
Within the past few years there has been renewed interest in the<br />study of value-passing process calculi as a consequence of the emergence of the pi-calculus.  ...  The surprising result is that in the presence of asynchrony, the open, late and early bisimulation equivalences coincide - this in contrast to the pi-calculus where they are distinct.  ...  The transition relation E ⊆ (Agent×Label ×Agent) is the smallest relation satisfying the rules in Table 1 . 3 Bisimulations For value passing calculi several formulations of bisimulations have been  ... 
doi:10.7146/brics.v3i8.19971 fatcat:73yujqmvhbbabdw5vwhta4pv5i

Asynchronous process calculi: the first- and higher-order paradigms

Davide Sangiorgi
2001 Theoretical Computer Science  
We compare the ÿrst-and the higher-order paradigms for the representation of mobility in process calculi. The prototypical calculus in the ÿrst-order paradigm is the -calculus.  ...  The main one is the full abstraction proof, which, with respect to previous proofs, is simpler and does not rely on certain non-ÿnitary features of the languages such as inÿnite summation.  ...  Acknowledgements I thank Massimo Merro for several useful discussions on L , and David Walker for comments on an early draft.  ... 
doi:10.1016/s0304-3975(00)00097-9 fatcat:6wl23baabneinildkt4y72tzqa

Review of the π-calculus

Riccardo Pucella
2003 ACM SIGACT News  
Mathematically, name-passing is much simpler than process-passing. On the other hand, process-passing is a more intuitive way to model mobility.  ...  As we saw in the introduction, mobility in the π-calculus is modeled by allowing channel names to be sent and received via channels. This is also called name-passing (or first-order).  ... 
doi:10.1145/637437.637443 fatcat:hxi6rr563jdfrn4qdcya4vjy64

Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular

Hubert Garavel
2008 Electronical Notes in Theoretical Computer Science  
This suggests a new generation of formal specification languages that would combine the concurrent features of process calculi with the standard concepts present in algorithmic languages.  ...  In this report we review the current state of concurrency theory with respect to its industrial impact.  ...  As regards communication links, these calculi support value-passing communications as well as n-ary synchronization (broadcast) between processes.  ... 
doi:10.1016/j.entcs.2008.04.009 fatcat:cj2gvg3xsvg7jbcztlbktujm6a

Ludics is a Model for the Finitary Linear Pi-Calculus [chapter]

Claudia Faggian, Mauro Piccolo
2007 Lecture Notes in Computer Science  
As we observed in previous work [FP06] , the discipline on names imposed in [Gir01] is closely related to that of internal π-calculus.  ...  Strategies and processes In this paper, we highlight the following correspondence: asynchrony -innocence (which we discuss in Section 4.1) internal mobility -names discipline in Ludics locality -alternating  ...  Our analysis makes explicit an exact correspondence between process calculi features and game-semantical notions, in particular between asynchrony and innocence.  ... 
doi:10.1007/978-3-540-73228-0_12 fatcat:ms5aqiitofaq5diksfzqwystci

Page 8753 of Mathematical Reviews Vol. , Issue 99m [page]

1999 Mathematical Reviews  
for asynchronous calculi (extended abstract) (844-855); Massimo Merro and Davide Sangiorgi, On asynchrony in name-passing calculi (856-867); Martin Abadi, Pro- tection in programming-language translations  ...  Tatsuya Akutsu and Mutsunori Yagiura, On the complexity of deriving score functions from examples for problems in molec- ular biology (832-843); Cédric Fournet and Georges Gonthier, A hierarchy of equivalences  ... 

Basic Theory of Reduction Congruence forTwo Timed Asynchronous π-Calculi [chapter]

Martin Berger
2004 Lecture Notes in Computer Science  
In addition we investigate the problem of how to distribute value-passing processes in a semanticspreserving way.  ...  We study reduction congruence, a popular notion of process equality, for the asynchronous π-calculus with timers, and derive several alternative characterisations, one of them being a labelled asynchronous  ...  a P | φ(Q) (1) does not connect asynchrony well with time passing.  ... 
doi:10.1007/978-3-540-28644-8_8 fatcat:s3dkfs5t6vg77oikujiilz3yyq
« Previous Showing results 1 — 15 out of 307 results