Transformations between different model forms in discrete event systems

Rausch, Mathias; Krogh, Bruce H.

doi:10.1109/icsmc.1997.635396

Cited by 6 publications

(4 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…First, it can support the communication of a Petri net design to designer and end-users only familiar with statecharts. In particular, it can facilitate the automated exchange of models [Gra97,GK07,RK97] between different Petri net and statechart tools, thus enabling designers to use both Petri net and statechart tools for their designs.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Statechartable Petri nets

Eshuis

2013

Form. Asp. Comput.

View full text Add to dashboard Cite

Abstract. Petri nets and statecharts can model concurrent systems in a succinct way. While translations from statecharts to Petri nets exist, a well-defined translation from Petri nets to statecharts is lacking. Such a translation should map an input net to a corresponding statechart, having a structure and behaviour similar to that of the input net. Since statecharts can only model a restricted form of concurrency, not every Petri net has a corresponding statechart. We identify a class of Petri nets, called statechartable nets, that can be translated to corresponding statecharts. Statechartable Petri nets are structurally defined using the novel notion of an area. We also define a structural translation that maps each statechartable Petri net to a corresponding statechart. The translation is proven sound and complete for statechartable Petri nets.

show abstract

Section: Resultsmentioning

confidence: 99%

“…Only a few papers consider translations from Petri nets to statecharts [RK97,SNK99]. The only published work with a considerable amount of detail is a paper by Schnabel et al [SNK99], who informally describe an interactive method to translate a safe Petri net into a StateFlow statechart [Mat].…”

Section: Related Workmentioning

confidence: 99%

Statechartable Petri nets

Eshuis

2013

Form. Asp. Comput.

View full text Add to dashboard Cite

show abstract

“…Diese Eigenschaft wird als Zustandskonformität bezeichnet. In [14] wurde ein Einblick in die Transformation zwischen Net-Condition/ Event-Systemen (NCES), Sprachen für Programmable Logic Controller und Statecharts gegeben. Dort wird allerdings bei der Konvertierung sicherer NCES keine Zustandskonformität gefordert, sondern vorgeschlagen, für Teilnetze, die nicht in einfacher Weise direkt konvertiert werden können, den Erreichbarkeitsgraphen zu ermitteln und diesen in den Statechart zu integrieren.…”

unclassified

Konvertierung sicherer Petri-Netze in Statecharts/ Conversion of safe Petri nets into Statecharts

Krebs¹,

Nenninger²,

Schnabel³

1999

At - Automatisierungstechnik

View full text Add to dashboard Cite

Zur Modellierung ereignisdiskreter Systeme existieren verschiedene Modellformen. In der Steuerungstechnik haben sich vor allem Petri-Netze und Automaten verbreitet, wobei sich Petri-Netze bei der Beschreibung von Nebenläufigkeiten aufgrund hoher Transparenz und relativ geringer struktureller Komplexität als besonders zweckmäßig erweisen. Um den Schwierigkeiten bei der Darstellung von parallelen Abläufen mit Automaten zu begegnen, wurden Statecharts entwickelt, eine Modellform, die auf der hierarchischen Anordnung von Automatengraphen basiert. Das Interesse an Statecharts verstärkte sich in jüngster Zeit durch die Marktverfügbarkeit der Matlab-Toolbox Stateflow. Sie ermöglicht die Einbindung ereignisdiskreter Teilsysteme in Form von Statecharts in die Simulationsumgebung Matlab/Simulink und damit insgesamt die Simulation hybrider Systeme. Um den Anwendern von Petri-Netzen die Verwendung der oben genannten Standard-Simulationsumgebung nahezubringen, wird in diesem Beitrag gezeigt, wie sichere Stellen/Transitionen-Netze in Statecharts überführt werden können. Hierzu wird eine Methodik angegeben, die auf der Auswertung der S-Invarianten des zugrundeliegenden Petri-Netzes basiert.There exist various formalisms for discrete event system modeling. In control engineering, particularly Petri nets and automata are widespread. Due to high transparency and relatively low structural complexity Petri nets prove to be especially functional for the representation of concurrency. In order to counteract the difficulties of the representation of concurrency by automata, Statecharts were developed, a modeling formalism which is based on the hierarchical arrangement of State transition diagrams. Recently, the interest in Statecharts has intensified owing to the release of the Matlab toolbox Stateflow. It enables the Integration of discrete event subsystems modeied as Statecharts in the Simulation environment Matlab/Simulink and in turn the Simulation of hybrid systems. To encourage Petri net users to the application of this Standard Simulation environment, in this contribution it is shown how safe place/transition nets can be converted into Statecharts. For this, a methodology is presented that is based on the place invariants of the Petri net under investigation.1 Einleitung Zur Beschreibung ereignisdiskreter Systeme existieren verschiedene Modellformen, wobei in der Steuerungstechnik Automaten [1], Petri-Netze [2; 3] und Statecharts [4; 5] am weitesten verbreitet sind. Häufig besteht die Aufgabe, Systeme zu modellieren, die aus mehreren partiell synchronisierten Teilsystemen bestehen, wozu für Automaten verschiedene Synchronisationsmechanismen [6] existieren, die allerdings graphisch nicht abgebildet werden können. Vielmehr ist für das Gesamtsystem aus den synchronisierten Automaten ein Gesamtautomat zu erstellen. Der zugehörige Automatengraph ist allerdings bezüglich der nachzubildenden Nebenläufigkeiten wenig transparent und at -Automatisierungstechnik 47 (1999) 12 © Oldenbourg Verlag nimmt schnell an struktureller Komplexität zu...

show abstract

“…Such formal translations enable the automated exchange of models between different tools [8,9,21]. For instance, a designer can first use a Petri net tool to analyse functional properties of a net design, next use an automated translation to transform the net into a statechart, and then use a statechart tool to generate software code.…”

Section: Introductionmentioning

confidence: 99%

Translating Safe Petri Nets to Statecharts in a Structure-Preserving Way

Eshuis

2009

FM 2009: Formal Methods

View full text Add to dashboard Cite

Abstract. Statecharts and Petri nets are two popular visual formalisms for modelling complex systems that exhibit concurrency. Both formalisms are supported by various design tools. To enable the automated exchange of models between Petri net and statechart tools, we present a structural, polynomial algorithm that translates safe Petri nets into statecharts. The translation algorithm preserves both the structure and the behaviour of the input net. The algorithm can fail, since not every safe net has a statechart translation that preserves both its structure and behaviour. The algorithm is proven correct and the class of safe nets for which the algorithm succeeds is formally characterised. We show that the algorithm can also fail for some nets that do have a structure-and behaviour-preserving statechart translation, but this incompleteness does not appear to be a severe limitation in practice.

show abstract

Transformations between different model forms in discrete event systems

Cited by 6 publications

References 5 publications

Statechartable Petri nets

Statechartable Petri nets

Konvertierung sicherer Petri-Netze in Statecharts/ Conversion of safe Petri nets into Statecharts

Translating Safe Petri Nets to Statecharts in a Structure-Preserving Way

Contact Info

Product

Resources

About