Toggle Main Menu Toggle Search

Open Access padlockePrints

Process Windows

Lookup NU author(s): Dr Andrey Mokhov, Alessandro De Gennaro

Downloads


Licence

This is the authors' accepted manuscript of a conference proceedings (inc. abstract) that has been published in its final definitive form by IEEE, 2017.

For re-use rights please refer to the publisher's terms and conditions.


Abstract

We describe a method for formally representing the behaviour of complexprocesses by process windows. Each window covers a part of thesystem behaviour, i.e. a part of the underlying transition system, andis easier to understand and analyse than the complete transition system.Process windows can overlap and have shared states and transitions so thatthe complete system behaviour is the union of window behaviours.We demonstrate the advantage of such representations when dealingwith complex system behaviours, and discuss potential applicationsin circuit design and process mining.As a motivational example we consider the problem of coveringtransition systems by marked graphs, or more generally choice-freePetri nets. The obtained windows correspond to choice-free behaviouralscenarios of the system, wherein one window can take over,or wake up, after another window has become inactive. Thecorresponding wake-up conditions and wake-up markingscan be derived automatically.


Publication metadata

Author(s): Mokhov A, Cortadella J, De Gennaro A

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 17th International Conference on Application of Concurrency to System Design

Year of Conference: 2017

Online publication date: 13/11/2017

Acceptance date: 19/03/2017

Date deposited: 20/03/2017

Publisher: IEEE

URL: https://doi.org/10.1109/ACSD.2017.18

DOI: 10.1109/ACSD.2017.18

Library holdings: Search Newcastle University Library for this item

ISBN: 9781538628676


Actions

Link to this publication


Share