Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Theoretical Computer Science
Event-clock automata: a determinizable class of timed automata
Theoretical Computer Science
The logic of event clocks: decidability, complexity and expressiveness
Automatica (Journal of IFAC)
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
The Regular Real-Time Languages
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
An Antichain Algorithm for LTL Realizability
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Realizability of Real-Time Logics
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
UPPAAL-Tiga: time for playing games!
CAV'07 Proceedings of the 19th international conference on Computer aided verification
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Antichain algorithms for finite automata
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Event clock automata: from theory to practice
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Recent challenges and ideas in temporal synthesis
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Simulation validation using the compatibility between simulation model and experimental frame
Proceedings of the 2013 Summer Computer Simulation Conference
| Hi-index | 0.00 |
This paper presents extensions of Safraless algorithms proposed in the literature for automata on infinite untimed words to the case of automata on infinite timed words.