A theory of bisimulation for the \(\pi\)-calculus

DOI10.1007/s002360050036zbMath0835.68072WikidataQ56019903 ScholiaQ56019903MaRDI QIDQ1901699

Publication date: 15 November 1995

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050036

zbMATH Keywords

bisimulation; transition system; axiomatisation; completeness proofs; completeness proof; \(pi\)-calculus; automated-verfication; automated-verification

Mathematics Subject Classification ID

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

03B70: Logic in computer science

68Q55: Semantics in the theory of computing

68Q60: Specification and verification (program logics, model checking, etc.)

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

Related Items

Open Bisimulation for the Concurrent Constraint Pi-Calculus, Variable binding operators in transition system specifications, Explicit substitutions for \(\pi\)-congruences, On quasi-open bisimulation, Locality and interleaving semantics in calculi for mobile processes, From CML to its process algebra, Towards an algebraic theory of typed mobile processes, Fair ambients, Some congruence properties for \(\pi\)-calculus bisimilarities, On the expressiveness of internal mobility in name-passing calculi, On bisimulations for the asynchronous \(\pi\)-calculus, A \(\pi\)-calculus with explicit substitutions, Bisimulation congruence of \(\chi\)-calculus, Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus., A fully abstract model for the \(\pi\)-calculus., A complexity analysis of bisimilarity for value-passing processes, \(\pi\)-calculus in (Co)inductive-type theory, A fully abstract denotational semantics for the \(\pi\)-calculus, Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types, A coordination approach to mobile components, A hierarchy of equivalences for asynchronous calculi, Observational congruences for dynamically reconfigurable tile systems, Understanding the mismatch combinator in chi calculus, A partition refinement algorithm for the \(\pi\)-calculus, Tau laws for pi calculus, Variations on mobile processes, A compositional coalgebraic model of fusion calculus, A synchronous \(\pi\)-calculus, A semantic framework for open processes, Open bisimulation, revisited, Behavioural equivalences for dynamic web data, Comparing operational models of name-passing process calculi, Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus, Explicit fusions, A Category of Explicit Fusions

Cites Work