Relating timed and register automata

Electronic Proceedings in Theoretical Computer Science, EPTCS

Volumn 41, Issue , 2010, Pages 61-75

  Figueira, Diego ^a   Hofman, Piotr ^b   Lasota, Slawomir ^b  

^a CNRS   (France)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

CLOCKS; COMPUTABILITY AND DECIDABILITY; DECISION THEORY;

ALTERNATING AUTOMATA; COMPLEXITY RESULTS; DATA VALUES; DECISION PROBLEMS; MODELS OF COMPUTATION; NEW RESULTS; NON-PRIMITIVE RECURSIVE COMPLEXITY; TIMED AUTOMATA;

AUTOMATA THEORY;

EID: 84996504294     PISSN: 20752180     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4204/EPTCS.41.5     Document Type: Conference Paper

References (18)

1. Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine & James Worrell (2005): Decidability and Complexity Results for Timed Automata via Channel Machines. In: ICALP, pp. 1089-1101. Available at http://dx. doi.org/10.1007/11523468-88.
2. Rajeev Alur & David L. Dill (1994): A theory of timed automata. Theoretical Computer Science 126, pp. 183-235.
3. Pierre Chambart & Philippe Schnoebelen (2008): The Ordinal Recursive Complexity of Lossy Channel Systems. In: LICS, IEEE Computer Society Press, pp. 205-216. Available at http://www.lsv.ens-cachan. fr/Publis/PAPERS/PDF/CS-lics08.pdf.
4. Stéphane Demri & Ranko Lazić (2009): LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log. 10(3). Available at http://doi.acm.org/10.1145/1507244.1507246.
5. Diego Figueira, Santiago Figueira, Sylvain Schmitz & Philippe Schnoebelen (2010): Ackermann and Primitive-Recursive Bounds with Dickson's Lemma. ArXiv e-prints Available at http://arxiv.org/abs/ 1007.2989.
6. Diego Figueira & Luc Segoufin (2009): Future-Looking Logics on Data Words and Trees. In: MFCS, pp. 331-343. Available at http://dx.doi.org/10.1007/978-3-642-03816-7-29.
7. Mark Jenkins, Joël Ouaknine, Alexander Rabinovich & James Worrell (2010): Alternating Timed Automata over Bounded Time. In: LICS, IEEE Computer Society Press.
8. Michael Kaminski & Nissim Francez (1994): Finite-Memory Automata. Theor. Comput. Sci. 134(2), pp. 329-363.
9. Sławomir Lasota & Igor Walukiewicz (2008): Alternating timed automata. ACM Trans. Comput. Log. 9(2).
10. Ranko Lazić (2006): Safely Freezing LTL. In: FSTTCS, pp. 381-392. Available at http://dx.doi.org/ 10.1007/11944836-35.
11. Ranko Lazić (2008): Safety alternating automata on data words. CoRR abs/0802.4237. Available at http: //arxiv.org/abs/0802.4237.
12. M.H. Löb & S.S. Wainer (1970): Hierarchies of number theoretic functions, I. Archiv für Mathematische Logik und Grundlagenforschung 13, pp. 39-51.
13. Frank Neven, Thomas Schwentick & Victor Vianu (2004): Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log. 5(3), pp. 403-435. Available at http://doi.acm.org/10.1145/ 1013560.1013562.
14. Joël Ouaknine & James Worrell (2004): On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap. In: LICS, IEEE Computer Society Press, pp. 54-63. Available at http://csdl. computer.org/comp/proceedings/lics/2004/2192/00/21920054abs.htm.
15. Joël Ouaknine & James Worrell (2005): On the Decidability of Metric Temporal Logic. In: LICS, IEEE Computer Society Press, pp. 188-197. Available at http://dx.doi.org/10.1109/LICS.2005.33.
16. Joël Ouaknine & James Worrell (2006): Safety Metric Temporal Logic Is Fully Decidable. In: TACAS, pp. 411-425. Available at http://dx.doi.org/10.1007/11691372-27.
17. Paweł Parys & Igor Walukiewicz (2009): Weak Alternating Timed Automata. In: ICALP, pp. 273-284. Available at http://dx.doi.org/10.1007/978-3-642-02930-1-23.
18. Philippe Schnoebelen (2010): Revisiting Ackermann-hardness for lossy counter systems and reset Petri nets. In: MFCS 2010, LNCS 6281, Springer. Available at http://www.lsv.ens-cachan.fr/~phs.