Non-bisimulation-based Markovian behavioral equivalences

DOI10.1016/j.jlap.2007.02.002zbMath1121.68077OpenAlexW2065103010MaRDI QIDQ2373649

Marco Bernardo

Publication date: 16 July 2007

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2007.02.002

zbMATH Keywords

Markov chainsprocess algebrabehavioral equivalencestesting semanticstrace semanticsbisimulation semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (8)

Equivalences for fluid stochastic Petri nets ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics ⋮ Towards State Space Reduction Based on T-Lumpability-Consistent Relations ⋮ On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi ⋮ The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism ⋮ Logical characterization of fluid equivalences ⋮ Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interactive Markov chains. And the quest for quantified quality
• Bisimulation through probabilistic testing
• Testing equivalences for processes
• Algebraic theory of probabilistic processes.
• Performance measure sensitive congruences for Markovian process algebras
• Testing preorders for probabilistic processes.
• Reactive, generative, and stratified models of probabilistic processes
• Testing equivalence as a bisimulation equivalence
• Comparative branching-time semantics for Markov chains
• Process Algebra
• Exact and ordinary lumpability in finite Markov chains
• CONCUR 2003 - Concurrency Theory

This page was built for publication: Non-bisimulation-based Markovian behavioral equivalences