Communicating and Mobile Systems: the π-calculus,
By D. Sangiorgi. 2000
1,617 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/e6bd77b283fbb8e7acd90caaec2e314650e2ab22
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Luís Caires
- Ralf Jung
- Derek Dreyer
- Ehud Y. Shapiro
- Edmund M. Clarke
- Helmut Veith
- Jérôme Feret
- Aviv Regev
In Computational Theory and Mathematics
- Vincent Danos
- Jean-Louis Krivine
- Ian David Bede Stark
- Marek Kwiatkowski
- Luca Cardelli
- Ekaterina M. Panina
- Helmut Veith
- Ehud Y. Shapiro
In Computer Networks and Communications
- Luís Caires
- Vincent Danos
- Jean-Louis Krivine
- Ehud Y. Shapiro
- Edmund M. Clarke
- Helmut Veith
- Jérôme Feret
- Aviv Regev
Citations in the corpus
- Non-commercial Research and Educational Use including without Limitation Use in Instruction at Your Institution, Sending It to Specific Colleagues That You Know, and Providing a Copy to Your Institution's Administrator. All Other Uses, Reproduction and Distribution, including without Limitation Comm (2005, neutral): “NMR spectra of molecules partially oriented in an anisotropic liquid-crystalline environment provide detailed information about interactions that cannot be observed in the isotropic phase.”
- Modular verification of software components in C (2003, methodology): “Process algebras like CCS [8], CSP [9] and the π-calculus [10] have been used widely to formally reason about message passing concurrent systems.”
- Event‐oriented approaches to geographic phenomena (2005, background): “Milner’s development of the π-calculus [24] extends the internal action τ to allow reacting concurrent processes to pass messages.”
- A spatial logic for concurrency (part I) (2003, methodology): “Let ≡c be the the standard structural congruence of [27] restricted to the asynchronous π-calculus.”
- Representation and Simulation of Biochemical Processes Using the pi-Calculus Process Algebra (2000, background): “(7) Free extracellular domain ::= ligand binding : rtk binding : + antagonist binding”
- A brief history of process algebra (2005, neutral): “An early reference is [36], the standard reference is [79] and the textbook is [77].”
- Transactions in RCCS (2005, background): “We are also confident that the idea, once well understood in CCS, will extend to π-calculus [3].”
- Rule-Based Modelling of Cellular Signalling (2007, positive): “to propose Milner’s π-calculus [20], a minimal language for describing concurrent systems, as a language for modelling biological systems [21,22,23].”
- A Correction to the Review Titled "Rules for Modeling Signal-Transduction Systems" by W. S. Hlavacek et al. (2006, background): “The π-calculus is a general and minimalist model-specif ication language originally designed to capture essential features of concurrent and distributed systems in computer science (113).”
- The Continuous pi-Calculus: A Process Algebra for Biochemical Modelling (2008, background): “The classic π-calculus is well-described in existing texts [9,10,11].”
- Iris (2015, methodology): “We then show that we can use channels (via a standard encoding [26]) to implement a logically atomic spec for mutable references, which we finally use in the verification of a fine-grained elimination stack ADT (§8).”
- BioAmbients: an abstraction for biological compartments (2004, methodology): “Recent work [13] explores its adaptation to bio-graphs suitable for our biological variant of the ambient calculus.”
- ABS: A Core Language for Abstract Behavioral Specification (2010, background): “Examples of foundational languages are process algebras [29], automata models [25], and object calculi [1, 21].”