A characterization of finitary bisimulation

DOI10.1016/S0020-0190(97)00163-4zbMath1337.68177OpenAlexW2162013421MaRDI QIDQ287256

Luca Aceto, Anna Ingólfsdóttir

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00163-4

zbMATH Keywords

concurrencybisimulation preorderfinitary relationlabelled transition system with divergence

Mathematics Subject Classification ID

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

Related Items (3)

A unified rule format for bounded nondeterminism in SOS with terms as labels ⋮ The equational theory of prebisimilarity over basic CCS with divergence ⋮ Corrigendum: ``A domain equation for bisimulation by S. Abramsky

Cites Work

• Unnamed Item
• Unnamed Item
• Observation equivalence as a testing equivalence
• Bisimulation and divergence
• A calculus of communicating systems
• A domain equation for bisimulation
• Algebraic laws for nondeterminism and concurrency
• A term model for synchronous processes
• Formal verification of parallel programs
• Termination, deadlock, and divergence

This page was built for publication: A characterization of finitary bisimulation