Abstract
We look at a model of a queue system M that consists of the following components:
-
1.
Two nondeterministic finite-state machines W and R, each augmented with finitely many reversal-bounded counters (thus, each counter can be incremented or decremented by 1 and tested for zero, but the number of alternations between nondecreasing mode and nonincreasing mode is bounded by a fixed constant). W or R (but not both) can also be equipped with an unrestricted pushdown stack.
-
2.
One unrestricted queue that can be used to send messages from W (the “writer”) to R (the “reader”). There is no bound on the length of the queue. When R tries to read from an empty queue, it receives an “empty-queue” signal. When this happens, R can continue doing other computation and can access the queue at a later time..
W and R operate at the same clock rate, i.e., each transition (instruction) takes one time unit. There is no central control. Note that since M is nondeterministic there are, in general, many computation paths starting from a given initial configuration. We investigate the decidable properties of queue systems. For example, we show that it is decidable to determine, given a system M, whether there is some computation in which R attempts to read from an empty queue. Other verification problems that we show solvable include (binary, forward, and backward) reachability, safety, invariance, etc. We also consider some reachability questions concerning machines operating in parallel.
Supported in part by NSF grant IRI-9700370.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Alur, C. Courcoibetis, and D. Dill. Model-checking in dense real time. Information and Computation, 104(1):2–34, 1993.
R. Alur and D. Dill. Automata for modeling real-time systems. Theoretical Computer Science, 126(2):183–236, 1994.
R. Alur and T.A. Henzinger. A really temporal logic. J. ACM, 41(1):181–204, 1994.
A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Pushdown Automata: Application to Model-Checking. CONCUR 1997, pp. 135–150.
B. Boigelot and P. Godefroid. “Symbolic verification of communication protocols with infinite state spaces using QDDs.” In Proc. Int. Conf. on Computer Aided Verification, pages 1–12, 1996.
A. Bouajjani, R. Echahed and R. Robbana. “On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures.” In Hybrid Systems II, LNCS 999, 1995.
A. Bouajjani and P. Habermehl. “Constrained Properties, Semilinear Systems, and Petri Nets.” In CONCUR’96, LNCS 1119, 1996.
A. Bouajjani and P. Habermehl. “Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations.” Theoretical Computer Science, 221(1-2): 211–250, 1999.
B. Boigelot and P. Wolper, Symbolic verification with periodic sets, Proc. 6th Int. Conf. on Computer Aided Verification, 1994
H. Comon and Y. Jurski. Multiple counters automata, safety analysis and Presburger arithmetic. Proc. 10th Int. Conf. on Computer Aided Verification, pp. 268–279, 1998.
Z. Dang, O.H. Ibarra, T. Bultan, R.A. Kemmerer, and J. Su. Binary reachability analysis of discrete pushdown timed automata. To appear in Int. Conf. on Computer Aided Verification, 2000.
J. Esparza. Decidability of Model Checking for Infinite-State Concurrent Systems. Acta Informatica, 34(2): 85–107, 1997.
A. Finkel and G. Sutre. Decidability of Reachability Problems for Classes of Two Counter Automata. STACS’00.
A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems. INFINITY, 1997.
E.M. Gurari and O.H. Ibarra. The complexity of decision problems for finite-turn multicounter machines. JCSS, 22: 220–229, 1981.
J. Hartmanis and J. Hopcroft. What makes some language theory problems undecidable. JCSS, 4: 368–376, 1970.
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.
O.H. Ibarra. Reversal-bounded multicounter machines and their decision problems. J. ACM, Vol. 25, pp. 116–133, 1978.
O.H. Ibarra, T. Bultan, and J. Su. Reachability Analysis for Some Models of Infinite-state Transition Systems. To appear in CONCUR’2000.
O.H. Ibarra and J. Su, A Technique for the Containment and Equivalence of Linear Constraint Queries. Journal of Computer and System Sciences, 59(1):1–28, 1999.
O.H. Ibarra, J. Su, and C. Bartzis, Counter Machines and the Safety and Disjointness Problems for Database Queries with Linear Constraints, to appear in Words, Sequences, Languages: Where Computer Science, Biology and Linguistics Meet, Kluwer, 2000.
O.H. Ibarra, J. Su, Z. Dang, T. Bultan, and R. Kemmerer. Counter Machines: Decidable Properties and Applications to Verification Problems. To appear in MFCS’2000.
M. Minsky. Recursive unsolvability of Post’s problem of Tag and other topics in the theory of Turing machines. Ann. of Math., 74:437–455, 1961.
I. Walukiewicz. Pushdown processes: games and model checking. In Proc. Int. Conf. on Computer Aided Verification, 1996
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ibarra, O.H. (2001). Reachability and Safety in Queue Systems. In: Yu, S., Păun, A. (eds) Implementation and Application of Automata. CIAA 2000. Lecture Notes in Computer Science, vol 2088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44674-5_12
Download citation
DOI: https://doi.org/10.1007/3-540-44674-5_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42491-8
Online ISBN: 978-3-540-44674-3
eBook Packages: Springer Book Archive