“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Theoretical Computer Science
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Model checking for programming languages using VeriSoft
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of formal languages, vol. 1
Model checking
Modeling and verification of parallel processes
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
On the Decidability of Metric Temporal Logic
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Simulation relations for alternating Büchi automata
Theoretical Computer Science
From complementation to certification
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Deductive verification of alternating systems
Formal Aspects of Computing
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Efficient software model checking of soundness of type systems
Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
| Hi-index | 0.00 |
In this paper, we present a class of powerful canonical timed alternating automata and a formalism for describing timed linear temporal logic to software model checking. Time and alternation, these two "metaphors" have dominated automata theory research in recent years. For real-time systems, it is important to augment untimed and asynchronous models of computation with the notion of time. Nevertheless, alternation is a powerful parallelism feature that has the potential to improve and reduce the state-space explosion problem in building large software model checking systems. We show that the dual connection between timed automata-theoretical and propositional-logic frameworks support and model software specifications. This can be established through languages over infinite timed words; and has a direct impact for expressing logical aspects and properties of model checking software systems.