In: Theory and Application of Graph Transformations: 6th International Workshop, TAGT 98, Paderborn, Germany, November 16-20, 1998., pages 85-102. Volume 1764 of Lecture Notes in Computer Science / Hartmut Ehrig, Gregor Engels, Hans-Jörg Kreowski and Grzegorz Rozenberg (Eds.) --- Springer-Verlag, November 1998.
Abstract: Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is the ability to express this kind of interaction. Classical rule-based approaches like Petri nets and graph transformation are not suited for this purpose because they assume to have complete control about the state and its transformation. Therefore, in this paper we propose a general framework which extends a given rule-based approach by a loose semantics where the rules of the system (e.g., graph productions or Petri net transitions) are considered as incomplete descriptions of the transformations to be performed: they still determine the changes to the matched substructure but for the remaining part (the context) unspecified changes are possible representing the application of (unknown) rules from the environment. The framework is applied to graph transformation systems in the double-pushout approach as well as place-transition Petri nets leading, respectively, to the concepts of graph transition and open step.
Back to the Petri Nets Bibliography