Verification in predicate logic with time: algorithmic questions

Authors:
Anatol Slissenko
Affiliations:
Laboratory for Algorithmics, Complexity and Logic, University Paris-1, France
Venue:
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Year:
2005

Citing 10
Cited 0

Presburger arithmetic with unary predicates is P11 complete

Journal of Symbolic Logic
Reasoning about knowledge and probability

Journal of the ACM (JACM)
A theory of timed automata

Theoretical Computer Science
Introduction to distributed algorithms

Introduction to distributed algorithms
Mixed real-integer linear quantifier elimination

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Decidable verification for reducible timed automata specified in a first order logic with time

Theoretical Computer Science
Representing Arithmetic Constraints with Finite Automata: An Overview

ICLP '02 Proceedings of the 18th International Conference on Logic Programming
The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions

CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
A Logic of Probability with Decidable Model Checking* Partially supported by French-Israeli Arc-en-ciel/Keshet project No. 30 and No. 15.

Journal of Logic and Computation
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 discuss the verification of timed systems within predicate logics with explicit time and arithmetical operations. The main problem is to find efficient algorithms to treat practical problems. One way is to find practically decidable classes that englobe this or that class of practical problems. This is our main goal, where we concentrate on one approach that permits to arrive at a kind of small model property. We will also touch the question of extension of these results to probabilistic systems that will be presented in more detail elsewhere.