A practical algorithm for exact array dependence analysis
Communications of the ACM
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
Journal of the ACM (JACM)
Model checking of systems with many identical timed processes
Theoretical Computer Science
Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Real-Time Scheduling by Queue Automata
Proceedings of the Second International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Binary Reachability Analysis of Discrete Pushdown Timed Automata
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Liveness and Acceleration in Parameterized Verification
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Automatic Abstraction Using Generalized Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract)
CAV '97 Proceedings of the 9th 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
On composition and lookahead delegation of e-services modeled by automata
Theoretical Computer Science
Composability of infinite-state activity automata
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Real-Counter automata and their decision problems
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Hi-index | 0.00 |
We propose a new infinite-state model, called the Multi-queue Discrete Timed Automaton MQDTA, which extends Timed Automata with queues, but only has integer-valued clocks. Due to careful restrictions on queue usage, the binary reachability (the set of all pairs of configurations (α, β) of an MQDTA such that α can reach β through zero or more transitions) is effectively semilinear. We then prove the decidability of a class of Presburger formulae defined over the binary reachability, allowing the automatic verification of many interesting properties of a MQDTA. The MQDTA model can be used to specify and verify various systems with unbounded queues, such as a real-time scheduler.