Filters








332 Hits in 3.0 sec

A multiset semantics for the pi-calculus with replication [chapter]

Joost Engelfriet
1993 Lecture Notes in Computer Science  
A multiset (or Petri net) semantics is de ned for thecalculus with replication. The semantic mapping is a strong bisimulation, and structurally congruent processes have the same semantics.  ...  We de ne one \large" multiset transition system (or Petri net), called M , and we de ne a (compositional) semantic mapping that associates a state of M with each process of the small -calculus.  ...  I am grateful to P.S.Thiagarajan for the stimulating discussions that led to this paper. I thank my student Tjalling Gelsema for checking many of the details.  ... 
doi:10.1007/3-540-57208-2_2 fatcat:dhz36kar5jbqdnd3nysc7j7dcm

A multiset semantics for the pi-calculus with replication

Joost Engelfriet
1996 Theoretical Computer Science  
A multiset (or Petri net) semantics is defined for the n-calculus with replication. The semantic mapping is a strong bisimulation, and structurally congruent processes have the same semantics.  ...  . * The research of the author was supported by the Esprit Basic Working Group No.6067 CALIBAN. ??Email: engelfii@wi.leidemmiv.nl. 0304-3975/96/%09.50 @ 1996-Elsevier Science B.V.  ...  Thiagarajan for the stimulating discussions that led to this paper. I thank my student Tjalling Gelsema for checking many of the details. I thank the referees for their constructive remarks.  ... 
doi:10.1016/0304-3975(95)00118-2 fatcat:wjg5d6bznrgedk4y7wptxtokvi

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

1997 Mathematical Reviews  
systems.” 97f:68041 68Q10 03B70 68Q55 Engelfriet, Joost (NL-LEID-CS; Leiden) A multiset semantics for the pi-calculus with replication.  ...  The present paper develops a multiset semantics for the “small m-calculus”, i.e. the subset of the z-calculus without a choice operator and with recursion replaced by process replication.  ... 

Page 640 of Mathematical Reviews Vol. , Issue 2000a [page]

2000 Mathematical Reviews  
and structural congruence of the pi-calculus with replication.  ...  The multiset semantics given for the calculus by the authors in a previous paper is closely related to the structural approach.  ... 

Page 1308 of Mathematical Reviews Vol. , Issue 2002B [page]

2002 Mathematical Reviews  
In two previous papers the authors have proposed a multiset semantics for the z-calculus with replication and proven that two processes of this calculus are structurally congruent (for a natural extension  ...  with replication.  ... 

A semantic characterisation for faults in replicated systems

Padmanabhan Krishnan
1994 Theoretical Computer Science  
., A semantic characterisation for faults in replicated systems, Theoretical Computer Science 128 (1994) 1599177. We describe a process algebraic approach to the semantics of replicated systems.  ...  We extend a subset of CCS with a replication operator to model systems with replicated synchronous majority voting. Based on an operational semantics, we define a bisimulation semantics.  ...  Acknowledgment The author acknowledges the many helpful comments from the referees. This research has been partially supported by University of Canterbury Grant No. 1787123.  ... 
doi:10.1016/0304-3975(94)90168-6 fatcat:hasfa2gbozh6llgeaxlf6on27y

Multisets and structural congruence of the pi-calculus with replication

Joost Engelfriet, Tjalling Gelsema
1999 Theoretical Computer Science  
In the z-calculus with replication, two processes are multiset congruent if they have the same semantics in the multiset transition system Mz.  ...  It is proved that (extended) structural congruence is the same as multiset congruence, and that it is decidable.  ...  Acknowledgements We thank the referees for their constructive remarks.  ... 
doi:10.1016/s0304-3975(97)00179-5 fatcat:tmiqecic6fcijaxvwdskujgpzi

Page 1755 of Mathematical Reviews Vol. , Issue 95c [page]

1995 Mathematical Reviews  
Mayoh (DK-ARHS-C; Aarhus) 95c:68143 68Q55 68Q10 68Q65 68Q90 Engelfriet, Joost (NL-LEID-CS; Leiden) A multiset semantics for the pi-calculus with replication.  ...  A concrete semantics is given for Milner’s small z-calculus (without choice and with recursion replaced by replication), in such a way that structurally congruent expressions have the same model (up to  ... 

Solo Diagrams [chapter]

Cosimo Laneve, Joachim Parrow, Björn Victor
2001 Lecture Notes in Computer Science  
We address the problems of implementing the replication operator efficiently in the solos calculus-a calculus of mobile processes without prefix.  ...  To illustrate the results and show how the calculus can be efficiently implemented we present a graphic representation of agents in the solos calculus, adapting ideas from interaction diagrams and pi-nets  ...  In Section 5 we consider a generalisation to graphs with multiply labelled nodes, giving a finer semantics. The paper concludes with a discussion of related work. The Solos Calculus Syntax.  ... 
doi:10.1007/3-540-45500-0_6 fatcat:unn3zhu4kng2fnd72ttibydnr4

Automated Analysis of Security Protocols with Global State

Steve Kremer, Robert Kunnemann
2014 2014 IEEE Symposium on Security and Privacy  
We propose a process calculus which is a variant of the applied pi calculus with constructs for manipulation of a global state by processes running in parallel.  ...  As multiset rewriting is a "low-level" specification language with no direct support for concurrent message passing, encoding protocols correctly is a difficult and error-prone process.  ...  Syntax and informal semantics Our calculus is a variant of the applied pi calculus [7] .  ... 
doi:10.1109/sp.2014.18 dblp:conf/sp/KremerK14 fatcat:i5gq75vqxrcnll4cpodiryk6iy

Automated analysis of security protocols with global state

Steve Kremer, Robert Künnemann
2016 Journal of Computer Security  
We propose a process calculus which is a variant of the applied pi calculus with constructs for manipulation of a global state by processes running in parallel.  ...  As multiset rewriting is a "low-level" specification language with no direct support for concurrent message passing, encoding protocols correctly is a difficult and error-prone process.  ...  Syntax and informal semantics Our calculus is a variant of the applied pi calculus [7] .  ... 
doi:10.3233/jcs-160556 fatcat:x5eceuytmjcr3c5hsp4d7p35zm

Specifying Properties of Concurrent Computations in CLF

Kevin Watkins, Iliano Cervesato, Frank Pfenning, David Walker
2008 Electronical Notes in Theoretical Computer Science  
We illustrate the representation techniques available within CLF by applying them to an asynchronous pi-calculus with correspondence assertions, including its dynamic semantics, safety criterion, and a  ...  CLF (the Concurrent Logical Framework) is a language for specifying and reasoning about concurrent systems.  ...  The static semantics associates an effect e (a multiset of labels) with each program point, such that it is safe to execute end L for each label L in the multiset.  ... 
doi:10.1016/j.entcs.2007.11.013 fatcat:u427f36nzzby7pkal5erpuvxfy

Shape analysis for mobile ambients

Hanne Riis Nielson, Flemming Nielson
2000 Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '00  
The ambient calculus is a calculus of computation that allows active processes to move between sites.  ...  The analysis models sets of processes by sets of regular tree grammars enhanced with context-dependent counts, and it obtains its precision by combining a powerful redex materialisation with a strong redex  ...  We would like to thank Mooly Sagiv and Reinhard Wilhelm for interesting discussions on shape analysis of pointer structures.  ... 
doi:10.1145/325694.325711 dblp:conf/popl/NielsonN00 fatcat:lsjyveum5nauphpirnyg6iff5e

Relating Process Algebras and Multiset Rewriting for Immediate Decryption Protocols [chapter]

Stefano Bistarelli, Iliano Cervesato, Gabriele Lenzini, Fabio Martinelli
2003 Lecture Notes in Computer Science  
In this paper, we examine the nontrivial relationship between two general verification frameworks: multiset rewriting (MSR) and a process algebra (PA) inspired to CCS and the π-calculus.  ...  Although defining a simple and general bijection between MSR and PA appears difficult, we show that the sublanguages needed to specify a large class of cryptographic protocols (immediate decryption protocols  ...  Acknowledgments We would like to thank the selection committee and attendees of the WITS'03 workshop where a preliminary version of this paper was presented [5] .  ... 
doi:10.1007/978-3-540-45215-7_7 fatcat:2dijugsyobf6tnnepx2iaqazji

The Kell Calculus: Operational Semantics and Type System [chapter]

Philippe Bidinger, Jean-Bernard Stefani
2003 Lecture Notes in Computer Science  
The calculus is equipped with a type system that enforces a unicity property for location names that is crucial for the efficient implementation of the calculus.  ...  This paper 1 presents the Kell calculus, a new distributed process calculus that retains the original insights of the Seal calculus (local actions, process replication) and of the M-calculus (higher-order  ...  We present in this paper a variant of the Kell calculus with join patterns which is a more natural fit for the type system, together with a new reduction semantics. The paper is organized as follows.  ... 
doi:10.1007/978-3-540-39958-2_8 fatcat:odgtnlldj5glbhix45gshwsjoq
« Previous Showing results 1 — 15 out of 332 results