Bisimulation and divergence

DOI10.1016/0890-5401(90)90048-MzbMath0713.68036OpenAlexW1990440312MaRDI QIDQ750163

Daniel J. Walker

Publication date: 1990

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(90)90048-m

zbMATH Keywords

divergencetransition systemCCSbisimulation equivalence

Mathematics Subject Classification ID

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

Related Items (33)

Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation ⋮ When is partial trace equivalence adequate? ⋮ Testing equivalence as a bisimulation equivalence ⋮ A characterization of finitary bisimulation ⋮ CPO models for a class of GSOS languages ⋮ Essential transitions to bisimulation equivalences ⋮ A general conservative extension theorem in process algebras with inequalities ⋮ A semantic theory for value-passing processes based on the late approach ⋮ Theory of interaction ⋮ Reactive bisimulation semantics for a process algebra with timeouts ⋮ Axiomatizing weak simulation semantics over BCCSP ⋮ Minimizing the number of transitions with respect to observation equivalence ⋮ A compositional protocol verification using relativized bisimulation ⋮ On the expressiveness of interaction ⋮ On Convergence-sensitive Bisimulation and the Embedding of CCS in Timed CCS ⋮ Non-deterministic structures of computation ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ The equational theory of prebisimilarity over basic CCS with divergence ⋮ A fully abstract denotational model for observational precongruence ⋮ A randomized encoding of the \(\pi\)-calculus with mixed choice ⋮ Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence ⋮ Unnamed Item ⋮ A complete axiomatisation for observational congruence of finite-state behaviours ⋮ Counting nondeterministic computations ⋮ Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations. ⋮ Axiomatizing Weak Ready Simulation Semantics over BCCSP ⋮ Finite axiom systems for testing preorder and De Simone process languages ⋮ Divide and congruence III: Stability & divergence ⋮ Decoding choice encodings ⋮ Ordered SOS process languages for branching and eager bisimulations ⋮ Axiomatising divergence ⋮ Confluence Thanks to Extensional Determinism ⋮ Stepwise development of process-algebraic specifications in decorated trace semantics

Cites Work

• Modal logics for communicating systems
• Observation equivalence as a testing equivalence
• A calculus of communicating systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bisimulation and divergence