Using graph transformation and maude to simulate and verify UML models

Chama, Wafa; Elmansouri, Raida; Chaoui, Allaoua

doi:10.1109/taeece.2013.6557318

Cited by 4 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Automatic mapping for UML-models to a Maude-specification (see [Chama et al, 2013]) is similar to this paper's idea of converting reconfigurable Petri nets. In [Chama et al, 2013] the authors present three steps modeling, analysing and converting to Maude modules.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Converting Reconfigurable Petri Nets to Maude

Schulz¹

2014

Preprint

View full text Add to dashboard Cite

Model checking is an important aim of the theoretical computer science. It enables the verification of a model with a set of properties such as liveness, deadlock or safety. One of the typical modelling techniques are Petri nets they are well understood and can be used for a model checking. Reconfigurable Petri nets are based on a Petri nets with a set of rules. These rules can be used dynamically to change the net.Missing is the possibility to verify a reconfigurable net and properties such as deadlocks or liveness. This paper introduces a conversion from reconfigurable Petri net to Maude, that allows us to fill the gap. It presents a net transformation approach which is based on Maude's equation-and rewrite logic as well as the LTLR model checker.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Further, PNML is used as a well-known markup-language for Petri nets. This process divides all components of a Petri net in special Maude-modules (net, semantic and initial markings) which can be used to verify in a same way as in [Chama et al, 2013].…”

Section: Related Workmentioning

confidence: 99%