Can i execute my scenario in your net?

  • Authors:

  • Gabriel Juhás;Robert Lorenz;Jörg Desel

  • Affiliations:

  • Lehrstuhl für Angewandte Informatik, Katholische Universität Eichstätt, Eichstätt, Germany;Lehrstuhl für Angewandte Informatik, Katholische Universität Eichstätt, Eichstätt, Germany;Lehrstuhl für Angewandte Informatik, Katholische Universität Eichstätt, Eichstätt, Germany

  • Venue:
  • ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present a polynomial algorithm to decide whether a scenario (given as a Labelled Partial Order) is executable in a given place/transition Petri net while preserving at least the given amount of concurrency (adding no causality). In the positive case the algorithm computes a process net that respects the concurrency formulated by the scenario. We moreover present a polynomial algorithm to decide whether the amount of concurrency given by a Labelled Partial Order is maximal, i.e. whether the Labelled Partial Order precisely matches a process net w.r.t. causality and concurrency of the events, if this process net represents a minimal causality of events among all process nets.