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

nondeterminismparallel compositionpreservation and reflection of bisimulationprobabilistic automataprobabilistic bisimulationprobabilistic transition systems

Mathematics Subject Classification ID

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

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

(33)

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

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)