Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
REDLOG: computer algebra meets computer logic
ACM SIGSAM Bulletin
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Querying temporal and spatial constraint networks in PTIME
Artificial Intelligence
Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning
Theoretical Computer Science
Automatic Symbolic Verification of Embedded Systems
IEEE Transactions on Software Engineering
A New Class of Decidable Hybrid Systems
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Symbolic Parametric Safety Analysis of Linear Hybrid Systems with BDD-Like Data-Structures
IEEE Transactions on Software Engineering
A Symbolic Decision Procedure for Robust Safety of Timed Systems
TIME '07 Proceedings of the 14th International Symposium on Temporal Representation and Reasoning
A Counterexample-Guided Approach to Parameter Synthesis for Linear Hybrid Automata
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Logical Verification and Systematic Parametric Analysis in Train Control
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Constraint-Based Approach for Analysis of Hybrid Systems
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Efficient Hierarchical Reasoning about Functions over Numerical Domains
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
European Train Control System: A Case Study in Formal Verification
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
On the expressiveness and decidability of o-minimal hybrid systems
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Symbolic reachability analysis of lazy linear hybrid automata
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Hierarchic reasoning in local theory extensions
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
The discrete time behavior of lazy linear hybrid automata
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Robustness of temporal logic specifications
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
Hierarchical reasoning for the verification of parametric systems
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces
Science of Computer Programming
Hierarchical reasoning and model generation for the verification of parametric hybrid systems
CADE'13 Proceedings of the 24th international conference on Automated Deduction
| Hi-index | 0.00 |
This paper identifies an industrially relevant class of linear hybrid automata (LHA) called reasonable LHA for which parametric verification of safety properties with exhaustive entry conditions can be done in polynomial time and time-bounded reachability with exhaustive entry conditions can be decided in nondeterministic polynomial time for non-parametric verification and in exponential time for parametric verification. Deciding whether an LHA is reasonable is shown to be decidable in polynomial time.