scientific article; zbMATH DE number 1444359

zbMath0992.93050MaRDI QIDQ4953401

Joseph S. Miller

Publication date: 8 September 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

undecidabilityreachabilityhybrid automatacomplexity resultsparametric timed automataalgebraic timed automataparallel compositions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete event control/observation systems (93C65) Attainable sets, reachability (93B03)

Related Items (28)

Model measuring for discrete and hybrid systems ⋮ Model Checking Real-Time Systems ⋮ Verification of Hybrid Systems ⋮ Robust parametric reachability for timed automata ⋮ Unnamed Item ⋮ On clock-aware LTL parameter synthesis of timed automata ⋮ On the expressiveness and decidability of o-minimal hybrid systems ⋮ LTL Parameter Synthesis of Parametric Timed Automata ⋮ Polynomial interrupt timed automata: verification and expressiveness ⋮ Temporal logics with incommensurable distances are undecidable ⋮ Language Preservation Problems in Parametric Timed Automata ⋮ Deciding Concurrent Planar Monotonic Linear Hybrid Systems ⋮ A survey of timed automata for the development of real-time systems ⋮ Unnamed Item ⋮ Equivalence checking and intersection of deterministic timed finite state machines ⋮ Distributed parametric model checking timed automata under non-zenoness assumption ⋮ PTIME parametric verification of safety properties for reasonable linear hybrid automata ⋮ Decidable Compositions of O-Minimal Automata ⋮ On parametric timed automata and one-counter machines ⋮ Formal language properties of hybrid systems with strong resets ⋮ Unnamed Item ⋮ What’s Decidable About Parametric Timed Automata? ⋮ Consistency in parametric interval probabilistic timed automata ⋮ Property Driven Three-Valued Model Checking on Hybrid Automata ⋮ Revisiting reachability in polynomial interrupt timed automata ⋮ Approximated Reachability on Hybrid Automata: Falsification meets Certification ⋮ Classes of Timed Automata and the Undecidability of Universality ⋮ Parametric Schedulability Analysis of a Launcher Flight Control System under Reactivity Constraints*

This page was built for publication: