Werner Damm
ABSTRACT
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.
- M. Agrawal, P. S. Thiagarajan. The Discrete Time Behavior of Lazy Linear Hybrid Automata. Proc. HSCC 2005, LNCS 3414, 55--69, Springer 2005. Google Scholar
Digital Library
- R. Alur, T. A. Henzinger, P. H. Ho. Automatic symbolic verification of embedded systems. IEEE Trans. Software Eng. 22(3): 181--201, 1996. Google ScholarDigital Library
- T. Brihaye, Ch. Michaux. On the expressiveness and decidability of o-minimal hybrid systems. Journal of Complexity 21(4): 447--478, 2005. Google ScholarDigital Library
- W. Damm, G. Pinto, S. Ratschan. Guaranteed termination in the verification of LTL properties of non-linear robust discrete time hybrid systems. Int. J. Found. Comput. Sci. 18(1): 63--86, 2007.Google ScholarCross Ref
- W. Damm, H. Dierks, S. Disch, W. Hagemann, F. Pigorsch, C. Scholl, U. Waldmann, B. Wirtz. Exact and Fully Symbolic Verification of Linear Hybrid Automata with Large Discrete State Spaces. Science of Computer Programming. Special Issue on Automated Verification of Critical Systems, Editor M. Roggenbach, Accepted for publication, 2011. Google ScholarDigital Library
- A. Dolzmann and T. Sturm. Redlog: Computer algebra meets computer logic. ACM SIGSAM Bulletin 31(2):2--9, 1997. Google ScholarDigital Library
- G. E. Fainekos, G. J. Pappas. Robustness of temporal logic specifications. Proc. FATES/RV 2006, LNCS 4262, pp. 178--192, Springer, 2006. Google ScholarDigital Library
- G. Frehse, S. K. Jha, B. H. Krogh. A counterexample guided approach to parameter synthesis for linear hybrid automata. Proc. HSCC 2008, LNCS 4981, pp. 187--200, Springer, 2008. Google ScholarDigital Library
- G. Frehse. Tools for the verification of linear hybrid automata models, Handbook of Hybrid Systems Control, Theory - Tools - Applications. Cambridge University Press, Cambridge, 2009.Google Scholar
- S. Gulwani and A. Tiwari. Constraint-based approach for analysis of hybrid systems. In Proc. CAV 2008, LNCS 5123, pp. 190--203, Springer, 2008. Google ScholarDigital Library
- T. A. Henzinger, P. W. Kopke, A. Puri, P. Varaiya. What's decidable about hybrid automata? Journal of Computer and System Sciences 57(1): 94--124, 1998. Google ScholarDigital Library
- T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. Algorithmic Analysis of Nonlinear Hybrid Systems IEEE Trans. on Automatic Control 43:540--554, 1998.Google ScholarCross Ref
- C. Ihlemann and V. Sofronie-Stokkermans. System description: H-PILoT. In Proc. CADE 2009, LNAI 5663, pp. 131--139, Springer, 2009. Google ScholarDigital Library
- S. Jha, B. A. Brady, and S. A. Seshia Symbolic Reachability Analysis of Lazy Linear Hybrid Automata Proceedings of FORMATS 2007, 2007. Google ScholarDigital Library
- L. Khachian. A polynomial time algorithm for linear programming. Soviet Math. Dokl. 20:191--194, 1979.Google Scholar
- M. Koubarakis. Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning. Theor. Comput. Sci. 266: 311--339, 2001. Google ScholarDigital Library
- M. Koubarakis and S. Skiadopoulos. Querying temporal and spatial constraint networks in PTIME. Artificial Intelligence 123: 223--263, 2000. Google ScholarDigital Library
- G. Lafferriere, G. J. Pappas, S. Sastry. O-Minimal hybrid systems. Mathematics of Control, Signals, and Systems, 13(1):1--21, 2000.Google Scholar
- G. Lafferriere, G. J. Pappas, S. Yovine. A new class of decidable hybrid systems. Proc. HSCC 1999, LNCS 1569, pp.137--151, Springer, 1999. Google ScholarDigital Library
- J. S. Miller. Decidability and complexity results for timed automata and semi-linear hybrid automata. Proc. HSCC 2000, LNCS 1790, pp. 296--309, 2000. Google ScholarDigital Library
- L. M. de Moura and N. Bjørner. Z3: An Efficient SMT Solver. Proc. TACAS 2008, LNCS 4963, pp. 337--340, 2008. Google ScholarDigital Library
- B. Nebel and H.-J. Bürckert. Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra. Journal of the ACM 42(1): 43--66, 1995. Google ScholarDigital Library
- A. Platzer and J.-D. Quesel. Logical verification and systematic parametric analysis in train control. Proc. HSCC 2008, LNCS 4981, pp. 646--649, Springer, 2008. Google ScholarDigital Library
- A. Platzer and J.-D. Quesel. European train control system: A case study in formal verification. Proc. ICFEM 2009, LNCS 5885, pp. 246--265, Springer, 2009. Google ScholarDigital Library
- V. Sofronie-Stokkermans. Hierarchic reasoning in local theory extensions. Proc. CADE-20, LNAI 3632, pp. 219--234, Springer, 2005. Google ScholarDigital Library
- V. Sofronie-Stokkermans. Efficient hierarchical reasoning about functions over numerical domains. In Proc. KI 2008, LNAI 5243, pp.135--143, Springer, 2008. Google ScholarDigital Library
- V. Sofronie-Stokkermans. Hierarchical reasoning for the verification of parametric systems. Proc. IJCAR 2010, LNAI 6173, pp. 171--187, Springer, 2010. Google ScholarDigital Library
- E. D. Sontag. Real addition and the polynomial hierarchy. Inf. Proc. Letters 20(3):115--120, 1985.Google ScholarCross Ref
- M. Swaminathan, M. Fränzle. A symbolic decision procedure for robust safety of timed systems. Proc. TIME 2007, p. 192, IEEE Computer Society, 2007. Google ScholarDigital Library
- G. J. Tee. Khachian's efficient algorithm for linear inequalities and linear programming. ACM SIGNUM Newsletter Archive 15(1):13--15, 1980. Google ScholarDigital Library
- F. Wang. Symbolic Parametric Safety Analysis of Linear Hybrid Systems with BDD-Like Data-Structures. IEEE Trans. Software Eng. 31(1): 38--51, 2005. Google ScholarDigital Library
Index Terms
- Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata
Recommendations
Interrupt Timed Automata: verification and expressiveness
We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.
While the reachability problem is undecidable for ...
Reusing of Properties after Discretization of Hybrid Automata
MTV '11: Proceedings of the 2011 12th International Workshop on Microprocessor Test and VerificationIn the recent years, the use of hybrid automata has achieved a great success in the early design and verification of embedded systems. Once the hybrid model defined by means of hybrid automata has been verified, it would be valuable to reuse it to ...
Descriptional complexity of cellular automata and decidability questions
Third international workshop on descriptional complexity of automata, grammars and related structuresWe study the descriptional complexity of cellular automata (CA) which are a parallel model of computation. We show that between one of the simplest cellular models, the realtime one-way CA (realtime-OCA), and "classical" models like deterministic finite ...
Comments