A characterization of finitary bisimulation

DOI10.1016/S0020-0190(97)00163-4zbMATH Open1337.68177OpenAlexW2162013421MaRDI QIDQ287256FDOQ287256

Authors: Luca Aceto, Anna Ingolfsdottir 

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)

Cites Work

• Algebraic laws for nondeterminism and concurrency
• A calculus of communicating systems
• A domain equation for bisimulation
• Title not available (Why is that?)
• Title not available (Why is that?)
• A term model for synchronous processes
• Formal verification of parallel programs
• Termination, deadlock, and divergence
• Observation equivalence as a testing equivalence
• Bisimulation and divergence

Cited In (3)

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

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

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