Parametric real-time reasoning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
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
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
New Decidability Results Concerning Two-Way Counter Machines
SIAM Journal on Computing
Specification of realtime systems using ASTRAL
IEEE Transactions on Software Engineering
Using the ASTRAL model checker to analyze mobile IP
Proceedings of the 21st international conference on Software engineering
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
Proceedings of the 22nd international conference on Software engineering
The design and analysis of real-time systems using the ASTRAL software development environment
Annals of Software Engineering
A Formal Framework for ASTRAL Intralevel Proof Obligations
IEEE Transactions on Software Engineering
From Timed Automata to Logic - and Back
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Conter Machines: Decidable Properties and Applications to Verification Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On Presburger Liveness of Discrete Timed Automata
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Timed Automata and the Theory of Real Numbers
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
HYTECH: The Cornell HYbrid TECHnology Tool
Hybrid Systems II
State Clock Logic: A Decidable Real-Time Logic
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Binary Reachability Analysis of Discrete Pushdown Timed Automata
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Tools and techniques for the design and systematic analysis of real-time systems
Tools and techniques for the design and systematic analysis of real-time systems
On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
| Hi-index | 0.00 |
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look at three approximation techniques (i.e., the r-reset-bounded approximation, the B-bounded approximation, and the 〈B, r〉-crossing-bounded approximation), and derive automata-theoretic characterizations of the binary reachability under these approximations. The characterizations allow us to show that the safety analysis problem is decidable for generalized discrete timed automata with unit durations and for deterministic generalized discrete timed automata with parameterized durations. An example specification written in ASTRAL is used to run a number of experiments using one of the approximation techniques.