




Publications  A Polynomial Algorithm to Compute the Concurrency Relation of FreeChoice Signal Transition Graphs





Reference:
A. Kovalyov and J. Esparza. A polynomial algorithm to compute the concurrency relation of freechoice signal transition graphs. In Prof. of the International Workshop on Discrete Event Systems, WODES'96, pages 1–6, Edinburgh, 1996. The Institution of Electrical Engineers.
Abstract:
The concurrency relation of a Petri net contains the pairs of transitions that can be concurrently enabled. We present a polynomial algorithm to compute the concurrency relation of freechoice Signal Transition Graphs, a class of Petri nets with applications to the verification and synthesis of speedindependent circuits.
Suggested BibTeX entry:
@inproceedings{KE96,
address = {Edinburgh},
author = {A. Kovalyov and J. Esparza},
booktitle = {Prof. of the International Workshop on Discrete Event Systems, WODES'96},
organization = {The Institution of Electrical Engineers},
pages = {16},
title = {A Polynomial Algorithm to Compute the Concurrency Relation of FreeChoice Signal Transition Graphs},
year = {1996}
}




