Abstract
We propose and extend an approach for the verification of safety properties for parameterized timed systems modeled as networks of timed automata. For this task, we introduce an incremental workflow that is based on our algorithm IC3 with Zones. It proceeds in a cycle in which single models of the system are verified, and the verification results are employed for the reasoning about the entire system. Starting with the smallest instances, the verification of the safety property is carried out fast and efficient. On successful verification, the algorithm produces an inductive strengthening of the safety property. We reuse this result and try to reason about the entire parameterized timed system. To this end, we extrapolate the inductive strengthening into a candidate for the next-larger model. In case this candidate is a valid inductive strengthening for the next larger model, our main theorem reasons about all models of the parameterized timed system, stating that the safety property holds true for all models. Otherwise, the main cycle starts over with the verification of the next larger model. This workflow is iterated indefinitely, until able to reason about the entire parameterized timed system, until a counterexample trace is found, or until the single models become too large to be handled in the verification. We reuse the intermediate results in a Feedback-loop in order to accelerate the verification runs for the single models. Furthermore, we consider an extended formalism in comparison to our previous publications.
- Parosh Aziz Abdulla, Johann Deneux, and Pritha Mahata. 2004. Multi-clock timed networks. In Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS’04). 345--354. Google Scholar
Digital Library
- Rajeev Alur. 1999. Timed automata. In Computer Aided Verification, Nicolas Halbwachs and Doron Peled (Eds.). Lecture Notes in Computer Science, Vol. 1633. Springer, Berlin, 8--22. Google Scholar
Digital Library
- Rajeev Alur and David Dill. 1990. Automata for modeling real-time systems. In Automata, Languages and Programming. Springer, 322--335. Google Scholar
Digital Library
- Rajeev Alur and David L Dill. 1994. A theory of timed automata. Theor. Comput. Sci. 126, 2 (1994), 183--235. Google Scholar
Digital Library
- Krzysztof R. Apt and Dexter Kozen. 1986. Limits for automatic verification of finite-state concurrent systems. Inf. Process. Lett. 22, 6 (1986), 307--309. Google Scholar
Digital Library
- Tamarah Arons, Amir Pnueli, Sitvanit Ruah, Jiazhao Xu, and Lenore D. Zuck. 2001. Parameterized verification with automatically computed inductive assertions. In Proceedings of the 13th International Conference on Computer Aided Verification (CAV ’01). 221--234. Google Scholar
Digital Library
- Gerd Behrmann, Patricia Bouyer, Kim G. Larsen, and Radek Pelánek. 2004. Lower and upper bounds in zone based abstractions of timed automata. In Tools and Algorithms for the Construction and Analysis of Systems. Springer, 312--326.Google Scholar
- Johan Bengtsson, Kim G. Larsen, Fredrik Larsson, Paul Pettersson, and Wang Yi. 1995. Uppaal—A tool suite for automatic verification of real--time systems. In Proceedings of the Workshop on Verification and Control of Hybrid Systems III(LNCS). Springer--Verlag, 232--243. Google Scholar
Digital Library
- Aaron R. Bradley. 2011. SAT-based model checking without unrolling. In Proceedings of the 12th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2011). 70--87. Google Scholar
Digital Library
- Roberto Bruttomesso, Alessandro Carioni, Silvio Ghilardi, and Silvio Ranise. 2012. Automated analysis of parametric timing-based mutual exclusion algorithms. In NASA Formal Methods, Alwyn E. Goodloe and Suzette Person (Eds.). Lecture Notes in Computer Science, Vol. 7226. Springer, Berlin, 279--294. Google Scholar
Digital Library
- Hana Chockler, Alexander Ivrii, Arie Matsliah, Shiri Moran, and Ziv Nevo. 2011. Incremental formal verification of hardware. In FMCAD, Per Bjesse and Anna Slobodová (Eds.). FMCAD Inc., 135--143. Google Scholar
Digital Library
- Niklas Een, Alan Mishchenko, and Robert Brayton. 2011. Efficient implementation of property directed reachability. In Proceedings of the International Conference on Formal Methods in Computer-Aided Design (FMCAD’11). FMCAD Inc., Austin, TX, 125--134. Google Scholar
Digital Library
- Thomas Göthel. 2012. Mechanical Verification of Parameterized Real-time Systems. Ph.D. Dissertation. Technische Universität Berlin.Google Scholar
- Olga Grinchtein and Martin Leucker. 2008. Network invariants for real-time systems. Form. Asp. Comput. 20, 6 (Dec. 2008), 619--635.Google Scholar
Cross Ref
- Martijn Hendriks, Gerd Behrmann, Kim Guldstrand Larsen, Peter Niebert, and Frits W. Vaandrager. 2003. Adding symmetry reduction to uppaal. In Formal Modeling and Analysis of Timed Systems: 1st International Workshop (FORMATS’03) (Lecture Notes in Computer Science), Kim Guldstrand Larsen and Peter Niebert (Eds.), Vol. 2791. Springer, 46--59.Google Scholar
- Tobias Isenberg. 2015. Incremental inductive verification of parameterized timed systems. In Proceedings of the 2015 15th International Conference on Application of Concurrency to System Design (ACSD’15). IEEE, 1--9. Google Scholar
Digital Library
- Tobias Isenberg and Heike Wehrheim. 2014. Timed automata verification via IC3 with zones. In Proceedings of the 16th International Conference on Formal Engineering Methods and Software Engineering (ICFEM’14). 203--218.Google Scholar
Cross Ref
- Taylor T. Johnson. 2013. Uniform Verification of Safety for Parameterized Networks of Hybrid Automata. Ph.D. Dissertation. Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL.Google Scholar
- Taylor T. Johnson and Sayan Mitra. 2012. A small model theorem for rectangular hybrid automata networks. In Proceedings of the Joint 14th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Systems FMOODS’12) and the 32nd IFIP WG 6.1 International Conference (FORTE’12). 18--34. Google Scholar
Digital Library
- Alexander Kaiser, Daniel Kroening, and Thomas Wahl. 2010. Dynamic cutoff detection in parameterized concurrent programs. In Computer Aided Verification, Tayssir Touili, Byron Cook, and Paul Jackson (Eds.). Lecture Notes in Computer Science, Vol. 6174. Springer, Berlin, 645--659. Google Scholar
Digital Library
- Yonit Kesten, Amir Pnueli, Elad Shahar, and Lenore Zuck. 2002. Network invariants in action*. In CONCUR 2002 Concurrency Theory, Lubo Brim, Mojmr Ketnsk, Antonn Kuera, and Petr Janar (Eds.). Lecture Notes in Computer Science, Vol. 2421. Springer, Berlin, 101--115. Google Scholar
Digital Library
- Kim G. Larsen, Paul Pettersson, and Wang Yi. 1995. Model-checking for real-time systems. In Fundamentals of Computation Theory. Springer, 62--88. Google Scholar
Digital Library
- Nancy A. Lynch and Nir Shavit. 1992. Timing-based mutual exclusion. In Proceedings of the Real-Time Systems Symposium. 2--11.Google Scholar
- Robin Milner. 1980. A Calculus of Communicating Systems. Lecture Notes in Computer Science, Vol. 92. Springer, Berlin Heidelberg. Google Scholar
Index Terms
Incremental Inductive Verification of Parameterized Timed Systems
Recommendations
Incremental Inductive Verification of Parameterized Timed Systems
ACSD '15: Proceedings of the 2015 15th International Conference on Application of Concurrency to System DesignWe propose an incremental workflow for the verification of parameterized systems modeled as symmetric networks of timed automata.Starting with a small number of timed automata in the network, a safety property is verified using IC3, a state-of-the-art ...
Generalized Property-Directed Reachability for Hybrid Systems
Verification, Model Checking, and Abstract InterpretationAbstractGeneralized property-directed reachability (GPDR) belongs to the family of the model-checking techniques called IC3/PDR. It has been successfully applied to software verification; for example, it is the core of Spacer, a state-of-the-art Horn-...
Property-Directed Inference of Universal Invariants or Proving Their Absence
We present Universal Property Directed Reachability (PDR∀), a property-directed semi-algorithm for automatic inference of invariants in a universal fragment of first-order logic. PDR∀ is an extension of Bradley’s PDR/IC3 algorithm for inference of ...






Comments