Abstract
We introduce the notion of a parametrized family (H p ) p∈P of hybrid systems, and consider questions of reachability in the systems H p 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.
Research supported by NSF grant DMS-9896225
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Alur and D. Dill, A theory of timed automata, Theoret. Comput. Sci. 126 (1994), 183–235.
A. Gabrielov, Projections of semi-analytic sets, Funct. Anal. Appl. 2 (1968), 282–291.
A. Kechris, Classical Descriptive Set Theory, Springer-Verlag, 1995.
G. Lafferriere, G. Pappas, and S. Sastry, O-minimal hybrid systems, Math. Control Signals Systems, to appear.
G. Lafferriere, G. Pappas, and S. Yovine, A new class of decidable hybrid systems, Hybrid Systems: Computation and Control (F. Vaandrager and J. van Schuppen, eds.), Lecture Notes in Comput. Sci., vol. 1569, Springer-Verlag, Berlin, 1999, pp. 137–151.
C. Miller, Expansions of the real field with power functions, Ann. Pure Appl. Logic 68 (1994), 79–94.
C. Miller, Exponentiation is hard to avoid, Proc. Amer. Math. Soc. 122 (1994), 257–259.
C. Miller and P. Speissegger, Expansions of the real line by open sets: o-minimality and open cores, Fund. Math. 162 (1999), 193–208.
C. Miller and S. Starchenko, A growth dichotomy for o-minimal expansions of ordered groups, Trans. Amer. Math. Soc. 350 (1998), 3505–3521.
Y. Peterzil, P. Speissegger, and S. Starchenko, Adding multiplication to an o-minimal expansion of the additive group of real numbers, Logic Colloquium’ 98, to appear.
P. Speissegger, The Pfaffian closure of an o-minimal structure, J. Reine Angew. Math. 508 (1999), 189–211.
H. Sussmann, Subanalytic sets and feedback control, J. Differential Equations 31 (1979), 31–52.
A. Tarski, A decision method for elementary algebra and geometry, second ed., University of California Press, 1951.
L. van den Dries, A generalization of the Tarski-Seidenberg theorem, and some nonde_nability results, Bull. Amer. Math. Soc. (N.S) 15 (1986), 189–193.
L. van den Dries, o-Minimal structures, Logic: From Foundations to Applications, Oxford Sci. Publ., Oxford University Press, New York, 1996, pp. 137–185.
L. van den Dries, Tame Topology and O-minimal Structures, London Math. Soc. Lecture Note Ser., vol. 248, Cambridge University Press, 1998.
L. van den Dries and C. Miller, Geometric categories and o-minimal structures, Duke Math. J. 84 (1996), 497–540.
A. Wilkie, Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function, J. Amer. Math. Soc. 9 (1996), 1051–1094.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lafferriere, G., Miller, C. (2000). Uniform Reachability Algorithms. In: Lynch, N., Krogh, B.H. (eds) Hybrid Systems: Computation and Control. HSCC 2000. Lecture Notes in Computer Science, vol 1790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46430-1_20
Download citation
DOI: https://doi.org/10.1007/3-540-46430-1_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67259-3
Online ISBN: 978-3-540-46430-3
eBook Packages: Springer Book Archive