Towards Efficient Partition Refinement for Checking Reachability in Timed Automata

Agata Pólrola, Wojciech Penczek, Maciej Szreter. Towards Efficient Partition Refinement for Checking Reachability in Timed Automata. In Kim Guldstrand Larsen, Peter Niebert, editors, Formal Modeling and Analysis of Timed Systems: First International Workshop, FORMATS 2003, Marseille, France, September 6-7, 2003. Revised Papers. Volume 2791 of Lecture Notes in Computer Science, pages 2-17, Springer, 2003. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.