Corrigendum: ``A domain equation for bisimulation by S. Abramsky

DOI10.1006/INCO.2001.2909zbMath1003.68083DBLPjournals/iandc/AbramskyAI01OpenAlexW4210446611WikidataQ57006732 ScholiaQ57006732MaRDI QIDQ1854414

Anna Ingólfsdóttir, Luca Aceto

Publication date: 14 January 2003

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

Full work available at URL: https://doi.org/10.1006/inco.2001.2909

zbMATH Keywords

denotational semanticssynchronization treesconcurrencytransition systemsdomain equationdomain logic

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• A characterization of finitary bisimulation
• Observation equivalence as a testing equivalence
• Domain theory in logical form
• A domain equation for bisimulation
• Algebraic laws for nondeterminism and concurrency

This page was built for publication: Corrigendum: ``A domain equation for bisimulation by S. Abramsky