Lookup NU author(s): Professor Maciej Koutny,
Dr Marta Koutny,
Professor Alex Yakovlev
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
The unconstrained step semantics of Petri nets is impractical for simulating and modelling applications. In the past, this inadequacy has been alleviated by introducing various flavours of maximally concurrent semantics, as well as priority orders. In this paper, we introduce a general way of controlling step semantics of Petri nets through step firing policies that restrict the concurrent behaviour of Petri nets and so improve their execution and modelling features. In a nutshell, a step firing policy disables at each marking a subset of enabled steps which could otherwise be executed. We discuss various examples of step firing policies and then investigate the synthesis problem for Petri nets controlled by such policies. Using generalised regions of step transition systems, we provide an axiomatic characterisation of those transition systems which can be realised as reachability graphs of Petri nets controlled by a given step firing policy. We also provide a decision and synthesis algorithm for PT-nets and step firing policies based on linear rewards of steps, where fixing the reward of elementary transitions is part of the synthesis problem. The simplicity of the algorithm supports our claim that the proposed approach is practical.
Author(s): Darondeau P, Koutny M, Pietkiewicz-Koutny M, Yakovlev A
Editor(s): van Hee, K.M., Valk, R.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: Applications and Theory of Petri Nets: 29th International Conference
Year of Conference: 2008
ISSN: 0302-9743 (Print) 1611-3349 (Online)
Notes: Best Paper Award
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science