Parametric real-time reasoning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Theoretical Computer Science
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Computing strongly connected components in a linear number of symbolic steps
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Dynamical Properties of Timed Automata
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Kronos: A Model-Checking Tool for Real-Time Systems
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Lectures on Embedded Systems, European Educational Forum, School on Embedded Systems
Nordic Journal of Computing
Almost ASAP semantics: from timed models to timed implementations
Formal Aspects of Computing
Diagonal constraints in timed automata: forward analysis of timed systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Implementation of timed automata: an issue of semantics or modeling?
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Model checking timed automata with priorities using DBM subtraction
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Symbolic robustness analysis of timed automata
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Systematic implementation of real-time models
FM'05 Proceedings of the 2005 international conference on Formal Methods
Robust safety of timed automata
Formal Methods in System Design
Robust analysis of timed automata via channel machines
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Model-based implementation of real-time applications
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
Quantitative robustness analysis of flat timed automata
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Untimed language preservation in timed systems
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Information and Computation
| Hi-index | 0.00 |
We give a generalization of a solution by Puri to the problem of checking emptiness in timed automata with drifting clocks for the case of automata with non-closed guards. We show that nonclosed guards pose certain specific problems which cannot be handled by Puri's algorithm, and propose a new algorithm, based on the idea of "boundary clock regions" of Alur, LaTorre and Pappas. We then give a symbolic algorithm for solving the reachability problem. Our algorithm is based on a symbolic construction of the "neighborhood" of a zone, and on a procedure that, given a set of zones Z, builds the forward propagation of the strongly connected components which can be reached from Z. This improves a symbolic algorithm of Daws and Kordy, due to the ability to handle sets of zones.