A theory of bisimulation for the \(\pi\)-calculus
From MaRDI portal
Publication:1901699
DOI10.1007/s002360050036zbMath0835.68072OpenAlexW2027689693WikidataQ56019903 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
bisimulationtransition systemaxiomatisationcompleteness proofscompleteness proof\(pi\)-calculusautomated-verficationautomated-verification
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity, Coalgebraic Symbolic Semantics, Relating Coalgebraic Notions of Bisimulation, Tau laws for pi calculus, A compositional coalgebraic model of fusion calculus, Reactive systems, (semi-)saturated semantics and coalgebras on presheaves, Nominal SOS, SPEC: An Equivalence Checker for Security Protocols, A \(\pi\)-calculus with explicit substitutions, A synchronous \(\pi\)-calculus, Formalising Observer Theory for Environment-Sensitive Bisimulation, A Complete, Co-inductive Syntactic Theory of Sequential Control and State, A presheaf environment for the explicit fusion calculus, Fair ambients, Some congruence properties for \(\pi\)-calculus bisimilarities, Complete inference systems for weak bisimulation equivalences in the π-calculus, A π-calculus with explicit substitutions: The late semantics, When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus, Distinguishing and relating higher-order and first-order processes by expressiveness, Bisimulation congruence of \(\chi\)-calculus, Constraints as processes, Theory of interaction, Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus., A fully abstract model for the \(\pi\)-calculus., A Category of Explicit Fusions, Comparing the expressiveness of the \(\pi \)-calculus and CCS, On well-founded and recursive coalgebras, Unnamed Item, Computing strong and weak bisimulations for psi-calculi, Replacement freeness: a criterion for separating process calculi, Variations on mobile processes, Unnamed Item, Verifying quantum communication protocols with ground bisimulation, A semantic framework for open processes, Locality and interleaving semantics in calculi for mobile processes, From CML to its process algebra, Open bisimulation, revisited, Computing maximal weak and other bisimulations, Behavioural equivalences for dynamic web data, Unnamed Item, On the expressiveness of interaction, A Categorical Model of the Fusion Calculus, Symbolic Bisimulation for Quantum Processes, Variable binding operators in transition system specifications, Encoding cryptographic primitives in a calculus with polyadic synchronisation, Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types, A coordination approach to mobile components, On quasi-open bisimulation, A hierarchy of equivalences for asynchronous calculi, Comparing operational models of name-passing process calculi, Observational congruences for dynamically reconfigurable tile systems, Explicit substitutions for \(\pi\)-congruences, On the Role of Names in Reasoning about λ-tree Syntax Specifications, Two Cotensors in One: Presentations of Algebraic Theories for Local State and Fresh Names, Open Bisimulation for the Concurrent Constraint Pi-Calculus, A congruence rule format for name-passing process calculi, On the expressiveness of internal mobility in name-passing calculi, On bisimulations for the asynchronous \(\pi\)-calculus, Constructing weak simulations from linear implications for processes with private names, Comparing Higher-Order Encodings in Logical Frameworks and Tile Logic, A complexity analysis of bisimilarity for value-passing processes, Processes against tests: on defining contextual equivalences, Divergence and unique solution of equations, Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus, Explicit fusions, Unnamed Item, \(\pi\)-calculus in (Co)inductive-type theory, Understanding the mismatch combinator in chi calculus, A partition refinement algorithm for the \(\pi\)-calculus, G-Reactive Systems as Coalgebras, A Coalgebraic Theory of Reactive Systems, A fully abstract denotational semantics for the \(\pi\)-calculus, Towards an algebraic theory of typed mobile processes
Cites Work
