Effective Lossy Queue Languages
Although the set of reachable states of a lossy channel system (LCS) is regular, it is well-known that this set cannot be constructed effectively. In this paper, we characterize significant classes of LCS for which the set of reachable states can be computed. Furthermore, we show that, for slight generatlizations of these classes, computability can no longer be achieved.
To carry out our study, we define rewriting systems which capture the behaviour of LCS, in the sense that (i) they have a FIFO-like semantics and (ii) their languages are downward closed with respect to the substring relation. The main result of the paper shows that, for context-free rewriting systems, the corresponding language can be computed. An interesting consequence of our results is that we get a characterization of classes of meta-transitions whose post-images can be effectively constructed. These meta-transitions consist of sets of nested loops in the control graph of the system, in contrast to previous works on meta-transitions in which only single loops are considered.
Essentially the same proof technique we use to show the result mentioned above allows also to establish a result in the theory of 0L-systems, i.e., context-free parallel rewriting systems. We prove that the downward closure of the language generated by any 0L-system is effectively regular.
KeywordsSingle Loop Nest Loop Reachable State Nonterminal Symbol Downward Closure
Unable to display preview. Download preview PDF.
- [AAB99]Parosh Aziz Abdulla, Aurore Annichini, and Ahmed Bouajjani. Algorithmic verification of lossy channel systems: An application to the bounded retransmission protocol. In TACAS’99. LNCS 1579, 1999.Google Scholar
- [ABJ98]Parosh Aziz Abdulla, Ahmed Bouajjani, and Bengt Jonsson. On-the-fly analysis of systems with unbounded, lossy fifo channels. In CAV’98. LNCS 1427, 1998.Google Scholar
- [BG96]B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDDs. In CAV’96. LNCS 1102, 1996.Google Scholar
- [BGWW97]B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of QDDs. In SAS’97. LNCS 1302, 1997.Google Scholar
- [BH97]A. Bouajjani and P. Habermehl. Symbolic reachability analysis of fifo-channel systems with nonregular sets of configurations. In ICALP’ 97. LNCS 1256, 1997.Google Scholar
- [Bur98]O. Burkart. Queues as processes. Electrnic Notes in Theoretical Computer Science, 18, 1998.Google Scholar
- [CHS92]S. Christensen, H. Hüttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. In CONCUR’ 92. LNCS, 1992.Google Scholar
- [CVWY90]C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. In CAV’90, 1990.Google Scholar
- [GH94]J.F. Groote and H. Hüttel. Undecidable equivelences for basic process algebra. Information and Computation, 1994.Google Scholar
- [GvdP93]J.F. Groote and J. van de Pol. A bounded retransmission protocol for large data packets. Tech. report, Dept. of Philosophy, Utrecht University, Oct. 1993.Google Scholar
- [Hol91]G.J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.Google Scholar
- [May00]R. Mayr. Undecidable problems in unreliable computations. In LATIN’2000. LNCS 1776, 2000.Google Scholar
- [RS80]G. Rozenberg and A. Salomaa. The Mathematical Theory of L-systems. Academic Press, 1980.Google Scholar
- [Sti96]C. Stirling. Decidability of bisimulation equivalence for normed push-down processes. In CONCUR’96. LNCS 1119, 1996.Google Scholar