Stuttering for Abstract Probabilistic Automata

DOI10.1007/978-3-642-35722-0_11zbMath1437.68094OpenAlexW1909801755MaRDI QIDQ3455842

Axel Legay, Benoît Delahaye, Kim Guldstrand Larsen

Publication date: 11 December 2015

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35722-0_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Stuttering for abstract probabilistic automata

Uses Software

• MIO Workbench

Cites Work

• Unnamed Item
• Constraint Markov chains
• Branching bisimulation for probabilistic systems: characteristics and decidability
• Proving Approximate Implementations for Probabilistic I/O Automata
• Abstract Probabilistic Automata
• Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
• A Sound Observational Semantics for Modal Transition Systems
• On Weak Modal Compatibility, Refinement, and the MIO Workbench
• Process algebra for performance evaluation

This page was built for publication: Stuttering for Abstract Probabilistic Automata