Formalising concurrent UML state machines using coloured Petri nets

DOI10.1007/s00165-016-0388-9zbMath1345.68226OpenAlexW2507213574MaRDI QIDQ315307

Christine Choppy, Étienne André, Mohamed Mahdi Benmoussa

Publication date: 20 September 2016

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-016-0388-9

zbMATH Keywords

modellingformal semanticscoloured Petri netsformalisationstate machines

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Formalising concurrent UML state machines using coloured Petri nets

Uses Software

• Romeo
• TINA
• SPIN
• Uppaal
• PAT
• Papyrus
• MARTE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Formalising concurrent UML state machines using coloured Petri nets
• Automatic verification of a behavioural subset of UML statechart diagrams using the SPIN model-checker
• A comparison of Statecharts step semantics
• Uppaal in a nutshell
• Modular semantics for a UML statechart diagrams kernel and its extension to multicharts and branching time model-checking
• Coloured Petri Nets
• Statecharts, transition structures and transformations

This page was built for publication: Formalising concurrent UML state machines using coloured Petri nets