Semantics of petri nets: A comparison

Juhas,; Lehocki, Fedor

doi:10.1109/wsc.2007.4419655

Search citation statements

Order By: Relevance

Paper Sections

Select...

Reconfigurable Petri Nets1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

2023

Publication Types

Select...

Other2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, post holds all information of the post-conditions for all transitions. Finally, M 0 shows all initial tokens on the places for this net N [Meseguer a. Montanari, 1990;Juhas et al, 2007].…”

Section: Reconfigurable Petri Netsmentioning

confidence: 99%

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: Reconfigurable Petri Netsmentioning

confidence: 99%