Toggle Main Menu Toggle Search

Open Access padlockePrints

Verification of Conditional Partial Order Graphs

Lookup NU author(s): Dr Andrey Mokhov, Professor Alex Yakovlev


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


The Conditional Partial Order Graph (CPOG) Model introduced recently is a novel technique for specification and synthesis of asynchronous controllers. It combines advantages of both Petri nets and FSM-based approaches and is capable of modelling systems with a high degree of concurrency and multiple choice. The paper extends the basic model of CPOGs to handle dynamic evaluation of internal control signals and introduces behavioural semantics for CPOGs. The extended model has a strong need for verification support, e.g. reachability analysis, deadlock detection etc. and this paper presents SAT-based characterisations for the most important CPOG verification problems.

Publication metadata

Author(s): Mokhov A, Yakovlev A

Editor(s): Billington, J; Duan, Z; Koutny, M

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: Application of Concurrency to System Design (ACSD'08)

Year of Conference: 2008

Pages: 128-137

ISSN: 1550-4808

Publisher: IEEE


DOI: 10.1109/ACSD.2008.4574604

Library holdings: Search Newcastle University Library for this item

ISBN: 9781424418381