Models and temporal logics for timed component connectors

Proceedings of the Second International Conference on Software Engineering and Formal Methods. SEFM 2004

Volumn , Issue , 2004, Pages 198-207

  Arbab, Farhad ^a,c   Baier, Christel ^b   De Boer, Frank ^a,c   Kutten, Jan ^a,d  

^a CWI   (Netherlands)

^b UNIVERSITY OF BONN   (Germany)

^c LEIDEN UNIVERSITY   (Netherlands)

^d VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR TEMPORAL LOGIC (LTL); TIMED CONSTRAINT AUTOMATA (TCA); TIMED INTERFACE AUTOMATA (TIA); TIMED SCHEDULED-DATA-STREAM LOGIC (TSDSL);

ALGORITHMS; COMPUTER SIMULATION; DATA ACQUISITION; DATA FLOW ANALYSIS; MATHEMATICAL MODELS; REAL TIME SYSTEMS;

ELECTRIC CONNECTORS;

EID: 16244368082     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SEFM.2004.1347521     Document Type: Conference Paper

References (16)

1. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
2. Rajeev Alur, Thomas A. Henzinger, and Orna Kupferman. Alternating-time temporal logic. Journal of the ACM, 49:672-713, 2002.
3. F. Arbab. Reo: A channel-based coordination model for component composition. Mathematical Structures in Computer Science, 14(3):1-38, 2004.
4. F. Arbab, C. Baier, J.J.M.M. Rutten, and M. Sirjani. Modeling component connectors in reo by constraint automata. In FOCLASA'03, Electronic Notes in Theoretical Computer Science, 2003. To appear.
5. F. Arbab and J.J.M.M. Rutten. A coinductive calculus of component connectors. In D. Pattinson M. Wirsing and R. Hennicker, editors, Proceedings of 16th International Workshop on Algebraic Development Techniques (WADT 2002), volume 2755 of Lecture Notes in Computer Science, pages 35-56. Springer-Verlag, 2003.
6. E. Asarin, P. Caspi, and O. Maler. Timed regular expressions. Journal of the ACM, 49(2): 172-206, 2002.
7. K. Cerans. Decidability of bisimulation equivalences for parallel timer processes. In Proc. CAV, volume 663 of LNCS, pages 302-315, 1993.
8. L. de Alfaro, T. A. Henzinger, and M. Stoelinga. Timed interfaces. In Proc. EMSOFT, volume 2491 of LNCS, pages 108-122, 2002.
9. R. Gawlick, R. Segala, J. Soegaard-Andersen, and N. Lynch. Liveness in timed and untimed systems. Information and Computation, 141(2): 119-171, 1998.
10. T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic Model Checking for Real-Time Systems. Information and Computation, 111(2): 193-244, 1994.
11. D.K. Kaynar, N.A. Lynch, R. Segala, and F.W. Vaandrager. A framework for modelling timed systems with restricted hybrid automata. In Proceedings 24th IEEE International Real-Time Systems Symposium (RTSS'03), pages 166-177. IEEE Computer Society, 2003.
12. M. Merritt, F. Modugno, and M. R. Tuttle. Time-constrained automata (extended abstract). In Proc. CONCUR, volume 527 of LNCS, pages 408-423, 1991.
13. G. M. Reed and A. W. Roscoe. A timed model for communication sequential processes. Theoretical Computer Science, 58:249-261, 1988.
14. S. Tasiran, R. Alur, R. Kurshan, and R. Brayton. Verifying abstractions of timed systems. In Proc. CONCUR, volume 1119 of LNCS, pages 546-562, 1996.
15. P. Wolper. Specification and synthesis of communicating processes using an extended temporal logic. In Proc.POPL, pages 20-33, 1982.
16. W. Yi. CCS + time = an interleaving model for real time systems. In Proc. ICALP, volume 510 of LNCS, pages 217-228. Springer-Verlag, 1991.