Deciding orthogonal bisimulation

DOI10.1007/S00165-007-0023-XMaRDI QIDQ2461535zbMATH OpenOpenAlexFDO

Authors Thuy Duong Vu

Publication date 28 November 2007

Published in Formal Aspects of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/s00165-007-0023-x

zbMATH Keywords

Branching bisimulation equivalenceConcurrency theoryLabeled transition systemOrthogonal bisimulation equivalenceSilent step

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4166873
• Branching time and orthogonal bisimulation equivalence
• Bisimulation and divergence
• Bisimulation by unification
• Bisimulation and effectiveness
• scientific article; zbMATH DE number 1538045
• scientific article; zbMATH DE number 2196588
• Deciding bisimulation equivalences for a class of non-finite-state programs
• Deciding bisimulation equivalences for a class of non-finite-state programs
• scientific article; zbMATH DE number 1222559

Cites work

• A calculus of communicating systems
• Algebraic laws for nondeterminism and concurrency
• Branching time and abstraction in bisimulation semantics
• Branching time and orthogonal bisimulation equivalence
• Characterizing finite Kripke structures in propositional temporal logic
• scientific article; zbMATH DE number 3744561 (Why is no real title available?)
• scientific article; zbMATH DE number 177845 (Why is no real title available?)
• scientific article; zbMATH DE number 604884 (Why is no real title available?)
• The compression structure of a process
• Three Partition Refinement Algorithms

Cited in

(6)

• Deciding bisimilarity is P-complete
• Branching time and orthogonal bisimulation equivalence
• scientific article; zbMATH DE number 7559464 (Why is no real title available?)
• An O(m n) algorithm for computing stuttering equivalence and branching bisimulation
• Lowerbounds for Bisimulation by Partition Refinement
• Compositional verification of priority systems using sharp bisimulation

This page was built for publication: Deciding orthogonal bisimulation

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