Complexity of deciding Tarski algebra
Journal of Symbolic Computation
Software engineering (4th ed.)
Software engineering (4th ed.)
Theoretical Computer Science
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Automated temporal reasoning about reactive systems
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
It's About Time: Real-Time Logics Reviewed
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Pumping Lemmas for Timed Automata
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Parametric Quantitative Temporal Reasoning
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A Logic Framework for Verification of Timed Algorithms
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Decidable fragments of many-sorted logic
Journal of Symbolic Computation
Decidable fragments of many-sorted logic
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Verification in predicate logic with time: algorithmic questions
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
A Logic Framework for Verification of Timed Algorithms
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
| Hi-index | 5.23 |
We consider one type of first order timed logic (FOTL) with explicit continuous time. FOTL is sufficiently expressible from the user's point of view to rewrite directly requirements specifications often given in a language close to the natural one, and it permits to represent the set of runs of timed programs. Thus, FOTL is apt to formalize the verification problem for timed systems. Our main goal is to describe in semantical terms interesting decidable classes of the verification problem within this setting. We prove that under some finiteness properties of the requirements and algorithm specifications the verification problem represented in FOTL becomes decidable. The finiteness properties we introduce, "finite refutability" and "finite satisfiability", are undecidable in the general case. However, "finite refutability" is often easy to verify. On the other hand, we give a sufficient condition, namely reducibility, which ensures the "finite satisfiability" for timed automata, and we prove that the reducibility is decidable. This is the main result of the paper. As a consequence the verification of any finitely refutable requirements is decidable for reducible timed automata.