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]
@inproceedings{PolrolaPS03:0, title = {Towards Efficient Partition Refinement for Checking Reachability in Timed Automata}, author = {Agata Pólrola and Wojciech Penczek and Maciej Szreter}, year = {2003}, url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2791&spage=2}, tags = {refinement, partitioning}, researchr = {https://researchr.org/publication/PolrolaPS03%3A0}, cites = {0}, citedby = {0}, pages = {2-17}, booktitle = {Formal Modeling and Analysis of Timed Systems: First International Workshop, FORMATS 2003, Marseille, France, September 6-7, 2003. Revised Papers}, editor = {Kim Guldstrand Larsen and Peter Niebert}, volume = {2791}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-21671-5}, }