Abstract probabilistic automata

DOI10.1016/J.IC.2013.10.002zbMath1296.68092OpenAlexW2163161023WikidataQ57800969 ScholiaQ57800969MaRDI QIDQ386011

Joost-Pieter Katoen, Andrzej Wąsowski, Falak Sher, Axel Legay, Mikkel L. Pedersen, Benoît Delahaye, Kim Guldstrand Larsen

Publication date: 13 December 2013

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2013.10.002

zbMATH Keywords

abstractionspecificationprobabilistic automatacompositional reasoninginterface automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (5)

Parameter Synthesis Algorithms for Parametric Interval Markov Chains ⋮ Unnamed Item ⋮ Mixed nondeterministic-probabilistic automata: blending graphical probabilistic models with nondeterminism ⋮ Counterexample-guided inductive synthesis for probabilistic systems ⋮ Consistency in parametric interval probabilistic timed automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constraint Markov chains
• On determinism in modal transition systems
• Switched PIOA: parallel composition via distributed scheduling
• Analyzing security protocols using time-bounded task-PIOAs
• Decision Problems for Interval Markov Chains
• Abstract Probabilistic Automata
• Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
• A testing scenario for probabilistic processes
• Compositional Abstraction for Stochastic Systems
• A Probabilistic Extension of UML Statecharts
• Modal I/O Automata for Interface and Product Line Theories
• Probability and Nondeterminism in Operational Models of Concurrency
• Model Checking Software

This page was built for publication: Abstract probabilistic automata