Abstract Probabilistic Automata
DOI10.1007/978-3-642-18275-4_23zbMATH Open1317.68095OpenAlexW3137368705WikidataQ57801213 ScholiaQ57801213MaRDI QIDQ3075492FDOQ3075492
Falak Sher, Kim G. Larsen, Joost-Pieter Katoen, Andrzej Wąsowski, Axel Legay, Benoît Delahaye, Mikkel L. Pedersen
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
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Analyzing security protocols using time-bounded task-PIOAs
- Three-Valued Abstraction for Continuous-Time Markov Chains
- Probability and Nondeterminism in Operational Models of Concurrency
- Modal I/O Automata for Interface and Product Line Theories
- A testing scenario for probabilistic processes
- Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
- Compositional Abstraction for Stochastic Systems
- A Probabilistic Extension of UML Statecharts
- Model Checking Software
- Switched PIOA: parallel composition via distributed scheduling
Cited In (13)
- On Abstraction of Probabilistic Systems
- Probabilistic ω-automata
- Stuttering for Abstract Probabilistic Automata
- Probabilistic asynchronous automata
- A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems
- Task-structured probabilistic I/O automata
- Maximizing entropy over Markov processes
- Model Checking Probabilistic Systems
- Specification Theories for Probabilistic and Real-Time Systems
- Extending modal transition systems with structured labels
- Quantitative Automata under Probabilistic Semantics
- Title not available (Why is that?)
- Abstract probabilistic automata
This page was built for publication: Abstract Probabilistic Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3075492)
