Dealing with practical limitations of distributed timed model checking for timed automata
From MaRDI portal
Publication:2431767
DOI10.1007/S10703-006-0012-3zbMath1110.68073OpenAlexW2004173170MaRDI QIDQ2431767
Victor Braberman, F. Schapachnik, A. Olivero
Publication date: 24 October 2006
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-006-0012-3
Timed automataReachabilityRedistributionReconfigurationDBMDistributed timed model checkingLoad-balance
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (1)
Uses Software
Cites Work
- Model-checking in dense real-time
- A theory of timed automata
- Symbolic model checking for real-time systems
- A scalable parallel algorithm for reachability analysis of very large circuits
- Dealing with practical limitations of distributed timed model checking for timed automata
- Computer Aided Verification
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Dealing with practical limitations of distributed timed model checking for timed automata