Verlagslink DOI: | 10.14279/tuj.eceasst.51.775.770 10.14279/tuj.eceasst.51.775 |
Titel: | Abstract Interleaving Semantics for Reconfigurable Petri Nets | Sprache: | Englisch | Autorenschaft: | Padberg, Julia | Herausgeber*In: | Padberg, Julia Hoffmann, Kathrin |
Schlagwörter: | interleaving semantics; reconfigurable place/transition nets; net transformation | Erscheinungsdatum: | 1-Jan-2012 | Verlag: | European Association of Software Science and Technology | Zeitschrift oder Schriftenreihe: | Electronic communications of the EASST | Zeitschriftenband: | 51 | Konferenz: | International Workshop on Petri Nets, Graph Transformation and other Concurrency Formalisms 2012 | Zusammenfassung: | Reconfigurable Petri nets are Petri nets together with rules for the dynamic change of the nets. We employ them for the formal modeling in the context of the Living Place Hamburg, a smart home that is an urban apartment serving as a laboratory for investigating different areas of ambient intelligence. The interaction of the resident and the smart home is modeled using informal descriptions of scenarios. These scenarios provide the resident's procedures together with the smart home's support. A case study using reconfigurable Petri nets for modeling these scenarios has required extensions of the theory and has clearly shown the need for an interleaving semantics for reconfigurable Petri nets. Scenarios are then given by nets, namely decorated place/transition nets that can be adapted to the evolving subgoals by applying rules that change the nets and hence the behavior of the smart home. Decorated place/transition nets are annotated place/transition nets with additional transition labels that may change when the transition is fired. To obtain such reconfigurable Petri nets we prove that decorated place/transition nets give rise to an M-adhesive HLR category. The abstract interleaving semantics we introduce is a graph with nodes that consist of an isomorphism class of the net structure and an isomorphism class of the current marking. Arcs between these nodes represent computation steps being either a transition firing or a direct transformation. |
URI: | http://hdl.handle.net/20.500.12738/1535 | ISSN: | 1863-2122 | Begutachtungsstatus: | Diese Version hat ein Peer-Review-Verfahren durchlaufen (Peer Review) | Einrichtung: | Department Informatik Fakultät Technik und Informatik |
Dokumenttyp: | Zeitschriftenbeitrag |
Enthalten in den Sammlungen: | Publications without full text |
Zur Langanzeige
Volltext ergänzen
Feedback zu diesem Datensatz
Export
Diese Ressource wurde unter folgender Copyright-Bestimmung veröffentlicht: Lizenz von Creative Commons