Reduction of timed hybrid systems (Q1273542)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reduction of timed hybrid systems |
scientific article; zbMATH DE number 1230699
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reduction of timed hybrid systems |
scientific article; zbMATH DE number 1230699 |
Statements
Reduction of timed hybrid systems (English)
0 references
14 July 1999
0 references
The authors consider a class of hybrid dynamic systems, especially a class of timed automata. They obtain conditions under which the behaviour of these systems can be reduced to a finite state automaton. Namely, a necessary condition on the partitions for the existence of a finer congruence leading to a finite state reduction and two sufficient conditions showing that a fairly broad class of timed automata admit a finite reduction.
0 references
hybrid dynamic systems
0 references
timed automata
0 references
finite state automaton
0 references
finite reduction
0 references
0.7825928926467896
0 references
0.7633413672447205
0 references
