scholarly journals Verification of Cyberphysical Systems

Mathematics ◽  
2020 ◽  
Vol 8 (7) ◽  
pp. 1068 ◽  
Author(s):  
Marjan Sirjani ◽  
Edward A. Lee ◽  
Ehsan Khamespanah

The value of verification of cyberphysical systems depends on the relationship between the state of the software and the state of the physical system. This relationship can be complex because of the real-time nature and different timelines of the physical plant, the sensors and actuators, and the software that is almost always concurrent and distributed. In this paper, we study different ways to construct a transition system model for the distributed and concurrent software components of a CPS. The purpose of the transition system model is to enable model checking, an established and widely used verification technique. We describe a logical-time-based transition system model, which is commonly used for verifying programs written in synchronous languages, and derive the conditions under which such a model faithfully reflects physical states. When these conditions are not met (a common situation), a finer-grained event-based transition system model may be required. We propose an approach for formal verification of cyberphysical systems using Lingua Franca, a language designed for programming cyberphysical systems, and Rebeca, an actor-based language designed for model checking distributed event-driven systems. We focus on the cyber part and model a faithful interface to the physical part. Our method relies on the assumption that the alignment of different timelines during the execution of the system is the responsibility of the underlying platforms. We make those assumptions explicit and clear.

Author(s):  
Henning Günther ◽  
Alfons Laarman ◽  
Ana Sokolova ◽  
Georg Weissenbacher

2014 ◽  
Vol 6 (3) ◽  
pp. 1-31 ◽  
Author(s):  
Sofia Kouah ◽  
Djamel-Eddine Saidouni

This paper aims to provide a formal framework that supports an incremental development of dynamic systems such as multi agents systems (MAS). We propose a fuzzy labeled transition system model (FLTS for short). FLTS allows a concise action refinement representation and deals with incomplete information through its fuzziness representation. Afterward, based on FLTS model, we propose a refinement model called fuzzy labeled transition refinement tree (FLTRT for short). The FLTRT structure serves as a tree of potential concurrent design trajectories of the system. Also, we introduce bisimulation relations for both models in order to identify equivalent design trajectories, which could be assessed with respect to relevant design parameters.


2013 ◽  
Vol 328 ◽  
pp. 254-260
Author(s):  
Zhi Yuan Chen ◽  
Shao Bin Huang ◽  
Ming Yu Ji ◽  
Lin Shan Shen

For given system to proceed model checking, if system model is discontent with the quality which to be detected, model detector will give counterexample, it will cause the generated counterexample too long when system state-space is very large, it is a very important problem, how to find the reason of model failure from long counterexample quickly, the article uses extractive technique of minimal unsatisfiable subformula to put forward a kind of understanding counterexample way which is extracted minimal unsatisfiable subformula quickly from Boolean formula. The algorithm can pinpoint error and find the reason of model failure. Experimental result indicated that understanding counterexample is based on minimal unsatisfiable subformula can accelerate understanding counterexample speed, improve the efficient of debugging, guide system abstract model improvement effectively.


2012 ◽  
Vol 241-244 ◽  
pp. 3020-3025
Author(s):  
Ling Ling Dong ◽  
Yong Guan ◽  
Xiao Juan Li ◽  
Zhi Ping Shi ◽  
Jie Zhang ◽  
...  

Considerable attention has been devoted to prove the correctness of programs. Formal verification overcomes the incompleteness by applying mathematical methods to verify a design. SpaceWire is a well known communication standard. For safety-critical applications an approach is needed to validate the completeness of SpareWire design. This paper addresses formal verification of SpareWire error detection module. The system model was constructed by Kripke structure, and the properties were presented by linear temporal logic (LTL). Compared the verification of LTL with CTL (branch temporal logic), LTL properties could improve the verification efficiency due to its linear search. The error priority was checked using simulation guided by model checking. After some properties were modified, all possible behaviors of the module satisfied the specification. This method realizes complete validation of the error detection module.


2006 ◽  
Vol 16 (2) ◽  
pp. 179-205 ◽  
Author(s):  
Didier Lime ◽  
Olivier H. Roux

2009 ◽  
Vol 10 (2) ◽  
pp. 117-138 ◽  
Author(s):  
Wai-Yuan Tan ◽  
Weiming Ke ◽  
G. Webb

We develop a state space model documenting Gompertz behaviour of tumour growth. The state space model consists of two sub-models: a stochastic system model that is an extension of the deterministic model proposed by Gyllenberg and Webb (1991), and an observation model that is a statistical model based on data for the total number of tumour cells over time. In the stochastic system model we derive through stochastic equations the probability distributions of the numbers of different types of tumour cells. Combining with the statistic model, we use these distribution results to develop a generalized Bayesian method and a Gibbs sampling procedure to estimate the unknown parameters and to predict the state variables (number of tumour cells). We apply these models and methods to real data and to computer simulated data to illustrate the usefulness of the models, the methods, and the procedures.


Sign in / Sign up

Export Citation Format

Share Document