Uniform Reachability Algorithms

Authors:
Gerardo Lafferriere;Chris Miller
Affiliations:
-;-
Venue:
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Year:
2000

Citing 3
Cited 0

A theory of timed automata

Theoretical Computer Science
o-Minimal structures

Logic: from foundations to applications
A New Class of Decidable Hybrid Systems

HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control

Quantified Score

Hi-index	0.01

Visualization

Abstract

We introduce the notion of a parametrized family (H)p)p∈P of hybrid systems, and consider questions of reachability in the systems Hp as the parameter p ranges over P. Under the assumption of a uniform (as p ranges over P) finite bound on the number of discrete transitions associated to the individual systems Hp, the notion of reachability is first-order (in the sense of mathematical logic) and uniform in the parameter p. Techniques from logic can then be used to analyze computational questions associated to the family of systems.