Publication details
How to Order Vertices for Distributed LTL Model
-Checking Based on Accepting Predecessors
| Basic information | |
|---|---|
| Original title: | How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors |
| Authors: | Luboš Brim, Ivana Černá, Pavel Moravec, Jiří Šimša |
| Further information | |
|---|---|
| Citation: | BRIM, Luboš - ČERNÁ, Ivana - MORAVEC, Pavel - ŠIMŠA, Jiří. How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors. In Proceedings of the 4th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC 2005). Lisboa, Portugal : TU Munchen, 2005. pp. 1-12. 2005, Lisboa, Portugal. |
| Original language: | English |
| Field: | Informatika |
| Type: | Article in Proceedings |
| Keywords: | accepting predecessors; LTL model checking |
The distributed automata-based LTL model-checking relies on algorithms for finding accepting cycles in a B\"{u}chi automaton. One approach to distributed accepting cycle detection is based on maximal accepting predecessors. The ordering of accepting states (hence the maximality) is one of the main factors affecting the overall complexity of model-checking as imperfect ordering can enforce numerous re-explorations of the automaton. This paper addresses the problem of finding an optimal ordering, proves its hardness, and gives several heuristics for finding an optimal ordering in the distributed environment. We compare the heuristics both theoretically and experimentally, and find out which of these work well.
Related projects:
- Automated Verification of Parallel and Distributed Systems
- Integrated approach to education of PhD students in the area of parallel and distributed systems
- Techniques for automatic verification and validation of software nad hardware systems
- Institute for Theoretical Computer Science
- Highly Parallel and Distributed Computing Systems
