Skip to main content
Conference ProceedingsOPEN ACCESS

Suspension automata: A decidable class of hybrid automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 818 LNCS 105-117
DOI: 10.1007/3-540-58179-0_47
36Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A hybrid automaton consists of a discrete state component represented by a finite automaton, coupled with a (vector) continuous state component governed by a differential equation. For hybrid automata it is possible to reduce certain verification problems to those of checking language containment or language emptiness. Here we present a class of hybrid automata called suspension automata for which conditions can be given under which these problems are decidable.

Cite

CITATION STYLE

APA

McManis, J., & Varaiya, P. (1994). Suspension automata: A decidable class of hybrid automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 818 LNCS, pp. 105–117). Springer Verlag. https://doi.org/10.1007/3-540-58179-0_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free