Transitive Closures of Regular Relations for Verifying Infinite-State Systems
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Scenario-Matching Approach to the Description and Model Checking of Real-Time Properties
IEEE Transactions on Software Engineering
Timed verification of the reliable adaptive multicast protocol
Journal of Systems and Software
A polynomial dynamic system approach to software design for attractivity requirement
Information Sciences: an International Journal
Simulation-based verification using Temporally Attributed Boolean Logic
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Model-checking Timed Temporal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Reasoning about action in polynomial time
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Expressive reasoning about action in nondeterministic polynomial time
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Model checking memoryful linear-time logics over one-counter automata
Theoretical Computer Science
Model checking freeze LTL over one-counter automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
A Metric for Quantifying Similarity between Timing Constraint Sets in Real-Time Systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
The complexity of reversal-bounded model-checking
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Interoperability of constrained finite state automata
ACM SIGSOFT Software Engineering Notes
Symbolic model checking of finite precision timed automata
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Symbolic bounded conformance checking of model programs
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Time constraints with temporal logic programming
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
An algebraic structure for duration automata
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
| Hi-index | 0.00 |
A real-time temporal logic for the specification of reactive systems is introduced. The novel feature of the logic, TPTL, is the adoption of temporal operators as quantifiers over time variables; every modality binds a variable to the time(s) it refers to. TPTL is demonstrated to be both a natural specification language and a suitable formalism for verification and synthesis. A tableau-based decision procedure and model-checking algorithm for TPTL are presented. Several generalizations of TPTL are shown to be highly undecidable.