Sampled semantics of timed automata

Logical Methods in Computer Science

Volumn 6, Issue 3, 2010, Pages 1-37

  Abdulla, Parosh Aziz ^a   Krcal, Pavel ^a   Yi, Wang ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

Decidability; Limitedness; Sampling; Timed automata

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; VERIFICATION;

DENSE-TIME; HARDWARE SYSTEM; LIMITEDNESS; MODELING AND VERIFICATIONS; SAMPLING RATES; SOFTWARE-SYSTEMS; SYSTEM MODELS; SYSTEM VERIFICATIONS; TIME BEHAVIOR; TIMED AUTOMATA;

SEMANTICS;

EID: 77957567081     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-6(3:14)2010     Document Type: Article

References (20)

1. [AD94] R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
2. [AKY08] P. A. Abdulla, P. Krcal, and W. Yi. R-automata. In Proc. of CONCUR'08, volume 5201 of LNCS, pages 67-81. Springer-Verlag, 2008.
3. [AMP98] E. Asarin, O. Maler, and A. Pnueli. On discretization of delays in timed automata and digital circuits. In Proc. of CONCUR'98, volume 1466 of LNCS, pages 470-484. Springer-Verlag, 1998.
4. [AT05] K. Altisen and S. Tripakis. Implementation of timed automata: An issue of semantics or modeling? In Proc. of FORMATS'05, volume 3829 of LNCS, pages 273-288. Springer-Verlag, 2005.
5. [BC06] M. Bojanczyk and T. Colcombet. Bounds in omega-regularity. In Proc. of LICS'06, pages 285-296. IEEE Computer Society Press, 2006.
6. [CHR02] F. Cassez, T. A. Henzinger, and J.-F. Raskin. A comparison of control problems for timed and hybrid systems. In Proc. of HSCC'02, volume 2289 of LNCS, pages 134-148. Springer-Verlag, 2002.
7. [CL08a] T. Colcombet and C. Loding. The nesting-depth of disjunctive ^-calculus for tree languages and the limitedness problem. In Proc. of CSL'08, volume 5213 of LNCS, pages 416-430. Springer-Verlag, 2008.
8. [CL08b] T. Colcombet and C. Loding. The non-deterministic Mostowski hierarchy and distance-parity automata. In Proc. of ICALP'08, volume 5126 of LNCS, pages 398-409. Springer-Verlag, 2008.
9. [GPV94] A. Gollü, A. Puri, and P. Varaiya. Discretization of timed automata. In Proc. of CDC'94, pages 957-958, 1994.
10. [Has82] K. Hashiguchi. Limitedness theorem on finite automata with distance functions. Computer and System Sciences, 24(2):233-244, 1982.
11. [Has90] K. Hashiguchi. Improved limitedness theorems on finite automata with distance functions. Theoretical Computer Science, 72(1):27-38, 1990.
12. [HMP92] T. A. Henzinger, Z. Manna, and A. Pnueli. What good are digital clocks? In Proc. of ICALP'92, volume 623 of LNCS, pages 545-558. Springer-Verlag, 1992.
13. [Kir05] D. Kirsten. Distance desert automata and the star height problem. Informatique Theorique et Applications, 39(3):455-509, 2005.
14. [KMTY04] P. Krcál, L. Mokrushin, P. S. Thiagarajan, and W. Yi. Timed vs. time triggered automata. In Proc. of CONCUR'04, volume 3170 of LNCS, pages 340-354. Springer-Verlag, 2004.
15. [KP05] P. Krcál and R. Pelánek. On sampled semantics of timed systems. In Proc. of FSTTCS'05, volume 3821 of LNCS, pages 310-321. Springer-Verlag, 2005.
16. [Leu91] H. Leung. Limitedness theorem on finite automata with distance functions: an algebraic proof. Theoretical Computer Science, 81(1):137-145, 1991.
17. [OWü3a] J. Ouaknine and J. Worrell. Revisiting digitization, robustness, and decidability for timed automata. In Proc. ofLICS'03, pages 198-207. IEEE Computer Society Press, 2003.
18. [OWü3b] J. Ouaknine and J. Worrell. Universality and language inclusion for open and closed timed automata. In Proc. of HSCC'03, volume 2623 of LNCS, pages 375-388. Springer-Verlag, 2003.
19. [Sim94] I. Simon. On semigroups of matrices over the tropical semiring. Informatique Theorique et Applications, 28(3-4):277-294, 1994.
20. [WDR04] M. De Wulf, L. Doyen, and J.-F. Raskin. Almost ASAP semantics: From timed models to timed implementations. In Proc. of HSCC'04, volume 2993 of LNCS, pages 296-310. Springer-Verlag, 2004.