Lookup NU author(s): Professor Maciej Koutny,
Dr Lukasz Mikulski,
Dr Marta Koutny
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
A concurrent system is persistent if throughout its operation no activity which became enabled can subsequently be prevented from being executed by any other activity. This is often a highly desirable (or even necessary) property; in particular, if the system is to be implemented in hardware. Over the past 40 years, persistence has been investigated and applied in practical implementations assuming that each activity is a single atomic action which can be represented, for example, by a single transition of a Petri net. Recently, it turned out that to deal with the synthesis of GALS systems one also needs to consider activities represented by steps, each step being a set of simultaneously executed transitions. Moving into the realm of step based execution, semantics creates a wealth of new fundamental problems and questions. In particular, there are different ways in which the standard notion of persistence could be lifted from the level of sequential semantics to the level of step semantics. Moreover, one may consider steps which are persistent and cannot be disabled by other steps, as well as steps which are nonviolent and cannot disable other steps. In this paper, we provide a classification of different types of persistence and nonviolence, both for steps and markings of pt-nets. We also investigate behavioural and structural properties of such notions.
Author(s): Koutny M, Mikulski L, Pietkiewicz-Koutny M
Editor(s): Jose Manuel Colom and Joerg Desel
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: Application and Theory of Petri Nets and Concurrency - 34th International Conference, PETRI NETS 2013
Year of Conference: 2013
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science