Visual-trace simulation of concurrent finite-state machines for validation and model-checking of complex behaviour

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Simulation of models that specify behaviour of software in robots, embedded systems, and safety critical systems is crucial to ensure correctness. This is particularly important in conjunction with model-driven development, which is highly prevalent due to its numerous benefits. We use vectors of finite-state machines (FSMs) as our modelling tool. Our FSMs can have their transitions labeled by expressions of a common sense logic, and they are more expressive than other modelling approaches (such as Behavior Trees, Petri nets, or plain FSMs). We interpret the models using the same round-robin scheduler which is integrated into the simulator. Execution on a platform is exactly the same as in the simulator (where sensors and actuators are masqueraded by proxies) and coincides with the generator of the Kripke structure for formal model-checking. In three ubiquitous case studies we show that our simulation discovers issues where those models were incomplete, ambiguous, or incorrect. This further illustrates that simulation and monitoring need to complement formal verification. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Coleman, R., Estivill-Castro, V., Hexel, R., & Lusty, C. (2012). Visual-trace simulation of concurrent finite-state machines for validation and model-checking of complex behaviour. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7628 LNAI, pp. 52–64). https://doi.org/10.1007/978-3-642-34327-8_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free