3,256 Hits in 2.4 sec

Boxed Ambients [chapter]

Michele Bugliesi, Giuseppe Castagna, Silvia Crafa
2001 Lecture Notes in Computer Science  
Boxed Ambients are a variant of Mobile Ambients, that result from (i) dropping the open capability and (ii) providing new primitives for ambient communication while retaining the constructs in and out  ...  Also, our form of communication is anonymous, and based on a notion of locality which is absent in the Boxed-Calculus.  ...  Besides Mobile Ambients and Seals, whose relationships with Boxed Ambients have been discussed all along, the new calculus shares the same motivations, and is superficially similar to Sewell and Vitek's  ... 
doi:10.1007/3-540-45500-0_2 fatcat:2v37ies73rdq7bs52uoe6i2j2q

Matching Systems for Concurrent Calculi

Bjørn Haagensen, Sergio Maffeis, Iain Phillips
2008 Electronical Notes in Theoretical Computer Science  
We show among other results that the asynchronous pi-calculus with matching cannot be encoded (under certain conditions) in CCS with polyadic synchronisation of all finite levels.  ...  We adapt their definition and investigate matching systems for CCS, the pi-calculus and Mobile Ambients.  ...  Pure public boxed MA (ppbMA) is got by omitting communication, restriction and the open capability. Recall that the open capability is omitted in the calculus of boxed ambients [3] .  ... 
doi:10.1016/j.entcs.2007.11.004 fatcat:t3dv3totwreolejk53u6fwrmmq

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  ...  Asynchronous π-calculus This section shows that the asynchronous π-calculus fits in the theory of Section 2, and thus saturated barbed congruence (which coincides with barbed congruence [1] ) and its  ... 
doi:10.1007/978-3-642-17164-2_29 fatcat:3k47gaehkreinmq2nxqpb5qxe4

Page 3876 of Mathematical Reviews Vol. , Issue 97F [page]

1997 Mathematical Reviews  
The (abstract) programming language chosen is represented by the box calculus, that is, process algebra with a (simple, compositional) Petri net semantics.  ...  Andrea Maggiolo-Schettini (1-PISA-IF; Pisa) 97f:68042 68Q10 68Q55 68Q60 Esparza, Javier (4-EDIN-FC; Edinburgh); Bruns, Glenn (4-EDIN-FC; Edinburgh) Trapping mutual exclusion in the box calculus.  ... 

Encoding Asynchronous Interactions Using Open Petri Nets [chapter]

Paolo Baldan, Filippo Bonchi, Fabio Gadducci
2009 Lecture Notes in Computer Science  
The encoding preserves strong and weak CCS asynchronous bisimilarities: it thus represents a relevant step in establishing a precise correspondence between asynchronous calculi and (open) Petri nets.  ...  The standard token game of nets models the reduction semantics of the calculus; the exchange of tokens on open places models the interactions between processes and their environment.  ...  An open net is enclosed in a box and open places are on the border of such a box.  ... 
doi:10.1007/978-3-642-04081-8_8 fatcat:d5fbbkhypjaitmjb6bk4os63ty

Tutorial on separation results in process calculi via leader election problems

Maria Grazia Vigliotti, Iain Phillips, Catuscia Palamidessi
2007 Theoretical Computer Science  
Calculus and Boxed Ambients).  ...  We consider the π -calculus with mixed choice, separate choice and internal mobility, value-passing CCS and Mobile Ambients, together with other ambient calculi (Safe Ambients, the Push and Pull Ambient  ...  As an example, consider the asynchronous π-calculus and CCS.  ... 
doi:10.1016/j.tcs.2007.09.001 fatcat:uq7ppx5q3rezllkql7yqngbcjq

Page 3183 of Mathematical Reviews Vol. , Issue 98E [page]

1998 Mathematical Reviews  
Amadio, Ilaria Castellani and Davide San- giorgi, On bisimulations for the asynchronous z-calculus (147- 162); Michele Boreale, On the expressiveness of internal mobility in name-passing calculi (163-178  ...  Corradini, Concurrent graph and term graph rewriting (438-464); Raymond Devillers, Petri boxes and finite precedence (465-480); Ahmed Bouajjani and Pe- ter Habermehl, Constrained properties, semilinear  ... 

Access control for mobile agents

Michele Bugliesi, Giuseppe Castagna, Silvia Crafa
2004 ACM Transactions on Programming Languages and Systems  
We study two versions of the calculus, based on synchronous and asynchronous communication, respectively.  ...  All the type systems, in particular the access control type system are designed, and proved sound, for both the synchronous and the asynchronous versions of the calculus.  ...  Asynchronous Boxed Ambient vs Mobile Ambients We mentioned in Section 6 that the asynchronous semantics enables the definition of more robust translation of Boxed Ambients in MA.  ... 
doi:10.1145/963778.963781 fatcat:jozjwfnlavbhhg3scuos62a754

Page 6029 of Mathematical Reviews Vol. , Issue 88k [page]

1988 Mathematical Reviews  
Summary: “We show how a distributed system with synchronous processors and asynchronous message delays can be simulated by a system with both asynchronous processors and asynchronous mes- sage delays in  ...  We show how Dijkstra’s calculus for the derivation of programs corresponds to construct- ing this monotonic sequence.  ... 

Minimality and separation results on asynchronous mobile processes – representability theorems by concurrent combinators

Nobuko Yoshida
2002 Theoretical Computer Science  
we presented a theory of concurrent combinators for the asynchronous monadic -calculus without match or summation operator.  ...  Expressive power of several interesting subsystems of the asynchronous -calculus is also measured by using appropriate subsets of the combinators and their variants.  ...  In (b), boxed names indicate embeddable calculi via (congruent) adequate encodings.  ... 
doi:10.1016/s0304-3975(00)00310-8 fatcat:mfclbbqfr5cevni4p55fupay6m

Comparing logics for rewriting: rewriting logic, action calculi and tile logic

Fabio Gadducci, Ugo Montanari
2002 Theoretical Computer Science  
On the asynchronous -calculus We recall the syntax for the monadic, asynchronous -calculus, and its reduction semantics [38] .  ...  to preÿxing -models the asynchronous -calculus [38] .  ... 
doi:10.1016/s0304-3975(01)00362-0 fatcat:kg2dg7fptrgllaeunxvzgqwglq

Page 2584 of Mathematical Reviews Vol. , Issue 97D [page]

1997 Mathematical Reviews  
This highly influential paper creates a basis for a formal semantics of Petri box calculus, which was designed to deal with composition- ality of Petri nets.  ...  The paper deals with the algebraic structures de- fined on Petri boxes and box expressions and concentrates on two operators: refinement and recursion.  ... 

Verification of Distributed Hierarchical Components

Tomás Barros, Ludovic Henrio, Eric Madelaine
2006 Electronical Notes in Theoretical Computer Science  
Starting from the functional specification of primitive components, we generate a specification of a system of components, their asynchronous communications, and their control.  ...  Asynchronous Behaviour Properties Let us now focus on a property specific to the asynchronous aspect of the component model.  ...  The doted edges inside the boxes indicate a causality relation induced by the data flow through the box.  ... 
doi:10.1016/j.entcs.2006.05.014 fatcat:6x7k53wjx5bubawfouqaoeaxli

JoCaml: A Language for Concurrent Distributed and Mobile Programming [chapter]

Cédric Fournet, Fabrice Le Fessant, Luc Maranget, Alan Schmitt
2003 Lecture Notes in Computer Science  
The programming model of JoCaml is based on the join calculus.  ...  Specifically, the join calculus uses ML's function bindings and pattern-matching on messages to express local synchronizations.  ...  In the asynchronous pi calculus, for instance, and for a given channel c, a value v can be sent asynchronously on c (written c!  ... 
doi:10.1007/978-3-540-44833-4_5 fatcat:ga6e75xexrdullaolf76ucffdy

The Name-Passing Calculus [article]

Yuxi Fu, Han Zhu
2015 arXiv   pre-print
The technical tools and the results presented in the paper form the foundation for a theory of name-passing calculus.  ...  • A model independent equivalence, the box equality, is defined and applied to the π-calculus.  ...  Merro and Sangiorgi’s local π-calculus is the asynchronous version of πL without the match/mismatch operators. In [66, 16] the authors look at some asynchronous versions of πI and πO .  ... 
arXiv:1508.00093v1 fatcat:e6fzag2i3fdkhpxngq4gbtvoci
« Previous Showing results 1 — 15 out of 3,256 results