Testing preorders for probabilistic processes

DOI10.1007/3-540-55719-9_116MaRDI QIDQ5204359zbMATH OpenOpenAlexFDO

Authors Rance Cleaveland, Scott A. Smolka, Amy E. Zwarico

Publication date 4 December 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55719-9_116

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Testing preorders for probabilistic processes.
• Testing preorders for probabilistic processes can be characterized by simulations
• Characterising Testing Preorders for Finite Probabilistic Processes
• Remarks on testing probabilistic processes
• Testing probabilistic automata

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 4115933 (Why is no real title available?)
• A calculus of communicating systems
• Bisimulation through probabilistic testing
• Extensional equivalences for transition systems
• Testing equivalences for processes

Cited in

(22)

• scientific article; zbMATH DE number 1531992 (Why is no real title available?)
• Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
• Testing probabilistic automata
• Probabilistic bisimilarity as testing equivalence
• Testing preorders for probabilistic processes.
• Metrics for labelled Markov processes
• Testing preorders for probabilistic processes can be characterized by simulations
• Measuring the confinement of probabilistic systems
• Non Expansive ε-Bisimulations
• Approximating labelled Markov processes
• Compositional verification of randomized distributed algorithms
• Trace machines for observing continuous-time Markov chains
• Trace semantics for stochastic systems with nondeterminism
• Deciding bisimilarity and similarity for probabilistic processes.
• Probabilistic concurrent constraint programming
• Bisimulation for labelled Markov processes
• Testing Finitary Probabilistic Processes
• scientific article; zbMATH DE number 1538044 (Why is no real title available?)
• Remarks on testing probabilistic processes
• Additive models of probabilistic processes
• Measure and probability for concurrency theorists
• Notes on generative probabilistic bisimulation

This page was built for publication: Testing preorders for probabilistic processes

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