Relating strong behavioral equivalences for processes with nondeterminism and probabilities

DOI10.1016/j.tcs.2014.03.001zbMath1360.68626OpenAlexW2152640722WikidataQ124439043 ScholiaQ124439043MaRDI QIDQ2253178

Rocco De Nicola, Michele Loreti, Marco Bernardo

Publication date: 25 July 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.03.001

zbMATH Keywords

probabilitynondeterminismtesting equivalencebisimulation equivalencetrace equivalencefailure equivalence

Mathematics Subject Classification ID

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

Related Items (10)

Probabilistic bisimulation for realistic schedulers ⋮ \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics ⋮ Back to the format: a survey on SOS for probabilistic processes ⋮ Unnamed Item ⋮ Towards general axiomatizations for bisimilarity and trace semantics ⋮ Nondeterministic fuzzy automata with membership values in complete residuated lattices ⋮ The metric linear-time branching-time spectrum on nondeterministic probabilistic processes ⋮ Unnamed Item ⋮ Probabilistic Bisimulation for Realistic Schedulers ⋮ The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
• Observation equivalence as a testing equivalence
• Extensional equivalences for transition systems
• Bisimulation through probabilistic testing
• Testing equivalences for processes
• Probabilistic models for the guarded command language
• Approximating labelled Markov processes
• Testing preorders for probabilistic processes.
• Comparative branching-time semantics for Markov chains
• Finite state Markovian decision processes
• Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations
• Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
• Bisimulations Meet PCTL Equivalences for Probabilistic Automata
• A Spectrum of Behavioral Relations over LTSs on Probability Distributions
• Game Refinement Relations and Metrics
• Retaining the Probabilities in Probabilistic Testing Theory
• Characterising Testing Preorders for Finite Probabilistic Processes
• A Theory of Communicating Sequential Processes
• Algebraic laws for nondeterminism and concurrency
• Formal verification of parallel programs
• Validation of Stochastic Systems
• Validation of Stochastic Systems
• Distributing probability over non-determinism
• Testing probabilistic automata

This page was built for publication: Relating strong behavioral equivalences for processes with nondeterminism and probabilities