Explicit substitutions for \(\pi\)-congruences

DOI10.1016/S0304-3975(00)00376-5zbMath0983.68137OpenAlexW2016436631MaRDI QIDQ5958613

Paola Quaglia

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00376-5

zbMATH Keywords

calculus semanticsCCS bisimulationslate bisimulationslate congruencesopen semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• MWB

Cites Work

• Unnamed Item
• Unnamed Item
• Symbolic bisimulations
• Modal logics for mobile processes
• Calculi for synchrony and asynchrony
• Higher-level synchronising devices in Meije-SCCS
• A calculus of mobile processes. II
• Structured operational semantics and bisimulation as a congruence
• A complete axiomatisation for observational congruence of finite-state behaviours
• Turning SOS rules into equations
• A \(\pi\)-calculus with explicit substitutions
• Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus.
• A theory of bisimulation for the \(\pi\)-calculus
• A domain equation for bisimulation
• Algebraic laws for nondeterminism and concurrency
• Bisimulation can't be traced
• Explicit substitutions

This page was built for publication: Explicit substitutions for \(\pi\)-congruences