Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Minimum and maximum delay problems in real-time systems
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Timed Automata and the Theory of Real Numbers
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Toward an Approximation Theory for Computerised Control
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Dynamical Properties of Timed Automata
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Robust Undecidability of Timed and Hybrid Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Decidability of Bisimulation Equivalences for Parallel Timer Processes
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Real-time Property Preservation in Approximations of Timed Systems
MEMOCODE '03 Proceedings of the First ACM and IEEE International Conference on Formal Methods and Models for Co-Design
Compositional and hierarchical techniques for the formal verification of real-time systems
Compositional and hierarchical techniques for the formal verification of real-time systems
Approximate Reasoning for Real-Time Probabilistic Processes
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Predictable real-time software synthesis
Real-Time Systems
Discount-Optimal Infinite Runs in Priced Timed Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Robustness of temporal logic specifications for continuous-time signals
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Unifying behavioral equivalences of timed transition systems
Programming and Computing Software
Timed automata can always be made implementable
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Crossing the bridge between similar games
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Temporal logic verification using simulation
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
A categorical view of timed weak bisimulation
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Branching-time property preservation between real-time systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Robustness of temporal logic specifications
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
A formal framework to test soft and hard deadlines in timed systems
Software Testing, Verification & Reliability
Quantitative timed simulation functions and refinement metrics for real-time systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Maintaining real-time application timing similarity for defect-tolerant NoC-based many-core systems
ACM Transactions on Embedded Computing Systems (TECS) - Special Section ESFH'12, ESTIMedia'11 and Regular Papers
Quantitative reactive modeling and verification
Computer Science - Research and Development
| Hi-index | 0.01 |
We define quantitative similarity functions between timed transition systems that measure the degree of closeness of two systems as a real, in contrast to the traditional boolean yes/no approach to timed simulation and language inclusion. Two systems are close if for each timed trace of one system, there exists a corresponding timed trace in the other system with the same sequence of events and closely corresponding event timings. We show that timed CTL is robust with respect to our quantitative version of bisimilarity, in particular, if a system satisfies a formula, then every close system satisfies a close formula. We also define a discounted version of CTL over timed systems, which assigns to every CTL formula a real value that is obtained by discounting real time. We prove the robustness of discounted CTL by establishing that close states in the bisimilarity metric have close values for all discounted CTL formulas.