Priced Timed Automata and Statistical Model Checking

The notions of priced timed automata (PTA) and energy games (EG) provide useful modeling formalisms for energy-aware and energy-harvesting embedded systems. We review these formalisms and a range of associated decision problems covering cost-optimal reachability, model-checking and cost-bounded infinite strategies. Decidability of several of these problems require tight bounds on the number of clocks and cost variables. Thus, we turn to statistical model checking (SMC), which has emerged as a highly scalable simulation-based “approximate” validation technique. In a series of recent work we have developed a natural stochastic semantics for PTAs allowing for statistical model checking to be performed. The resulting techniques have been implemented in Uppaal-smc, and applied to the performance analysis of a number of systems ranging from real-time scheduling, mixed criticality systems, sensor networks, energy aware systems and systems biology.

[1]  Oded Maler,et al.  Task graph scheduling using timed automata , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[2]  Kim G. Larsen,et al.  A Tutorial on Uppaal , 2004, SFM.

[3]  Yassine Lakhnech,et al.  Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems , 2004, Lecture Notes in Computer Science.

[4]  Kim G. Larsen,et al.  Model Checking One-clock Priced Timed Automata , 2007, Log. Methods Comput. Sci..

[5]  Karin Quaas,et al.  On the Interval-Bound Problem for Weighted Timed Automata , 2011, LATA.

[6]  Jirí Srba,et al.  Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets , 2008, FORMATS.

[7]  Wang Yi,et al.  UPPAAL Implementation Secrets , 2002, FTRTFT.

[8]  Mahesh Viswanathan,et al.  Statistical Model Checking of Black-Box Probabilistic Systems , 2004, CAV.

[9]  Kim G. Larsen,et al.  Energy Games in Multiweighted Automata , 2011, ICTAC.

[10]  Kim G. Larsen,et al.  Guided Synthesis of Control Programs Using UPPAAL , 2000, Nord. J. Comput..

[11]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[12]  Stavros Tripakis,et al.  KRONOS: A Model-Checking Tool for Real-Time Systems (Tool-Presentation for FTRTFT '98) , 1998, FTRTFT.

[13]  Kim G. Larsen,et al.  Time for Statistical Model Checking of Real-Time Systems , 2011, CAV.

[14]  Joseph Sifakis,et al.  Tools and Applications II: The IF Toolset , 2004 .

[15]  Wang Yi,et al.  Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.

[16]  Kim G. Larsen,et al.  Staying Alive as Cheaply as Possible , 2004, HSCC.

[17]  Kim G. Larsen,et al.  Distributed Parametric and Statistical Model Checking , 2011, PDMC.

[18]  George J. Pappas,et al.  Optimal Paths in Weighted Timed Automata , 2001, HSCC.

[19]  Kim G. Larsen,et al.  Minimum-Cost Reachability for Priced Timed Automata , 2001, HSCC.

[20]  Kim G. Larsen,et al.  Runtime Verification of Biological Systems , 2012, ISoLA.

[21]  Frédéric Magniez,et al.  Probabilistic abstraction for model checking: An approach based on property testing , 2007, TOCL.

[22]  Kim G. Larsen,et al.  As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata , 2001, CAV.

[23]  Nicolas Markey,et al.  Verification of Embedded Systems — Algorithms and Complexity , 2011 .

[24]  Ansgar Fehnker,et al.  Scheduling a steel plant with timed automata , 1999, Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306).

[25]  Zhang Hai,et al.  SCIENCE CHINA Information Sciences , 2010 .

[26]  Kim G. Larsen,et al.  An evaluation framework for energy aware buildings using statistical model checking , 2012, Science China Information Sciences.

[27]  Kim G. Larsen,et al.  Schedulability of Herschel-Planck Revisited Using Statistical Model Checking , 2012, ISoLA.

[28]  Joost-Pieter Katoen,et al.  A probabilistic extension of UML statecharts: Specification and Verification. , 2002 .

[29]  Axel Legay,et al.  Statistical Model Checking: An Overview , 2010, RV.

[30]  Kim G. Larsen,et al.  Rewrite-Based Statistical Model Checking of WMTL , 2012, RV.

[31]  Wang Yi,et al.  Efficient Timed Reachability Analysis Using Clock Difference Diagrams , 1998, CAV.

[32]  Kim G. Larsen,et al.  Optimal reachability for multi-priced timed automata , 2008, Theor. Comput. Sci..

[33]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[34]  Kim G. Larsen,et al.  Lower-Bound Constrained Runs in Weighted Timed Automata , 2012, 2012 Ninth International Conference on Quantitative Evaluation of Systems.

[35]  Kim G. Larsen,et al.  Complexity in Simplicity: Flexible Agent-Based State Space Exploration , 2007, TACAS.

[36]  Kim G. Larsen,et al.  Lower and Upper Bounds in Zone Based Abstractions of Timed Automata , 2004, TACAS.

[37]  Kim G. Larsen,et al.  To Store or Not to Store , 2003, CAV.

[38]  Kim G. Larsen,et al.  Optimal Conditional Reachability for Multi-priced Timed Automata , 2005, FoSSaCS.

[39]  Joost-Pieter Katoen,et al.  The Ins and Outs of the Probabilistic Model Checker MRMC , 2009, 2009 Sixth International Conference on the Quantitative Evaluation of Systems.

[40]  Wang Yi,et al.  Efficient verification of real-time systems: compact data structure and state-space reduction , 1997, Proceedings Real-Time Systems Symposium.

[41]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[42]  Kim G. Larsen,et al.  Statistical Model Checking for Networks of Priced Timed Automata , 2011, FORMATS.

[43]  Thomas A. Henzinger,et al.  Hybrid Systems: Computation and Control , 1998, Lecture Notes in Computer Science.

[44]  Kim G. Larsen,et al.  Priced Timed Automata: Algorithms and Applications , 2004, FMCO.

[45]  Wang Yi,et al.  Clock Difference Diagrams , 1998, Nord. J. Comput..

[46]  Kim G. Larsen,et al.  Timed automata with observers under energy constraints , 2010, HSCC '10.

[47]  Véronique Bruyère,et al.  Model-Checking for Weighted Timed Automata , 2004, FORMATS/FTRTFT.

[48]  Oded Maler,et al.  Timed Automata as an Underlying Model for Planning and Scheduling , 2002, AIPS Workshop on Planning for Temporal Domains.

[49]  Kim G. Larsen,et al.  Optimal scheduling using priced timed automata , 2005, PERV.

[50]  Kim G. Larsen,et al.  Infinite Runs in Weighted Timed Automata with Energy Constraints , 2008, FORMATS.

[51]  Håkan L. S. Younes,et al.  Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling , 2002, CAV.

[52]  Véronique Bruyère,et al.  On the optimal reachability problem of weighted timed automata , 2007, Formal Methods Syst. Des..

[53]  Kim G. Larsen,et al.  Monitor-Based Statistical Model Checking for Weighted Metric Temporal Logic , 2012, LPAR.

[54]  Frank D. Valencia,et al.  Formal Methods for Components and Objects , 2002, Lecture Notes in Computer Science.

[55]  Antonio Cerone,et al.  Theoretical Aspects of Computing (ICTAC 2011) , 2014, Theor. Comput. Sci..

[56]  Kim G. Larsen,et al.  Optimal infinite scheduling for multi-priced timed automata , 2008, Formal Methods Syst. Des..

[57]  William T. Ziemba,et al.  Applications and case studies , 2007 .

[58]  Wojciech Rytter,et al.  On the Maximal Number of Cubic Runs in a String , 2010, LATA.

[59]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[60]  Frits W. Vaandrager,et al.  Distributing Timed Model Checking - How the Search Order Matters , 2000, CAV.

[61]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[62]  Kim G. Larsen,et al.  Discount-Optimal Infinite Runs in Priced Timed Automata , 2009, INFINITY.