Abstract

Discrete event system specification (DEVS), a formalism for modeling and simulation, has been recently applied to the engineering of CPS, which also makes the necessity of model checking for DEVS arisen. Model-transformation-based approaches were first proposed; timed or linear hybrid automata are obtained from DEVS models, and then verified using model checkers. But, due to the different semantics in state transitions, the transformation often involves manual tasks, such as abstraction and approximation. To eliminate such manual tasks, we have proposed a DEVS subclass that is less expressive, but verifiable. For reachability analysis, its models can be interpreted as transition systems and region automata (RA). Although our DEVS subclass and RA have different semantics with respect to model execution, they are equivalent in terms of reachability analysis. Thus, the reachability could be analyzed based on model checking techniques of timed automata. In many DEVS-based environments, models should be developed by programming languages. To enables the modelers to specify CPS in a visual way, we have proposed a visual modeling language based on our subclass. In our language, the behavior and structure of CPS are graphically specified by basic model diagrams and coupled model diagrams, respectively. Based on our subclass and languages, we have implemented a proof-of-concept environment that supports visual modeling of CPS as well as simulation and reachability analysis of the models. To enable the consideration of the hybrid nature and heterogeneity in CPS, DEVS subclasses, languages, verification techniques and environments will be further investigated.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call