Proof systems for message-passing process algebras

DOI10.1007/BF01213531zbMath0857.68040MaRDI QIDQ1815341

Yanyan Li

Publication date: 10 November 1996

Published in: Formal Aspects of Computing (Search for Journal in Brave)

zbMATH Keywords

process algebrabisimulationmessage-passing

Mathematics Subject Classification ID

Related Items

Bidirectional Runtime Enforcement of First-Order Branching-Time Properties, On sequential composition, action prefixes and process prefix, Revisiting sequential composition in process calculi, A semantic theory for value-passing processes based on the late approach, Theory of interaction, Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus., Computing strong and weak bisimulations for psi-calculi, Computing bisimulations for finite-control \(\pi\)-calculus, A complete symbolic bisimulation for full applied pi calculus, Equivalence Checking for a Finite Higher Order π-Calculus, Bisimulations for a calculus of broadcasting systems, A complexity analysis of bisimilarity for value-passing processes, The Value-Passing Calculus, A formal semantics for debugging synchronous message passing-based concurrent programs, On bidirectional runtime enforcement

Cites Work

• Unnamed Item
• Unnamed Item
• Symbolic bisimulations
• Automated analysis of mutual exclusion algorithms using CCS
• A proof system for communicating processes with value-passing
• A calculus of mobile processes. I
• A theory of communicating processes with value passing
• A modal logic for message passing processes
• Algebraic theories for name-passing calculi
• The laws of Occam programming