Abstract
Advanced mechatronic systems, like smart cars or smart trains, perform reconfiguration as a reaction to their changing environment. The reconfiguration behaviour of such systems is safety-critical and needs to be verified by formal verification procedures. In the past, graph transformation systems have proven to be a suitable formalism for specification and verification of such systems. However, existing approaches do not consider that reconfiguration operations consume time. Considering their duration, several reconfiguration operations can be executed concurrently in a running system, possibly resulting in undesired behaviour. In this paper, we introduce durations for graph transformation rules and a locking mechanism that ensures the safe concurrent execution of time-consuming operations. Additionally, we show how graph transformation rules with durations are mapped to an existing verification framework which enables the formal verification of graph transformation systems with durative rules. We illustrate our approach using an example of a smart train system.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
