A calculus of mobile processes. I

DOI10.1016/0890-5401(92)90008-4zbMath0752.68036WikidataQ56019902 ScholiaQ56019902MaRDI QIDQ1198548

S. Singh

Publication date: 16 January 1993

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(92)90008-4

zbMATH Keywords

process algebra; mobility; processes; labeled transition system; calculus of communicating systems; strong bisimilarity; strong equivalence; distinctions

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Forum: A multiple-conclusion specification logic, Modal logics for mobile processes, A calculus of mobile processes. II, An algebraic verification of a mobile network, Full abstractness for a functional/concurrent language with higher-order value-passing, Reaction graph, A calculus for cryptographic protocols: The spi calculus, On sequential composition, action prefixes and process prefix, Verifying a distributed list system: A case history, Symmetric \(\pi\)-calculus, Algebraic specification of reactive systems, Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability, Proof systems for message-passing process algebras, A formal semantics for DAI language NUML, Asynchronous communication model based on linear logic, A theory of bisimulation for the \(\pi\)-calculus, A specification structure for deadlock-freedom of synchronous processes, Symbolic transition graph and its early bisimulation checking algorithms for the \(\pi\)-calculus, Computing bisimulations for finite-control \(\pi\)-calculus, Inference systems for observation equivalences in the \(\pi\)-calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parametric channels via label expressions in CCS
• Algebra of communicating processes with abstraction
• A calculus of mobile processes. II
• Full abstraction in the lazy lambda calculus
• A fully abstract denotational semantics for the calculus of higher-order communicating systems