Decidable Classes of the Verification Problem in a Timed Predicate Logic

Authors:
Danièle Beauquier;Anatol Slissenko
Affiliations:
-;-
Venue:
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Year:
1999

Citing 8
Cited 1

Temporal and modal logic

Handbook of theoretical computer science (vol. B)
A theory of timed automata

Theoretical Computer Science
Evolving algebras 1993: Lipari guide

Specification and validation methods
Mixed real-integer linear quantifier elimination

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Time and Probability in Formal Design of Distributed Systems

Time and Probability in Formal Design of Distributed Systems
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages

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
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems

Hybrid Systems

A Logic Framework for Verification of Timed Algorithms

Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a first order timed logic that is an extension of the theory of real addition and scalar multiplications (by rational numbers) by unary functions and predicates of time. The time is treated as non negative reals. This logic seems to be well adapted to a direct, fullscale specification of real-time systems. It also suffices to describe runs of timed algorithms that have as inputs functions of time. Thus it permits to embed the verification of timed systems in one easily understandable framework. But this logic is incomplete, and hence undecidable. To develop an algorithmic support for the verification problem one theoretical direction of research is to look for reasonable decidable classes of the verification problem. In this paper we describe such classes modeling typical properties of practical systems such as dependence of behavior only on a small piece of history and periodicity.