Toggle Main Menu Toggle Search

ePrints

Using Optimal Simulations to Reduce Reachability Graphs

Lookup NU author(s): Professor Maciej Koutny

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


Abstract

We here discuss an approach which uses the optimal simulation — a kind of reachability relation — to enable reasoning about important dynamic properties of a concurrent system. The optimal simulation usually involves only a very small subset of the possible behaviours generated by the system, yet provides a sufficient information to reason about a number of interesting system's properties (such as deadlock-freeness and liveness). In this paper we show how the optimal simulation might be used to generate a reachability graph which is usually much smaller than the standard reachability graph of the system; however, both graphs essentially convey the same information about its dynamic behaviour.


Publication metadata

Author(s): Janicki R, Koutny M

Editor(s): Clarke, E.M., Kurshan, R.P.

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 2nd International Workshop on Computer Aided Verification (CAV)

Year of Conference: 1991

Pages: 166-175

ISSN: 0302-9743 (Print) 1611-3349 (Online)

Publisher: Springer-Verlag

URL: http://dx.doi.org/10.1007/BFb0023730

DOI: 10.1007/BFb0023730

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computing Science

ISBN: 9783540544777


Actions

Link to this publication


Share