Safraless Procedures for Timed Specifications

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.

[1]  Pierre-Yves Schobbens,et al.  The Logic of Event Clocks - Decidability, Complexity and Expressiveness , 1998, J. Autom. Lang. Comb..

[2]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[3]  Orna Kupferman,et al.  Safraless decision procedures , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[4]  S. Safra,et al.  On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[5]  Nir Piterman,et al.  From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[6]  Bernd Finkbeiner,et al.  Bounded synthesis , 2012, International Journal on Software Tools for Technology Transfer.

[7]  Orna Kupferman,et al.  Weak alternating automata are not that weak , 2001, TOCL.

[8]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[9]  Pierre-Yves Schobbens,et al.  The Regular Real-Time Languages , 1998, ICALP.

[10]  Pierre-Yves Schobbens,et al.  Fully decidable logics, automata and classical theories for defining regular real-time languages , 1999 .

[11]  Cnrs Fre,et al.  Model Checking a Path (Preliminary Report) , 2003 .

[12]  Jean-François Raskin,et al.  Antichain Algorithms for Finite Automata , 2010, TACAS.

[13]  Thomas A. Henzinger,et al.  Event-Clock Automata: A Determinizable Class of Timed Automata , 1999, Theor. Comput. Sci..

[14]  Thomas A. Henzinger,et al.  The Element of Surprise in Timed Games , 2003, CONCUR.

[15]  Mohamed Nassim Seghir,et al.  A Lightweight Approach for Loop Summarization , 2011, ATVA.

[16]  Jean-François Raskin,et al.  An Antichain Algorithm for LTL Realizability , 2009, CAV.

[17]  Jirí Srba,et al.  Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets , 2008, FORMATS.

[18]  Jean-François Raskin,et al.  Realizability of Real-Time Logics , 2009, FORMATS.

[19]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[20]  Kim G. Larsen,et al.  UPPAAL-Tiga: Time for Playing Games! , 2007, CAV.