Tzanis Anevlavis
Editorial Notes
The authors have requested minor, non-substantive changes to the VoR and, in accordance with ACM policies, a Corrected VoR was published on January 26, 2021. For reference purposes the VoR may still be accessed via the Supplemental Material section on this page.
ABSTRACT
Robust Linear Temporal Logic (rLTL) was crafted to incorporate the notion of robustness into Linear-time Temporal Logic (LTL) specifications. Technically, robustness was formalized in the logic rLTL via 5 different truth values and it led to an increase in the time complexity of the associated model checking problem. In general, model checking an rLTL formula relies on constructing a generalized Büchi automaton of size 5 | φ | where | φ | denotes the length of an rLTL formula φ. It was recently shown that the size of this automaton can be reduced to 3 | φ | (and even smaller) when the formulas to be model checked come from a fragment of rLTL. In this paper, we introduce Evrostos, the first tool for model checking formulas in this fragment. We also present several empirical studies, based on models and LTL formulas reported in the literature, confirming that rLTL model checking for the aforementioned fragment incurs in a time overhead that makes the verification of rLTL practical.
Supplemental Material
Available for Download
Version of Record for "Evrostos: the rLTL verifier" by Anevlavis et al., Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control (HSCC '19).
- T. Anevlavis, M. Philippe, D. Neider, and P. Tabuada. 2018. Verifying rLTL formulas: now faster than ever before!. In 2018 IEEE Conference on Decision and Control (CDC). 1556--1561.Google Scholar
- Shoham Ben-David, Baruch Sterin, Joanne M. Atlee, and Sandy Beidu. 2015. Symbolic Model Checking of Product-line Requirements Using SAT-based Methods. In Proceedings of the 37th International Conference on Software Engineering - Volume 1 (ICSE '15). IEEE Press, Piscataway, NJ, USA, 189--199. Google ScholarDigital Library
- Roderick Bloem, Krishnendu Chatterjee, Karin Greimel, Thomas A. Henzinger, Georg Hofferek, Barbara Jobstmann, Bettina Könighofer, and Robert Könighofer. 2014. Synthesizing Robust Systems. Acta Inf. 51, 3--4 (June 2014), 193--220. Google ScholarDigital Library
- Alessandro Cimatti, Edmund M. Clarke, Enrico Giunchiglia, Fausto Giunchiglia, Marco Pistore, Marco Roveri, Roberto Sebastiani, and Armando Tacchella. 2002. NuSMV 2: An OpenSource Tool for Symbolic Model Checking. In Proceedings of the 14th International Conference on Computer Aided Verification (CAV '02). Springer-Verlag, London, UK, UK, 359--364. Google ScholarDigital Library
- Edmund M Clarke, Orna Grumberg, and Doron Peled. 1999. Model checking. MIT press. Google ScholarDigital Library
- Eric Dallal, Daniel Neider, and Paulo Tabuada. 2016. Synthesis of safety controllers robust to unmodeled intermittent disturbances. In Decision and Control (CDC), 2016 IEEE 55th Conference on. IEEE, 7425--7430.Google ScholarDigital Library
- Alexandre Donzé and Oded Maler. 2010. Robust satisfaction of temporal logic over real-valued signals. In International Conference on Formal Modeling and Analysis of Timed Systems. Springer, 92--106. Google ScholarDigital Library
- Heinz Erzberger and K Heere. 2010. Algorithm and operational concept for resolving short-range conflicts. In Proceedings of The Institution of Mechanical Engineers Part G-journal of Aerospace Engineering - PROC INST MECH ENG G-J A E, Vol. 224. 225--243.Google ScholarCross Ref
- Georgios E Fainekos and George J Pappas. 2006. Robustness of temporal logic specifications. In Formal Approaches to Software Testing and Runtime Verification. Springer, 178--192. Google ScholarDigital Library
- Georgios E Fainekos and George J Pappas. 2009. Robustness of temporal logic specifications for continuous-time signals. Theoretical Computer Science 410, 42 (2009), 4262--4291. Google ScholarDigital Library
- Xiang Gan, Jori Dubrovin, and Keijo Heljanko. 2014. A symbolic model checking approach to verifying satellite onboard software. Science of Computer Programming 82 (2014), 44 -- 55. Special Issue on Automated Verification of Critical Systems (AVoCS'11). Google ScholarDigital Library
- Rafal Goebel, Joao Hespanha, Andrew R Teel, Chaohong Cai, and Ricardo Sanfelice. 2004. Hybrid systems: Generalized solutions and robust stability. IFAC Proceedings Volumes 37, 13 (2004), 1--12.Google ScholarCross Ref
- Rafal Goebel, Ricardo G Sanfelice, and Andrew R Teel. 2012. Hybrid Dynamical Systems: modeling, stability, and robustness. Princeton University Press.Google Scholar
- J. Lahtinen, J. Valkonen, K. Björkman, J. Frits, I. Niemelä, and K. Heljanko. 2012. Model checking of safety-critical software in the nuclear engineering domain. Reliability Engineering & System Safety 105 (2012), 104 -- 113. ESREL 2010.Google ScholarCross Ref
- Rupak Majumdar, Elaine Render, and Paulo Tabuada. 2013. A theory of robust omega-regular software synthesis. ACM Transactions on Embedded Computing Systems (TECS) 13, 3 (2013), 48. Google ScholarDigital Library
- Malte Plath and Mark Ryan. 2001. Feature integration using a feature construct. Science of Computer Programming 41, 1 (2001), 53 -- 84. Google ScholarDigital Library
- Kristin Y. Rozier. 2011. Linear Temporal Logic Symbolic Model Checking. Computer Science Review 5, 2 (2011), 163 -- 203. Google ScholarDigital Library
- Matthias Rungger and Paulo Tabuada. 2016. A notion of robustness for cyber-physical systems. IEEE Trans. Automat. Control 61, 8 (2016), 2108--2123.Google ScholarCross Ref
- Philippe Schnoebelen. 2002. The Complexity of Temporal Logic Model Checking. Advances in modal logic 4, 393--436 (2002), 35.Google Scholar
- Alireza Souri, Nima Jafari Navimipour, and Amir Masoud Rahmani. 2018. Formal verification approaches and standards in the cloud computing: A comprehensive and systematic review. Computer Standards & Interfaces 58 (2018), 1 -- 22. Google ScholarDigital Library
- Paulo Tabuada, Sina Yamac Caliskan, Matthias Rungger, and Rupak Majumdar. 2014. Towards robustness for cyber-physical systems. IEEE Trans. Automat. Control 59, 12 (2014), 3151--3163.Google ScholarCross Ref
- Paulo Tabuada and Daniel Neider. 2015. Robust Linear Temporal Logic. arXiv preprint arXiv:1510.08970 (2015).Google Scholar
- Danielle C Tarraf, Alexandre Megretski, and Munther A Dahleh. 2008. A framework for robust stability of systems over finite alphabets. IEEE Trans. Automat. Control 53, 5 (2008), 1133--1146.Google ScholarCross Ref
- Yih-Kuen Tsay, Ming-Hsien Tsai, Jinn-Shu Chang, and Yi-Wen Chang. 2011. Büchi store: an open repository of büchi automata. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Springer, 262--266. Google ScholarDigital Library
- Yang Zhao and Kristin Yvonne Rozier. 2014. Formal Specification and Verification of a Coordination Protocol for an Automated Air Traffic Control System. Sci. Comput. Program. 96, P3 (Dec. 2014), 337--353. Google ScholarDigital Library
Index Terms
- Evrostos: the rLTL verifier
Recommendations
Regular model checking for LTL(MSO)
Regular model checking is a form of symbolic model checking for parameterized and infinite-state systems whose states can be represented as words of arbitrary length over a finite alphabet, in which regular sets of words are used to represent sets of ...
Context-free timed formalisms: Robust automata and linear temporal logics
AbstractThe paper focuses on automata and linear temporal logics for real-time pushdown reactive systems bridging tractable formalisms specialized for expressing separately dense-time real-time properties and context-free properties though ...
Temporal logics with language parameters
AbstractWe develop a generic framework to extend the logics LTL, CTL+ and CTL⁎ by automata-based connectives from formal language classes and analyse this framework with regard to regular languages, visibly pushdown languages, deterministic and non-...
Comments