Publication:4953401
From MaRDI portal
zbMath0992.93050MaRDI QIDQ4953401
Publication date: 8 September 2002
undecidability; reachability; hybrid automata; complexity results; parametric timed automata; algebraic timed automata; parallel compositions
68Q25: Analysis of algorithms and problem complexity
93C65: Discrete event control/observation systems
93B03: Attainable sets, reachability
Related Items
LTL Parameter Synthesis of Parametric Timed Automata, What’s Decidable About Parametric Timed Automata?, Unnamed Item, Approximated Reachability on Hybrid Automata: Falsification meets Certification, Unnamed Item, Formal language properties of hybrid systems with strong resets, A survey of timed automata for the development of real-time systems, On parametric timed automata and one-counter machines, Robust parametric reachability for timed automata, Temporal logics with incommensurable distances are undecidable, On clock-aware LTL parameter synthesis of timed automata, PTIME parametric verification of safety properties for reasonable linear hybrid automata, Consistency in parametric interval probabilistic timed automata, Model measuring for discrete and hybrid systems, On the expressiveness and decidability of o-minimal hybrid systems, Polynomial interrupt timed automata: verification and expressiveness, Classes of Timed Automata and the Undecidability of Universality, Language Preservation Problems in Parametric Timed Automata, Deciding Concurrent Planar Monotonic Linear Hybrid Systems, Model Checking Real-Time Systems, Verification of Hybrid Systems, Decidable Compositions of O-Minimal Automata, Property Driven Three-Valued Model Checking on Hybrid Automata
