Toggle Main Menu Toggle Search

Open Access padlockePrints

Complexity of Checking Output-Determinacy in General Petri Nets

Lookup NU author(s): Dr Victor Khomenko

Downloads


Licence

This is the final published version of a book chapter that has been published in its final definitive form by Newcastle University, 2018.

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


Abstract

Output-determinacy is an important soundness notion in the theory of non-deterministic asynchronous concurrent systems whose alphabet is partitioned into input and output actions. Intuitively, it postulates that the set of enabled outputs of a system must be fully determined by the visible history of its interactions with the environment, as otherwise the specification is contradictory in the sense that it simultaneously requires and forbids some output.In the case of safe or k-bounded Petri nets checking output-determinacy was known to be PSPACE-complete, but the complexity (and even decidability) of this problem for general Petri nets was open. In this paperwe show that the problem of checking whether output-determinacy is violated is decidable and equivalent to reachability in general Petri nets.


Publication metadata

Author(s): Jancar P, Khomenko V

Editor(s): Khomenko,V;

Publication type: Book Chapter

Publication status: Published

Book Title: Harnessed Causality: Essays Dedicated to Maciej Koutny on the Occasion of His 60th Birthday

Year: 2018

Pages: 73-83

Print publication date: 03/09/2018

Acceptance date: 03/09/2018

Publisher: Newcastle University

Library holdings: Search Newcastle University Library for this item

ISBN: 9780701702663


Actions

Link to this publication


Share