Toggle Main Menu Toggle Search

Open Access padlockePrints

The Newcastle University research output collection, currently available on ePrints, will shortly be moving to a new open repository platform, Figshare. To prepare for the data migration we have paused adding new content to ePrints, and will resume once the new repository is launched. During this time you will continue to have access to ePrints (but no new content will appear). We will share updates here when available.

Net Implementation of Optimal Simulations

Lookup NU author(s): Emeritus Professor Maciej KoutnyORCiD

Downloads

Abstract

We here discuss optimal simulations which provide the designer of a concurrent system with a sound and efficient verification technoque enabling reasoning about important dynamic properties of the system. The optimal simulation, involving only a subset of the possible behaviours generated by the system, provides sufficient infornmation to reason about a number of interesting systems properties (such as deadlock-freeness and liveness), and requires a minimal computational effort. In this paper we consider the implementation aspects of the optimal simulation. Our main contribution is an algorithm generating a reachability grapph of the optimal simulation for the class of systems which can be adequately modelled by petri nets composed of finite state machines. Such a reachability graph is usually much smaller than the standard rechability graph of the net, yet both graphs essentially convey the same information about the system's behaviour.

Publication metadata

Author(s): Janicki R, Koutny M

Publication type: Report

Publication status: Published

Series Title: Computing Laboratory Technical Report Series

Year: 1990

Pages: 26

Report Number: 312

Institution: Computing Laboratory, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne

URL: http://www.cs.ncl.ac.uk/publications/trs/papers/312.pdf

Share