Validation of Stochastic Systems

DOI10.1007/B98484MaRDI QIDQ5325833zbMATH OpenOpenAlexFDO

Authors Ana Sokolova, Erik de Vink

Publication date 24 July 2009

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

Full work available at URL https://doi.org/10.1007/b98484

zbMATH Keywords

probabilistic automatanondeterminismprobabilistic bisimulationprobabilistic transition systemsparallel compositionpreservation and reflection of bisimulation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) 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

• A hierarchy of probabilistic system types
• A hierarchy of probabilistic system types
• Probabilistic logical characterization
• Cost preserving bisimulations for probabilistic automata
• Bisimulations meet PCTL equivalences for probabilistic automata

Cited in

(30)

• Probabilistic logical characterization
• Conditional Probabilities over Probabilistic and Nondeterministic Systems
• \(L^\ast\)-based learning of Markov decision processes (extended version)
• Probabilistic Analysis of Binary Sessions
• Branching bisimulation congruence for probabilistic systems
• Switched PIOA: parallel composition via distributed scheduling
• Axiomatizations for probabilistic finite-state behaviors
• Observing branching structure through probabilistic contexts
• scientific article; zbMATH DE number 1836414 (Why is no real title available?)
• Making random choices invisible to the scheduler
• SOS formats and meta-theory: 20 years after
• The compositional construction of Markov processes. II
• A hierarchy of probabilistic system types
• On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
• A hierarchy of probabilistic system types
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
• Group-by-group probabilistic bisimilarities and their logical characterizations
• Equivalence checking 40 years after: a review of bisimulation tools
• Relating strong behavioral equivalences for processes with nondeterminism and probabilities
• Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
• Compositional strategy synthesis for stochastic games with multiple objectives
• Weak bisimulation for probabilistic timed automata
• Task-structured probabilistic I/O automata
• Causal Unfoldings
• Determining asynchronous test equivalence for probabilistic processes
• Mixed nondeterministic-probabilistic automata: blending graphical probabilistic models with nondeterminism
• The compositional construction of Markov processes
• A Hemimetric Extension of Simulation for Semi-Markov Decision Processes
• Leveraging weighted automata in compositional reasoning about concurrent probabilistic systems
• A formalized hierarchy of probabilistic system types. Proof pearl

This page was built for publication: Validation of Stochastic Systems

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