Article

Verifying LTL Properties of Hybrid Systems with K-Liveness

Authors:

Alessandro Cimatti,

Alberto Griggio,

Stefano TonettaAuthors Info & Claims

Proceedings of the 16th International Conference on Computer Aided Verification - Volume 8559

Pages 424 - 440

https://doi.org/10.1007/978-3-319-08867-9_28

Published: 18 July 2014 Publication History

Abstract

The verification of liveness properties is an important challenge in the design of real-time and hybrid systems.

In contrast to the verification of safety properties, for which there are several solutions available, there are really few tools that support liveness properties such as general LTL formulas for hybrid systems, even in the case of timed automata.

In the context of finite-state model checking, K-Liveness is a recently proposed algorithm that tackles the problem by proving that an accepting condition can be visited at most K times. K-Liveness has shown to be very efficient, thanks also to its tight integration with IC3, a very efficient technique for safety verification. Unfortunately, the approach is neither complete nor effective (even for simple properties) in the case of infinite-state systems with continuous time.

In this paper, we extend K-Liveness to deal with LTL for hybrid systems. On the theoretical side, we show how to extend the reduction from LTL to the reachability of an accepting condition in order to make the algorithm work with continuous time. In particular, we prove that the new reduction is complete for a class of rectangular hybrid automata, in the sense that the LTL property holds if and only if there exists K such that the accepting condition is visited at most K times. On the practical side, we present an efficient integration of K-Liveness in an SMT-version of IC3, and demonstrate its effectiveness on several benchmarks.

References

[1]

HyComp: https://es.fbk.eu/tools/hycomp/

[2]

Henzinger, T., Kopke, P., Puri, A., Varaiya, P.: What's decidable about hybrid automata? In: STOC, pp. 373—382 (1995)

Digital Library

[3]

Alur, R., Courcoubetis, C., Henzinger, T.A., Ho, P.H.: Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol.ä736, pp. 209—229. Springer, Heidelberg (1993)

Digital Library

[4]

Pnueli, A.: The Temporal Logic of Programs. In: FOCS, pp. 46—57 (1977)

Digital Library

[5]

Vardi, M.: An Automata-Theoretic Approach to Linear Temporal Logic. In: Banff Higher Order Workshop, pp. 238—266 (1995)

Digital Library

[6]

Audemard, G., Bozzano, M., Cimatti, A., Sebastiani, R.: Verifying industrial hybrid systems with mathsat. Electr. Notes Theor. Comput. Sci.ä119(2), 17—32 (2005)

Digital Library

[7]

Cimatti, A., Mover, S., Tonetta, S.: Quantifier-free encoding of invariants for hybrid systems. Formal Methods in System Design, 1—24 (2013)

Digital Library

[8]

Bradley, A.R.: SAT-Based Model Checking without Unrolling. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol.ä6538, pp. 70—87. Springer, Heidelberg (2011)

Digital Library

[9]

Cimatti, A., Griggio, A., Mover, S., Tonetta, S.: IC3 Modulo Theories via Implicit Predicate Abstraction. In: Ábrahám, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol.ä8413, pp. 46—61. Springer, Heidelberg (2014)

[10]

Graf, S., Saïdi, H.: Construction of Abstract State Graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.ä1254, pp. 72—83. Springer, Heidelberg (1997)

Digital Library

[11]

Tonetta, S.: Abstract Model Checking without Computing the Abstraction. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.ä5850, pp. 89—105. Springer, Heidelberg (2009)

Digital Library

[12]

Claessen, K., Sörensson, N.: A liveness checking algorithm that counts. In: Cabodi, G., Singh, S. (eds.) FMCAD, pp. 52—59. IEEE (2012)

[13]

Schuppan, V., Biere, A.: Efficient reduction of finite state model checking to reachability analysis. STTTä5(2-3), 185—204 (2004)

Digital Library

[14]

Henzinger, T.A., Ho, P., Wong-Toi, H.: HYTECH: A Model Checker for Hybrid Systems. STTTä1(1-2), 110—122 (1997)

[15]

Frehse, G., Le Guernic, C., Donzé, A., Cotton, S., Ray, R., Lebeltel, O., Ripado, R., Girard, A., Dang, T., Maler, O.: SpaceEx: Scalable Verification of Hybrid Systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol.ä6806, pp. 379—395. Springer, Heidelberg (2011)

Digital Library

[16]

Platzer, A.: Differential Dynamic Logic for Hybrid Systems. J. Autom. Reasoningä41(2), 143—189 (2008)

Digital Library

[17]

Alur, R., Dang, T., Ivancic, F.: Predicate abstraction for reachability analysis of hybrid systems. ACM Trans. Embedded Comput. Syst.ä5(1), 152—199 (2006)

Digital Library

[18]

Clarke, E.M., Fehnker, A., Han, Z., Krogh, B.H., Ouaknine, J., Stursberg, O., Theobald, M.: Abstraction and counterexample-guided refinement in model checking of hybrid systems. Int. J. Found. Comput. Sci.ä14(4), 583—604 (2003)

[19]

Prabhakar, P., Duggirala, P.S., Mitra, S., Viswanathan, M.: Hybrid automata-based cegar for rectangular hybrid systems. In: Giacobazzi, R., Berdine, J., Mastroeni, I. (eds.) VMCAI 2013. LNCS, vol.ä7737, pp. 48—67. Springer, Heidelberg (2013)

[20]

Alur, R.: Formal verification of hybrid systems. In: EMSOFT, pp. 273—278 (2011)

Digital Library

[21]

Tripakis, S., Yovine, S., Bouajjani, A.: Checking timed büchi automata emptiness efficiently. Formal Methods in System Designä26(3), 267—292 (2005)

Digital Library

[22]

Tripakis, S.: Verifying Progress in Timed Systems. In: Katoen, J.-P. (ed.) ARTS 1999. LNCS, vol.ä1601, pp. 299—314. Springer, Heidelberg (1999)

Digital Library

[23]

David, A., Larsen, K.: More features in UPPAAL

[24]

Barnat, J., et al.: DiVinE 3.0 - An Explicit-State Model Checker for Multithreaded C & C++ Programs. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol.ää8044, pp. 863—868. Springer, Heidelberg (2013)

[25]

Schuppan, V., Biere, A.: Liveness Checking as Safety Checking for Infinite State Spaces. Electr. Notes Theor. Comput. Sci.ä149(1), 79—96 (2006)

Digital Library

[26]

Bresolin, D.: HyLTL: A temporal logic for model checking hybrid systems. In: HAS, pp. 73—84 (2013)

[27]

Larsen, K.G., Pettersson, P., Yi, W.: Uppaal in a nutshell. STTTä1(1-2), 134—152 (1997)

[28]

Laarman, A., Olesen, M.C., Dalsgaard, A.E., Larsen, K.G., van de Pol, J.: Multi-core Emptiness Checking of Timed Büchi Automata Using Inclusion Abstraction. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol.ä8044, pp. 968—983. Springer, Heidelberg (2013)

Digital Library

[29]

Podelski, A., Wagner, S.: Region stability proofs for hybrid systems. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol.ä4763, pp. 320—335. Springer, Heidelberg (2007)

Digital Library

[30]

Duggirala, P., Mitra, S.: Abstraction Refinement for Stability. In: ICCPS, pp. 22—31 (2011)

Digital Library

[31]

Damm, W., Pinto, G., Ratschan, S.: 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)

[32]

Kindermann, R., Junttila, T., Niemelä, I.: Beyond lassos: Complete smt-based bounded model checking for timed automata. In: Giese, H., Rosu, G. (eds.) FMOODS/FORTE 2012. LNCS, vol.ä7273, pp. 84—100. Springer, Heidelberg (2012)

Digital Library

[33]

Plaku, E., Kavraki, L.E., Vardi, M.Y.: Falsification of ltl safety properties in hybrid systems. STTTä15(4), 305—320 (2013)

[34]

Nghiem, T., Sankaranarayanan, S., Fainekos, G.E., Ivancic, F., Gupta, A., Pappas, G.J.: Monte-carlo techniques for falsification of temporal properties of non-linear hybrid systems. In: HSCC, pp. 211—220 (2010)

Digital Library

[35]

Podelski, A., Rybalchenko, A.: Transition Invariants. In: LICS, pp. 32—41. IEEE Computer Society (2004)

Digital Library

[36]

Grebenshchikov, S., Lopes, N.P., Popeea, C., Rybalchenko, A.: Synthesizing software verifiers from proof rules. In: Vitek, J., Lin, H., Tip, F. (eds.) PLDI, pp. 405—416 (2012)

Digital Library

[37]

Henzinger, T.A., Ho, P.-H.: Hytech: The cornell hybrid technology tool. In: Antsaklis, P., Kohn, W., Nerode, A., Sastry, S. (eds.) Hybrid Systems II. LNCS, vol.ä999, pp. 265—293. Springer, Heidelberg (1995)

Digital Library

[38]

Wang, F.: Symbolic parametric safety analysis of linear hybrid systems with bdd-like data-structures. IEEE Trans. Software Eng.ä31(1), 38—51 (2005)

Digital Library

[39]

Fehnker, A., Ivanăić, F.: Benchmarks for hybrid systems verification. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol.ä2993, pp. 326—341. Springer, Heidelberg (2004)

[40]

Mover, S., Cimatti, A., Tiwari, A., Tonetta, S.: Time-aware relational abstractions for hybrid systems. In: EMSOFT, pp. 1—10 (2013)

Digital Library

[41]

Cimatti, A., Dorigatti, M., Tonetta, S.: OCRA: A tool for checking the refinement of temporal contracts. In: ASE, pp. 702—705 (2013)

Digital Library

Cited By

Bombardelli ATonetta S(2023)Reasoning with Metric Temporal Logic and Resettable Skewed ClocksNASA Formal Methods10.1007/978-3-031-33170-1_11(174-190)Online publication date: 16-May-2023
https://dl.acm.org/doi/10.1007/978-3-031-33170-1_11
Cimatti AGriggio AMagnago E(2022) LTL falsification in infinite-state systemsInformation and Computation10.1016/j.ic.2022.104977289:PAOnline publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1016/j.ic.2022.104977
Cimatti AGriggio AMagnago E(2021)Automatic Discovery of Fair Paths in Infinite-State Transition SystemsAutomated Technology for Verification and Analysis10.1007/978-3-030-88885-5_3(32-47)Online publication date: 18-Oct-2021
https://dl.acm.org/doi/10.1007/978-3-030-88885-5_3
Show More Cited By

Index Terms

Verifying LTL Properties of Hybrid Systems with K-Liveness

Index terms have been assigned to the content through auto-classification.

Recommendations

Verifying LTL Properties on Hierarchical Systems: Application to Aircraft Autopilot
ISOLA '06: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation

In this paper, we are interested in verifying temporal properties of hierarchical systems when states are refined by automata. The system is modeled by hierarchical automata and temporal properties are expressed by the LTL (Linear Temporal Logic). We ...
Verifying Liveness by Augmented Abstraction
CSL '99: Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic

The paper deals with the proof method of verification by augmented finitary abstraction (VAA), which presents an effective approach to the verification of the temporal properties of (potentially infinite-state) reactive systems. The method consists of a ...
On the refinement of liveness properties of distributed systems

We present a new approach, based on simulation relations, for reasoning about liveness properties of distributed systems. Our contribution consists of (1) a formalism for defining liveness properties, (2) a proof method for liveness properties based on ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

Proceedings of the 16th International Conference on Computer Aided Verification - Volume 8559

July 2014

873 pages

ISBN:9783319088662

Editors:
Armin Biere
Johannes Kepler University Linz, Linz, Austria
,
Roderick Bloem
IAIK, Graz University of Technology, Graz, Austria

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 18 July 2014

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Bombardelli ATonetta S(2023)Reasoning with Metric Temporal Logic and Resettable Skewed ClocksNASA Formal Methods10.1007/978-3-031-33170-1_11(174-190)Online publication date: 16-May-2023
https://dl.acm.org/doi/10.1007/978-3-031-33170-1_11
Cimatti AGriggio AMagnago E(2022) LTL falsification in infinite-state systemsInformation and Computation10.1016/j.ic.2022.104977289:PAOnline publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1016/j.ic.2022.104977
Cimatti AGriggio AMagnago E(2021)Automatic Discovery of Fair Paths in Infinite-State Transition SystemsAutomated Technology for Verification and Analysis10.1007/978-3-030-88885-5_3(32-47)Online publication date: 18-Oct-2021
https://dl.acm.org/doi/10.1007/978-3-030-88885-5_3
Cimatti AGriggio AMagnago E(2021)Proving the Existence of Fair Paths in Infinite-State SystemsVerification, Model Checking, and Abstract Interpretation10.1007/978-3-030-67067-2_6(104-126)Online publication date: 17-Jan-2021
https://dl.acm.org/doi/10.1007/978-3-030-67067-2_6
Wright TStark I(2020)Property-Directed Verified Monitoring of Signal Temporal LogicRuntime Verification10.1007/978-3-030-60508-7_19(339-358)Online publication date: 6-Oct-2020
https://dl.acm.org/doi/10.1007/978-3-030-60508-7_19
Beneš NBrim LDražanová JPastva SŠafránek DOzay NPrabhakar P(2019)Facetal abstraction for non-linear dynamical systems based on δ-decidable SMTProceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control10.1145/3302504.3311793(99-108)Online publication date: 16-Apr-2019
https://dl.acm.org/doi/10.1145/3302504.3311793
Khosrowjerdi HMeinke KPerrouin GAcher MCordy MDevroey X(2018)Learning-based testing for autonomous systems using spatial and temporal requirementsProceedings of the 1st International Workshop on Machine Learning and Software Engineering in Symbiosis10.1145/3243127.3243129(6-15)Online publication date: 3-Sep-2018
https://dl.acm.org/doi/10.1145/3243127.3243129
Cimatti AMicheli ARoveri MSingh SMarkovitch S(2017)Validating domains and plans for temporal planning via encoding into infinite-state linear temporal logicProceedings of the Thirty-First AAAI Conference on Artificial Intelligence10.5555/3298023.3298084(3547-3554)Online publication date: 4-Feb-2017
https://dl.acm.org/doi/10.5555/3298023.3298084
Cimatti ARoveri MTonetta S(2015)HRELTLInformation and Computation10.1016/j.ic.2015.06.006245:C(54-71)Online publication date: 1-Dec-2015
https://dl.acm.org/doi/10.1016/j.ic.2015.06.006
Cimatti AGriggio AMover STonetta S(2015)HyCompProceedings of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 903510.1007/978-3-662-46681-0_4(52-67)Online publication date: 11-Apr-2015
https://dl.acm.org/doi/10.1007/978-3-662-46681-0_4
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents