On the construction of live timed systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1785, Issue , 2000, Pages 109-126

  Bornot, Sébastien ^a   Gößler, Gregor ^a   Sifakis, Joseph ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS; ALGORITHMS;

LIVENESS; LIVENESS PRESERVATIONS; LOW COSTS; PARALLEL COMPOSITION; PRIORITY ORDER; TIMED SYSTEMS; SUFFICIENT CONDITIONS;

TIME SHARING SYSTEMS;

EID: 84863935115     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-46419-0_9     Document Type: Article

References (16)

1. K. Altisen, G. Gößler, A. Pnueli, J. Sifakis, S. Tripakis, and S. Yovine. A Framework for Scheduler Synthesis. In IEEE RTSS'99 proceedings, 1999.
2. R. Alur and D.L. Dill. A theoryof timed automata. TCS, 126, pp. 183-235, 1994.
3. E. Asarin, O. Maler, and A. Pnueli. Symbolic Controller Synthesis for Discrete and Timed Systems. Hybrid Systems II, LNCS 999, Springer-Verlag, 1995.
4. P. C. Attie. Synthesis of Large Concurrent Programs via Pairwise Composition. In CONCUR'99.
5. J. C. M. Baeten, J. A. Bergstra, and J. W. Klop. Syntax and defining equations for an interrupt mechanism in process algebra. Fundamenta Informaticae 9 (2), pp. 127-168, 1986.
6. S. Bornot and J. Sifakis. On the composition of hybrid systems. In International Workshop "Hybrid Systems: Computation and Control,", LNCS, pp. 49-63. Springer-Verlag, April 1998. (Pubitemid 128055508)
7. S. Bornot and J. Sifakis. An Algebraic Framework for Urgency. In Calculational System Design, NATO Science Series, Computer and Systems Science 173, Marktoberdorf, July1998.
8. S. Bornot, J. Sifakis, and S. Tripakis. Modeling urgencyin timed systems. In COMPOS'97, Malente, Germany. LNCS 1536, Springer-Verlag, 1998.
9. L. P. Carloni, K. L. McMillan, and A. L. Sangiovanni-Vincentelli. Latency In-sensitive Protocols. In CAV'99, Trento, Italy. LNCS 1633, Springer-Verlag, 1999.
10. R. Cleaveland, G. Lüttgen, V. Natarajan, and S. Sims. Priorities for Modeling and Verifying Distributed Systems. In TACAS'96, LNCS 1055, pp. 278-297.
11. T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Proc. 7th Symp. on Logics in Computer Science (LICS'92) and Information and Computation 111(2):193-244, 1994.
12. C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
13. M. V. Iordache, J. O. Moody, and P. J. Antsaklis. A Method for Deadlock Prevention in Discrete Event Systems Using Petri Nets. Technical Report, University of Notre Dame, July1999.
14. H. Kwak, I. Lee, A. Philippou, J. Choi, and O. Sokolsky. Symbolic schedulability analysis of real-time systems. In IEEE RTSS'98, Madrid, Spain, December 1998.
15. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
16. S. Tripakis. Verifying Progress in Timed Systems. In ARTS'99, Bamberg, Germany, 1999 (to appear in LNCS series).