From rewrite rules to bisimulation congruences

DOI10.1016/S0304-3975(00)00309-1zbMath0992.68122OpenAlexW2049924207MaRDI QIDQ5958468

Peter Sewell

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)00309-1

zbMATH Keywords

operational semanticsbisimulationterm rewritinglabelled transition systemspperational congruencesprocess calculi

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (16)

Reactive systems, (semi-)saturated semantics and coalgebras on presheaves ⋮ Basic observables for a calculus for global computing ⋮ A General Theory of Barbs, Contexts, and Labels ⋮ When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus ⋮ Deriving structural labelled transitions for mobile ambients ⋮ Bisimulations in calculi modelling membranes ⋮ Making the Unobservable, Unobservable ⋮ Pure bigraphs: structure and dynamics ⋮ Locating reaction with 2-categories ⋮ From rewrite rules to bisimulation congruences ⋮ On the semantics of durational actions ⋮ Synthesising CCS bisimulation using graph rewriting ⋮ RPO, Second-Order Contexts, and λ-Calculus ⋮ Active Evaluation Contexts for Reaction Semantics ⋮ Directed Bigraphs ⋮ Bisimulation and Co-induction: Some Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Higher-level synchronising devices in Meije-SCCS
• The chemical abstract machine
• A calculus of mobile processes. II
• Structured operational semantics and bisimulation as a congruence
• Full abstraction in the lazy lambda calculus
• A calculus for cryptographic protocols: The spi calculus
• Turning SOS rules into equations
• Testing equivalences for processes
• On reduction-based process semantics
• Calculi for interaction
• A theory of weak bisimulation for core CML
• Functions as processes
• Bisimulation can't be traced
• Barbed bisimulation
• From rewrite rules to bisimulation congruences
• On implementations and semantics of a concurrent programming language

This page was built for publication: From rewrite rules to bisimulation congruences