Statistical Model Checking for Networks of Priced Timed Automata
DOI10.1007/978-3-642-24310-3_7zbMath1348.68130OpenAlexW2163626018MaRDI QIDQ3172845
Jonas van Vliet, Zheng Wang, Axel Legay, Alexandre David, Marius Mikučionis, Danny Bøgsted Poulsen, Kim Guldstrand Larsen
Publication date: 7 October 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-24310-3_7
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) 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 (6)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems
- The algorithmic analysis of hybrid systems
- Bisimulation through probabilistic testing
- A theory of timed automata
- Hybrid systems: computation and control. 4th international workshop, HSCC 2001, Rome, Italy, March 28--30, 2001. Proceedings
- Timed I/O automata
- Bayesian statistical model checking with application to Simulink/Stateflow verification
- A Compositional Translation of Timed Automata with Deadlines to Uppaal Timed Automata
- Computer Aided Verification
- Probabilistic and Topological Semantics for Timed Automata
- Formal Methods for the Design of Real-Time Systems
- Computer Aided Verification
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: Statistical Model Checking for Networks of Priced Timed Automata