Proof systems for message-passing process algebras

DOI10.1007/BF01213531zbMATH Open0857.68040MaRDI QIDQ1815341FDOQ1815341

Authors 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

Recommendations

• scientific article; zbMATH DE number 1487725
• scientific article; zbMATH DE number 4205976
• A proof system for communicating processes with value-passing
• A modal logic for message passing processes

Cites work

• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 683363 (Why is no real title available?)
• A calculus of mobile processes. I
• A modal logic for message passing processes
• A proof system for communicating processes with value-passing
• A theory of communicating processes with value passing
• Algebraic theories for name-passing calculi
• Automated analysis of mutual exclusion algorithms using CCS
• Symbolic bisimulations
• The laws of Occam programming

Cited in

(22)

• A complete symbolic bisimulation for full applied pi calculus
• Bidirectional Runtime Enforcement of First-Order Branching-Time Properties
• A complexity analysis of bisimilarity for value-passing processes
• A semantic theory for value-passing processes based on the late approach
• On sequential composition, action prefixes and process prefix
• Theory of interaction
• Revisiting sequential composition in process calculi
• On bidirectional runtime enforcement
• Unique fixpoint induction for message-passing process calculi
• Bisimulations for a calculus of broadcasting systems
• A modal logic for message passing processes
• Computing strong and weak bisimulations for psi-calculi
• Equations for message passing
• A formal semantics for debugging synchronous message passing-based concurrent programs
• Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus
• Synchronous message passing: on the relation between bisimulation and refusal equivalence
• Computing bisimulations for finite-control \(\pi\)-calculus
• Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus.
• The Value-Passing Calculus
• Equivalence Checking for a Finite Higher Order π-Calculus
• Proof systems for infinite behaviours
• Contradiction-Tolerant Process Algebra with Propositional Signals

This page was built for publication: Proof systems for message-passing process algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815341)