User: Guest  Login
Title:

A Polynomial Algorithm to Compute the Concurrency Relation of Free-Choice Signal Transition Graphs

Document type:
Technical Report
Author(s):
A. Kovalyov; J. Esparza
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 free-choice Signal Transition Graphs, a class of Petri nets with applications to the verification and synthesis of speed-independent circuits.
Keywords:
Petri net; free-choice Signal Transition Graphs; speed-independent circuits
Year:
1995
Year / month:
1995-12-11 00:00:00
Pages:
25
 BibTeX