Towards synthesis of petri nets from scenarios

  • Authors:

  • Robert Lorenz;Gabriel Juhás

  • Affiliations:

  • Lehrstuhl für Angewandte Informatik, Katholische Universität Eichstätt-Ingolstadt, Eichstätt, Germany;Faculty of Electrical Engineering and Information Technology, Slovak University of Technology, Bratislava, Slovakia

  • Venue:
  • ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given a set of scenarios, we answer the question whether this set equals the set of all executions of a Petri net. Formally, scenarios are expressed by (isomorphism classes of) labelled partial orders (LPOs), also known as pomsets or partial words. An LPO is an execution of a Petri net if it is a sequentialization of an LPO generated by a process of the net. We propose a definition of regions for a set of LPOs, i.e for a partial language. Given a partial language of scenarios, we prove a necessary and sufficient condition (based on regions) for the partial language of scenarios to be the partial language of executions of a place/transition Petri net. Finally, we prove our notion of regions to be consistent with the notion of regions of trace languages.