scientific article; zbMATH DE number 1444359
From MaRDI portal
Publication:4953401
Recommendations
Cited in
(45)- What's decidable about hybrid automata?
- An undecidable problem for timed automata
- On clock-aware LTL parameter synthesis of timed automata
- PTIME parametric verification of safety properties for reasonable linear hybrid automata
- Revisiting reachability in polynomial interrupt timed 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
- Task automata: Schedulability, decidability and undecidability
- Polynomial interrupt timed automata: verification and expressiveness
- Automata for a decidable subset of duration calculus.
- Classes of timed automata and the undecidability of universality
- Decidability of a hybrid duration calculus
- Language preservation problems in parametric timed automata
- Deciding concurrent planar monotonic linear hybrid systems
- Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata
- Model Checking Real-Time Systems
- Verification of Hybrid Systems
- Hypervolume Approximation in Timed Automata Model Checking
- Decidable Compositions of O-Minimal Automata
- Composing Semi-algebraic O-Minimal Automata
- Property Driven Three-Valued Model Checking on Hybrid Automata
- A survey of timed automata for the development of real-time systems
- LTL parameter synthesis of parametric timed automata
- What's decidable about parametric timed automata?
- The Discrete Time Behaviour of Restricted Linear Hybrid Automata
- Approximated reachability on hybrid automata: falsification meets certification
- Parametric updates in parametric timed automata
- Parametric schedulability analysis of a launcher flight control system under reactivity constraints
- Reachability and liveness in parametric timed automata
- On parametric timed automata and one-counter machines
- Time-bounded reachability for monotonic hybrid automata: complexity and fixed points
- Reachability in timed counter systems
- Formal language properties of hybrid systems with strong resets
- Language preservation problems in parametric timed automata
- Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
- Time-Bounded Reachability for Initialized Hybrid Automata with Linear Differential Inclusions and Rectangular Constraints
- Equivalence checking and intersection of deterministic timed finite state machines
- Distributed parametric model checking timed automata under non-zenoness assumption
- Decidability of the initial-state opacity of real-time automata
- Reachability results for timed automata with unbounded data structures
- Dense integer-complete synthesis for bounded parametric timed automata
- Execution-time opacity problems in one-clock parametric timed automata
- Robust parametric reachability for timed automata
- Temporal logics with incommensurable distances are undecidable
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953401)
