Journal of the ACM (JACM)
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Symbolic model checking for real-time systems
Information and Computation
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
Theoretical Computer Science
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
A technique for proving decidability of containment and equivalence of linear constraint queries
Journal of Computer and System Sciences
Conter Machines: Decidable Properties and Applications to Verification Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Decidability of Reachability Problems for Classes of Two Counters Automata
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Reachability Analysis for Some Models of Infinite-State Transition Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Constrained Properties, Semilinear Systems, and Petri Nets
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Binary Reachability Analysis of Discrete Pushdown Timed Automata
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Pushdown Processes: Games and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Symbolic Verification with Periodic Sets
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
What makes some language theory problems undecidable
Journal of Computer and System Sciences
Finite automata with time-delay blocks
Proceedings of the tenth ACM international conference on Embedded software
Hi-index | 0.00 |
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.