Formal Probabilistic Analysis of Cyber-Physical Transportation Systems

Formal specification and verification of cyber-physical transportation systems is inherently a complex task. A fail-safe specification of such systems not only includes intricate formalizations of assumptions and requirements but also a fine-grained analysis of their unpredictable and random components, at times at different levels of abstraction. Traditional techniques of verification and validation, such as simulation or model checking, do not cope very well with the posed challenges. In fact, sometimes it becomes merely impossible to guarantee certain properties, such as liveness, under all possible scenarios. We propose an approach based on higher-order logic for formal modelling and reasoning of cyber-physical transportation systems. In this approach, we express the unpredictable elements of the model by appropriate random variables. Instead of guaranteeing absolute correctness, these randomized models can then be used to formally reason about the probability or expectation of the system meeting its required specification. For illustration purposes, the paper presents a simple analysis of a vehicle platoon control algorithm.

[1]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[2]  Lawrence Charles Paulson,et al.  ML for the working programmer , 1991 .

[3]  Freek Wiedijk,et al.  The Seventeen Provers of the World, Foreword by Dana S. Scott , 2006, The Seventeen Provers of the World.

[4]  Geoff Sutcliffe,et al.  Automated Reasoning in Higher-Order Logic using the TPTP THF Infrastructure , 2010, J. Formaliz. Reason..

[5]  Augusto Sampaio,et al.  Systematic Model-Based Safety Assessment Via Probabilistic Model Checking , 2010, ISoLA.

[6]  Marta Z. Kwiatkowska,et al.  PRISM: Probabilistic Symbolic Model Checker , 2002, Computer Performance Evaluation / TOOLS.

[7]  Ramon Puigjaner,et al.  Computer Performance Evaluation , 2000, Lecture Notes in Computer Science.

[8]  Rachel Cardell-Oliver The formal verification of hard real-time systems , 1992 .

[9]  Richard Cowan,et al.  Useful headway models , 1975 .

[10]  Jean-Raymond Abrial,et al.  Modeling in event-b - system and software engineering by Jean-Raymond Abrial , 2010, SOEN.

[11]  Lawrence C. Paulson,et al.  ML for the working programmer (2. ed.) , 1996 .

[12]  Thai Son Hoang,et al.  Qualitative Probabilistic Modelling in Event-B , 2007, IFM.

[13]  Ajitha Rajan,et al.  Requirements Coverage as an Adequacy Measure for Conformance Testing , 2008, ICFEM.

[14]  Christel Baier,et al.  Principles of model checking , 2008 .

[15]  Heber Herencia-Zapana,et al.  Formalizing Probabilistic Safety Claims , 2011, NASA Formal Methods.

[16]  Christel Baier,et al.  Principles of Model Checking (Representation and Mind Series) , 2008 .

[17]  Michael J. C. Gordon,et al.  Mechanizing programming logics in higher order logic , 1989 .

[18]  MA John Harrison PhD Theorem Proving with the Real Numbers , 1998, Distinguished Dissertations.

[19]  Frank Waters,et al.  The B Book , 1971 .

[20]  Sarfraz Khurshid,et al.  Proceedings of the Third international conference on Abstract State Machines, Alloy, B, VDM, and Z , 2012 .

[21]  S. Anderson,et al.  Secure Synthesis of Code: A Process Improvement Experiment , 1999, World Congress on Formal Methods.

[22]  L. Devroye Non-Uniform Random Variate Generation , 1986 .

[23]  Sofiène Tahar,et al.  Formal Analysis of Optical Waveguides in HOL , 2009, TPHOLs.

[24]  Mohamed Nassim Seghir,et al.  A Lightweight Approach for Loop Summarization , 2011, ATVA.

[25]  M. Fitting First-order logic and automated theorem proving (2nd ed.) , 1996 .

[26]  Janos Galambos,et al.  Advanced probability theory , 1988 .

[27]  Atif Mashkoor,et al.  Utilizing Event-B for domain engineering: a critical analysis , 2011, Requirements Engineering.

[28]  Elena Troubitsyna,et al.  Towards Probabilistic Modelling in Event-B , 2010, IFM.

[29]  Steve A. Schneider,et al.  ZB 2005: Formal Specification and Development in Z and B, 4th International Conference of B and Z Users, Guildford, UK, April 13-15, 2005, Proceedings , 2005, ZB.

[30]  L. M. M.-T. Theory of Probability , 1929, Nature.

[31]  Sofiène Tahar,et al.  Formal Probabilistic Analysis: A Higher-Order Logic Based Approach , 2010, ASM.

[32]  Sofiène Tahar,et al.  Formal Analysis of a Scheduling Algorithm for Wireless Sensor Networks , 2011, ICFEM.

[33]  Marta Kwiatkowska,et al.  Controller Dependability Analysis by Probabilistic Model Checking , 2004 .

[34]  Frédéric Badeau,et al.  Using B as a High Level Programming Language in an Industrial Project: Roissy VAL , 2005, ZB.

[35]  Sofiène Tahar,et al.  On the Formalization of the Lebesgue Integration Theory in HOL , 2010, ITP.

[36]  John Harrison,et al.  Handbook of Practical Logic and Automated Reasoning , 2009 .

[37]  Joe Hurd,et al.  Formal verification of probabilistic algorithms , 2003 .

[38]  Umair Siddique,et al.  Formal analysis of fractional order systems in HOL , 2011, 2011 Formal Methods in Computer-Aided Design (FMCAD).

[39]  T. V. Reeves A Theory of Probability , 1988, The British Journal for the Philosophy of Science.

[40]  Edmund M. Clarke,et al.  Statistical Model Checking for Cyber-Physical Systems , 2011, ATVA.

[41]  Freek Wiedijk,et al.  The Seventeen Provers of the World , 2006 .

[42]  Johannes Hölzl,et al.  Three Chapters of Measure Theory in Isabelle/HOL , 2011, ITP.

[43]  J. Harrison Formalized Mathematics , 1996 .

[44]  C. E. Brown Automated Reasoning in Higher-Order Logic: Set Comprehension and Extensionality in Church's Type Theory , 2007 .

[45]  Robin Milner,et al.  A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[46]  Sofiène Tahar,et al.  Formal Reliability Analysis Using Theorem Proving , 2010, IEEE Transactions on Computers.

[47]  Paul Benoit,et al.  Météor: A Successful Application of B in a Large Project , 1999, World Congress on Formal Methods.

[48]  Jean-Pierre Jacquot,et al.  Scaling Up with Event-B: A Case Study , 2011, NASA Formal Methods.

[49]  Melvin Fitting,et al.  First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.