Compositional Design of Stochastic Timed Automata

DOI10.1007/978-3-319-34171-2_9zbMath1475.68146OpenAlexW2477000045MaRDI QIDQ5740181

Pierre Carlier, Thomas Brihaye, Patricia Bouyer, Quentin Menet

Publication date: 25 July 2016

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-34171-2_9

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)

Related Items

Compositional Design of Stochastic Timed Automata

Uses Software

• MoDeST

Cites Work

• Unnamed Item
• Unnamed Item
• Interactive Markov chains. And the quest for quantified quality
• Event-clock automata: a determinizable class of timed automata
• A theory of timed automata
• Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
• Fun with fireWire: A comparative study of formal verification methods applied to the IEEE 1394 root contention protocol
• The theory of interactive generalized semi-Markov processes
• Comparative branching-time semantics for Markov chains
• A theory of stochastic systems. I: Stochastic automata
• A theory of stochastic systems. II: Process algebra
• Compositional Verification and Optimization of Interactive Markov Chains
• Stochastic Timed Automata
• Verification of Open Interactive Markov Chains
• The How and Why of Interactive Markov Chains
• Fixed-Delay Events in Generalized Semi-Markov Processes Revisited
• Bisimulation and Simulation Relations for Markov Chains
• Compositional Design of Stochastic Timed Automata