Local verification of reactive software systems
Local verification of reactive software systems
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
Real-time logics: complexity and expressiveness
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
Comparing different approaches for specifying and verifying real-time systems
RTOSS '93 Proceedings of the tenth IEEE workshop on Real-time operating systems and software
An operational semantics for timed CSP
Information and Computation
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
UPPAAL—a tool suite for automatic verification of real-time systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Timewise refinement for communicating processes
Science of Computer Programming
The timed failures-stability model for CSP
Theoretical Computer Science
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Model Checking TLA+ Specifications
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Compositional Model Checking of Real Time Systems
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Local Model Checking for Real-Time Systems (Extended Abstract)
Proceedings of the 7th International Conference on Computer Aided Verification
HYTECH: A Model Checker for Hybrid Systems
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
A uniform mathematical theory for real-time distributed computing
A uniform mathematical theory for real-time distributed computing
Correctness and communication in real-time systems (tcsp)
Correctness and communication in real-time systems (tcsp)
Toward an Approximation Theory for Computerised Control
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Timed CSP = closed timed ε-automata
Nordic Journal of Computing
Performance analysis of probabilistic timed automata using digital clocks
Formal Methods in System Design
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
On Timed Models and Full Abstraction
Electronic Notes in Theoretical Computer Science (ENTCS)
Undecidability of universality for timed automata with minimal resources
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
A theory of sampling for continuous-time metric temporal logic
ACM Transactions on Computational Logic (TOCL)
Towards a theory of time-bounded verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Expert Systems with Applications: An International Journal
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
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Hi-index | 0.00 |
We study the digitisation of dense-time behaviours of timed processes, and show how this leads to exact verification methods for a large class of dense-time specifications. These specifications are all closed under inverse digitisation, a robustness property first introduced by Henzinger, Manna, and Pnueli (on timed traces), and extended here to timed failures, enabling us to consider liveness issues in addition to safety properties. We discuss a corresponding model checking algorithm and show that, in many cases, automated verification of such dense-time specifications can in fact be directly performed on the model checker FDR (a commercial product of Formal Systems (Europe) Ltd.). We illustrate this with a small case study (the railway level crossing problem). Finally, we show that integral--or digitised--behaviours are fully abstract with respect to specifications closed under inverse digitisation, and relate this to the efficiency of our model checking algorithm.