|
2832
|
Communicating sequential processes
– Hoare
- 1978
|
|
1124
|
A Calculus of Communicating Systems
– Milner
|
|
918
|
A calculus of mobile processes
– Milner, Parrow, et al.
- 1992
|
|
692
|
Mobile Ambients
– Cardelli, Gordon
- 1998
|
|
564
|
Concurrency and automata on infinite sequences
– Park
- 1981
|
|
420
|
The chemical abstract machine
– Berry, Boudol
- 1992
|
|
288
|
An object calculus for asynchronous communication
– Honda, Tokoro
- 1991
|
|
198
|
Algebra of communicating processes with abstraction
– Bergstra, Klop
- 1985
|
|
153
|
Interaction nets
– Lafont
- 1990
|
|
148
|
Calculi for interaction
– Milner
- 1996
|
|
110
|
Representation and simulation of biochemical processes using the pi-calculus process algebra
– Regev, Silverman, et al.
- 2001
|
|
103
|
A spatial logic for concurrency (part I
– Caires, Cardelli
- 2001
|
|
90
|
Nomadic Pict: Language and infrastructure design for mobile agents
– Wojciechowski, Sewell
- 2000
|
|
88
|
The fusion calculus: Expressiveness and symmetry in mobile processes
– Parrow, Victor
- 1998
|
|
84
|
Deriving bisimulation congruences for reactive systems
– Leifer, Milner
- 2000
|
|
65
|
The reflexive CHAM and the join-calculus
– Fournet, Gonthier
- 1996
|
|
60
|
From rewrite rules to bisimulation congruences
– Sewell
- 1998
|
|
58
|
Stochastic π-calculus
– Priami
- 1995
|
|
52
|
Bisimulation Congruences in Safe Ambients
– Merro, Hennessy
- 2002
|
|
48
|
Bigraphs and transitions
– Jensen, Milner
- 2003
|
|
44
|
Bigraphical reactive systems
– Milner
- 2001
|
|
43
|
Hierarchical graph transformation
– Drewes, Hoffmann, et al.
- 2000
|
|
33
|
Explicit fusions
– Gardner, Wischik
- 2000
|
|
31
|
Synchronized hyperedge replacement with name mobility
– Hirsch, Montanari
- 2001
|
|
30
|
Operational congruences for reactive systems
– Leifer
- 2001
|
|
26
|
Process algebras with localities
– Castellani
- 2001
|
|
26
|
Bigraphical reactive systems: basic theory
– Milner
- 2001
|
|
22
|
Hoare: Communicating Sequential Processes
– R
- 1985
|
|
17
|
Contexts and Embeddings for closed shallow action graphs
– Cattani, Leifer, et al.
- 2000
|
|
15
|
Asynchrony and the π-calculus. Rapport de recherche
– Boudol
- 1992
|
|
15
|
A bi-categorical axiomatisation of concurrent graph rewriting
– Gadducci, Heckel, et al.
- 1999
|
|
14
|
Bioware languages
– Cardelli
- 2003
|
|
13
|
From process calculi to process frameworks
– Gardner
- 2000
|
|
13
|
The φ-calculus: A language for distributed control of reconfigurable embedded systems
– Rounds, Song
- 2003
|
|
13
|
Deriving bisimulation congruences: a 2categorical approach
– Sassone, Sobocinski
- 2002
|
|
10
|
Bigraphs meet double pushouts
– Ehrig
- 2002
|
|
7
|
Application of stochastic process algebras to bioinformatics of molecular processes
– Priami, Regev, et al.
- 2001
|
|
5
|
Introduction to the theory of graph grammars. Graph Grammars and their Application to
– Ehrig
- 1979
|
|
5
|
Computational flux
– Milner
- 2001
|
