Formal modeling and performance evaluation for hybrid systems: a probabilistic hybrid process algebra-based approach

Probabilistic behavior is omnipresent in computer controlled systems, in particular, so-called safety-critical hybrid systems, because of various reasons, like uncertain environments, or fundamental properties of nature. In this paper, we extend existing hybrid process algebra ACP hs with probability without replacing nondeterministic choice operator. In view of some shortcomings in existing approximate probabilistic bisimulation, we relax the constrains and propose a novel approximate probabilistic bisimulation relation. After that, we present a performance evaluation language CTRML, to reason over probabilistic systems, which extend the results to real number. Along with the specification language, we present a set of algorithms for the evaluation of the language. Additionally, we transfer the hybrid process algebra to probabilistic transition system and show experimental results.

[1]  U Uzma Khadim,et al.  A comparative study of process algebras for hybrid systems , 2006 .

[2]  Naijun Zhan,et al.  Extending Hybrid CSP with Probability and Stochasticity , 2015, SETTA.

[3]  Ka Lok Man,et al.  Syntax and consistent equation semantics of hybrid Chi , 2006, J. Log. Algebraic Methods Program..

[4]  Roberto Segala,et al.  Decision Algorithms for Probabilistic Bisimulation , 2002, CONCUR.

[5]  Michel A. Reniers,et al.  Hybrid process algebra , 2005, J. Log. Algebraic Methods Program..

[6]  Theodore S. Rappaport,et al.  Wideband Millimeter-Wave Propagation Measurements and Channel Models for Future Wireless Communication System Design , 2015, IEEE Transactions on Communications.

[7]  Hosung Song,et al.  The Phi-Calculus: A Language for Distributed Control of Reconfigurable Embedded Systems , 2003, HSCC.

[8]  Naijun Zhan,et al.  Formal Modelling, Analysis and Verification of Hybrid Systems , 2013, ICTAC Training School on Software Engineering.

[9]  Bengt Jonsson,et al.  Probabilistic Process Algebra , 2001 .

[10]  David Wetherall,et al.  Predictable 802.11 packet delivery from wireless channel measurements , 2010, SIGCOMM '10.

[11]  Jan Joris Vereijken A Process Algebra for Hybrid Systems , 1999 .

[12]  Radha Jagadeesan,et al.  The metric analogue of weak bisimulation for probabilistic processes , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[13]  Antoine Girard,et al.  Approximation Metrics for Discrete and Continuous Systems , 2006, IEEE Transactions on Automatic Control.

[14]  Thomas A. Henzinger,et al.  Automatic symbolic verification of embedded systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

[15]  Andrea Maggiolo-Schettini,et al.  Weak bisimulation for Probabilistic Timed Automata , 2010, Theor. Comput. Sci..

[16]  Arnold Neumaier,et al.  Introduction to Numerical Analysis , 2001 .

[17]  Naijun Zhan,et al.  Approximate Bisimulation and Discretization of Hybrid CSP , 2016, FM.

[18]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[19]  Scott A. Smolka,et al.  Algebraic Reasoning for Probabilistic Concurrent Systems , 1990, Programming Concepts and Methods.

[21]  George J. Pappas,et al.  Statistical Learning for Analysis of Networked Control Systems over Unknown Channels , 2019, Autom..

[22]  Wang Yi,et al.  Probabilistic Extensions of Process Algebras , 2001, Handbook of Process Algebra.

[23]  Anders P. Ravn,et al.  A Formal Description of Hybrid Systems , 1996, Hybrid Systems.