Abstract Probabilistic Automata

DOI10.1007/978-3-642-18275-4_23zbMath1317.68095OpenAlexW3137368705WikidataQ57801213 ScholiaQ57801213MaRDI QIDQ3075492

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

Publication date: 15 February 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-18275-4_23

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (8)

Model Checking Probabilistic Systems ⋮ Stuttering for Abstract Probabilistic Automata ⋮ Extending modal transition systems with structured labels ⋮ A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems ⋮ On Abstraction of Probabilistic Systems ⋮ Abstract probabilistic automata ⋮ Maximizing entropy over Markov processes ⋮ Specification Theories for Probabilistic and Real-Time Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Switched PIOA: parallel composition via distributed scheduling
• Analyzing security protocols using time-bounded task-PIOAs
• 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
• Three-Valued Abstraction for Continuous-Time Markov Chains
• 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