Reduction of timed hybrid systems

DOI10.1023/A:1008385431572MaRDI QIDQ1273542zbMATH OpenOpenAlexFDO

Authors K. Appert

Publication date 14 July 1999

Published in Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008385431572

zbMATH Keywords

finite reductionfinite state automatonhybrid dynamic systemstimed automata

Mathematics Subject Classification ID

System structure simplification (93B11) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Review text

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.

Recommendations

• Hybrid automata with finite bisimulations
• scientific article; zbMATH DE number 1507210
• A theory of timed automata
• Reducing clocks in timed automata while preserving bisimulation
• Hybrid automata and bisimulations

Cited in

(3)

• Consistent reduction in discrete-event systems
• scientific article; zbMATH DE number 4050939 (Why is no real title available?)
• An Algebraic Approach to Time-Span Reduction

This page was built for publication: Reduction of timed hybrid systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273542)