Timed lossy channel systems

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 18, Issue , 2012, Pages 374-386

  Abdulla, Parosh Aziz ^a   Atig, Mohamed Faouzi ^a   Cederberg, Jonathan ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

Lossy channel systems; Model checking; Timed automata

Indexed keywords

CLASSICAL MODEL; CONTROL STATE; FINITE ALPHABET; LOSSY CHANNEL SYSTEMS; TIMED AUTOMATA; WEAK MEMORY MODELS;

AUTOMATA THEORY; MODEL CHECKING; SOFTWARE ENGINEERING;

APPLICATION PROGRAMS;

EID: 84880237534     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2012.374     Document Type: Conference Paper

References (22)

1. P. A. Abdulla. Well (and better) quasi-ordered transition systems. The Bulletin of Symbolic Logic, 16(4):457-515, 2010.
2. P. A. Abdulla, M. F. Atig, and J. Cederberg. Timed lossy channel systems. Technical Report 2012-031, Department of Information Technology, Uppsala University, October 2012.
3. P. A. Abdulla, M. F. Atig, and J. Stenman. Dense-timed pushdown automata. In LICS. IEEE Computer Society, 2012.
4. P. A. Abdulla, M. F. Atig, and J. Stenman. The minimal cost reachability problem in priced timed pushdown systems. In LATA, volume 7183 of LNCS, 2012.
5. P. A. Abdulla and A. Nylén. Timed Petri nets and BQOs. In ICATPN, 2001.
6. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Carl Leonardsson, and Ahmed Rezine. Counter-example guided fence insertion under tso. In TACAS, 2012.
7. Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, and Yih-Kuen Tsay. General decidability theorems for infinite-state systems. In LICS, pages 313-321, 1996.
8. Parosh Aziz Abdulla and Bengt Jonsson. Verifying programs with unreliable channels. In LICS, pages 160-170. IEEE Computer Society, 1993.
9. R. Alur and D. L. Dill. A theory of timed automata. Theor. Comput. Sci., 126(2):183-235, 1994.
10. M. F. Atig, A. Bouajjani, S. Burckhardt, and M. Musuvathi. On the verification problem for weak memory models. In POPL, pages 7-18. ACM, 2010.
11. M. Benerecetti, S. Minopoli, and A. Peron. Analysis of timed büchi state machines. In TIME, pages 61-68. IEEE Computer Society, 2010.
12. B. Bérard, F. Cassez, S. Haddad, O. Roux, and D. Lime. Comparison of different semantics for time Petri nets. In ATVA 2005, 2005.
13. A. Bouajjani, R. Echahed, and R. Robbana. On the automatic verification of systems with continuous variables and unbounded discrete data structures. In Hybrid Systems, LNCS 999, pages 64-85. Springer, 1994.
14. P. Bouyer, F. Cassez, E. Fleury, and K. G. Larsen. Optimal strategies in priced timed game automata. In FSTTCS, LNCS 3328, pages 148-160. Springer, 2004.
15. P. Bouyer and F. Laroussinie. Model checking timed automata. In Stephan Merz and Nicolas Navet, editors, Modeling and Verification of Real-Time Systems, pages 111-140. ISTE Ltd. - John Wiley & Sons, Ltd., January 2008.
16. Pierre Chambart and Philippe Schnoebelen. The ordinal recursive complexity of lossy channel systems. In LICS, pages 205-216. IEEE Computer Society Press, 2008.
17. Z. Dang. Pushdown timed automata: a binary reachability characterization and safety verification. Theor. Comput. Sci., 302(1-3):93-121, 2003.
18. Z. Dang, T. Bultan, O. H. Ibarra, and R. A. Kemmerer. Past pushdown timed automata and safety verification. Theor. Comput. Sci., 313(1):57-71, 2004.
19. M. Emmi and R. Majumdar. Decision problems for the verification of real-time software. In HSCC, LNCS 3927, pages 200-211. Springer, 2006.
20. M. Hague and L. Ong. Symbolic backwards-reachability analysis for higher-order pushdown systems. Logical Methods in Computer Science, 4(4), 2008.
21. G. Higman. Ordering by divisibility in abstract algebras. Proc. London Math. Soc. (3), 2(7):326-336, 1952.
22. A. Trivedi and D. Wojtczak. Recursive timed automata. In ATVA, pages 306-324, 2010.