Verifying linear duration constraints of timed automata
From MaRDI portal
Recommendations
- Checking timed automata for linear duration properties
- Checking temporal duration properties of timed automata.
- Verification of Linear Duration Invariants by Model Checking CTL Properties
- Verification of timed automata via satisfiability checking
- Model checking linear duration invariants of networks of automata
Cited in
(14)- Verification of duration systems using an approximation approach
- Checking temporal duration properties of timed automata.
- Checking timed automata for linear duration properties
- Decidable verification for reducible timed automata specified in a first order logic with time
- A practical approach to model checking duration calculus using Presburger arithmetic
- A survey on temporal logics for specifying and verifying real-time systems
- LTL over integer periodicity constraints
- On verification of linear occurrence properties of real-time systems
- Model checking linear duration invariants of networks of automata
- Checking integral real-time automata for extended linear duration invariants
- Robust Model-Checking of Linear-Time Properties in Timed Automata
- Efficient verification of a class of linear hybrid automata using linear programming
- Verification of Linear Duration Invariants by Model Checking CTL Properties
- Checking linear duration invariants by linear programming
This page was built for publication: Verifying linear duration constraints of timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5709982)