Efficient Verification of Timed Automata Using Dense and Discrete Time Semantics
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Toward an Approximation Theory for Computerised Control
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Extending Timed Automaton and Real-Time Logic to Many-Valued Reasoning
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Improvements in BDD-Based Reachability Analysis of Timed Automata
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Timed CSP = closed timed ε-automata
Nordic Journal of Computing
Tool Support for Verifying UML Activity Diagrams
IEEE Transactions on Software Engineering
Performance analysis of probabilistic timed automata using digital clocks
Formal Methods in System Design
Improvements for the Symbolic Verification of Timed Automata
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Event order abstraction for parametric real-time system verification
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Volume and Entropy of Regular Timed Languages: Discretization Approach
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Sampled universality of timed automata
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Universality and language inclusion for open and closed timed automata
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
A theory of sampling for continuous-time metric temporal logic
ACM Transactions on Computational Logic (TOCL)
Weak bisimulation for Probabilistic Timed Automata
Theoretical Computer Science
Timed automata can always be made implementable
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Thin and thick timed regular languages
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Approximation, sampling and voting in hybrid computing systems
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Integrating discrete- and continuous-time metric temporal logics through sampling
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
On sampled semantics of timed systems
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Incremental specification with SCTL/MUS-T: a case study
Journal of Systems and Software
Information and Computation
Model checking for probabilistic timed automata
Formal Methods in System Design
Hi-index | 0.00 |