Non-bisimulation-based Markovian behavioral equivalences

DOI10.1016/J.JLAP.2007.02.002MaRDI QIDQ2373649zbMATH OpenOpenAlexFDO

Authors 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

behavioral equivalencesbisimulation semanticsMarkov chainsprocess algebratesting semanticstrace 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)

Recommendations

• Markovian testing and trace equivalences exactly lump more than Markovian bisimilarity
• A survey of Markovian behavioral equivalences
• Towards State Space Reduction Based on T-Lumpability-Consistent Relations
• Modal logic characterization of Markovian testing and trace equivalences
• Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses

Cites work

• Algebraic theory of probabilistic processes.
• Bisimulation through probabilistic testing
• Comparative branching-time semantics for Markov chains
• CONCUR 2003 - Concurrency Theory
• Exact and ordinary lumpability in finite Markov chains
• Handbook of process algebra
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1759619 (Why is no real title available?)
• Interactive Markov chains. And the quest for quantified quality
• Modal logic characterization of Markovian testing and trace equivalences
• Performance measure sensitive congruences for Markovian process algebras
• Process Algebra
• Reactive, generative, and stratified models of probabilistic processes
• Testing equivalence as a bisimulation equivalence
• Testing equivalences for processes
• Testing preorders for probabilistic processes.

Cited in

(14)

• \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics
• Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses
• Logical characterization of fluid equivalences
• Equivalences for fluid stochastic Petri nets
• Modal logic characterization of Markovian testing and trace equivalences
• A survey of Markovian behavioral equivalences
• Towards State Space Reduction Based on T-Lumpability-Consistent Relations
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
• On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi
• Markovian testing and trace equivalences exactly lump more than Markovian bisimilarity
• The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism
• Performance preserving equivalence for stochastic process algebra dtsdPBC
• Uniform logical characterizations of testing equivalences for nondeterministic, probabilistic and Markovian processes
• Approximating Markovian testing equivalence

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

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