Reverse bisimilarity vs. forward bisimilarity

DOI10.1007/978-3-031-30829-1_13OpenAlexW4366550424MaRDI QIDQ6091197

Marco Bernardo, Sabina Rossi

Publication date: 24 November 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-30829-1_13

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Birth and death chains on finite trees: computing their stationary distribution and hitting times
• Observation equivalence as a testing equivalence
• Random walks on trees
• Bisimulation through probabilistic testing
• Exact performance equivalence: An equivalence relation for stochastic automata
• Turning back time in Markovian process algebra.
• On the relations between Markov chain lumpability and reversibility
• Reversing algebraic process calculi
• Irreversibility and Heat Generation in the Computing Process
• Algebraic laws for nondeterminism and concurrency
• Lumpability and time reversibility in the aggregation-disaggregation method for large markov chains
• Exact and ordinary lumpability in finite Markov chains
• Towards Bridging Time and Causal Reversibility
• Forward-Reverse Observational Equivalences in CCSK
• CONCUR 2004 - Concurrency Theory
• A Compositional Approach to Performance Modelling
• Logical Reversibility of Computation

This page was built for publication: Reverse bisimilarity vs. forward bisimilarity