Timed Lossy Channel Systems

Lossy channel systems are a classical model with applications ranging from the modeling of communication protocols to programs running on weak memory models. All existing work assume that messages traveling inside the channels are picked from a finite alphabet. In this paper, we extend the model by assuming that each message is equipped with a clock representing the age of the message, thus obtaining the model of Timed Lossy Channel Systems (TLCS). The main contribution of the paper is to show that the control state reachability problem is decidable for TLCS.

[1]  Patricia Bouyer,et al.  Model Checking Timed Automata , 2010 .

[2]  Rupak Majumdar,et al.  Decision Problems for the Verification of Real-Time Software , 2006, HSCC.

[3]  Parosh Aziz Abdulla,et al.  Dense-Timed Pushdown Automata , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[4]  Parosh Aziz Abdulla,et al.  Counter-Example Guided Fence Insertion under TSO , 2012, TACAS.

[5]  Patricia Bouyer,et al.  Updatable timed automata , 2004, Theor. Comput. Sci..

[6]  Zhe Dang,et al.  Pushdown timed automata: a binary reachability characterization and safety verification , 2001, Theor. Comput. Sci..

[7]  Sebastian Burckhardt,et al.  On the verification problem for weak memory models , 2010, POPL '10.

[8]  Philippe Schnoebelen,et al.  The Ordinal Recursive Complexity of Lossy Channel Systems , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[9]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[10]  Serge Haddad,et al.  Comparison of Different Semantics for Time Petri Nets , 2005, ATVA.

[11]  Ahmed Bouajjani,et al.  On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures , 1994, Hybrid Systems.

[12]  Parosh Aziz Abdulla,et al.  Well (and Better) Quasi-Ordered Transition Systems , 2010, The Bulletin of Symbolic Logic.

[13]  Parosh Aziz Abdulla,et al.  Timed Petri Nets and BQOs , 2001, ICATPN.

[14]  Parosh Aziz Abdulla,et al.  General decidability theorems for infinite-state systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[15]  Parosh Aziz Abdulla,et al.  The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems , 2012, LATA.

[16]  Parosh Aziz Abdulla,et al.  Verifying Programs with Unreliable Channels , 1996, Inf. Comput..

[17]  Oscar H. Ibarra,et al.  Past pushdown timed automata and safety verification , 2004, Theor. Comput. Sci..

[18]  C.-H. Luke Ong,et al.  Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems , 2007, FoSSaCS.

[19]  Ashutosh Trivedi,et al.  Recursive Timed Automata , 2010, ATVA.

[20]  Parosh Aziz Abdulla,et al.  Verifying programs with unreliable channels , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[21]  Adriano Peron,et al.  Analysis of Timed Recursive State Machines , 2010, 2010 17th International Symposium on Temporal Representation and Reasoning.

[22]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .