Temporal logic for real time systems
Temporal logic for real time systems
Specifying real-time properties with metric temporal logic
Real-Time Systems
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The temporal specification and verification of real-time systems
The temporal specification and verification of real-time systems
Journal of the ACM (JACM)
Real-time logics: complexity and expressiveness
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Timed automata and recognizability
Information Processing Letters
Event-clock automata: a determinizable class of timed automata
Theoretical Computer Science
Journal of the ACM (JACM)
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Journal of the ACM (JACM)
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
The Regular Real-Time Languages
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Digitisation and Full Abstraction for Dense-Time Model Checking
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Verifying Abstractions of Timed Systems
CONCUR '96 Proceedings of the 7th 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
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
State Clock Logic: A Decidable Real-Time Logic
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Alternating Automata and Logics over Infinite Words
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Origins and Metamorphoses of The Trinity: Logic, Nets, Automata
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Revisiting Digitization, Robustness, and Decidability for Timed Automata
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Timed I/O Automata: A Mathematical Framework for Modeling and Analyzing Real-Time Systems
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Using mappings to prove timing properties
Distributed Computing
On the Decidability of Metric Temporal Logic
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Safe On-The-Fly Steady-State Detection for Time-Bounded Reachability
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Logics for Real Time: Decidability and Complexity
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
ACM Transactions on Computational Logic (TOCL)
On Expressiveness and Complexity in Real-Time Model Checking
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Universality and language inclusion for open and closed timed automata
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Alternating Timed Automata over Bounded Time
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Decision problems for the verification of real-time software
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
On the expressiveness of TPTL and MTL
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Safety metric temporal logic is fully decidable
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On reachability for hybrid automata over bounded time
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Time-bounded verification of CTMCs against real-time specifications
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Reachability problems for hybrid automata
RP'11 Proceedings of the 5th international conference on Reachability problems
Lower-bound-constrained runs in weighted timed automata
Performance Evaluation
| Hi-index | 0.00 |
We propose a theory of time-bounded verification for realtime systems, in which verification queries are phrased over time intervals of fixed, bounded duration. We argue that this theory is both pertinent, in that it is fully adequate to handle a large proportion of 'real-world' real-time systems and specifications; and effective, in that the restriction to bounded time domains reclaims as decidable several of the key decision problems of unbounded real-time verification. Finally, we discuss several directions of ongoing and future work.