Petri nets: an introduction
A generalized state assignment theory for transformations on signal transition graphs
ICCAD '92 1992 IEEE/ACM international conference proceedings on Computer-aided design
Solving the state assignment problem for signal transition graphs
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Reduction and synthesis of live and bounded free choice Petri nets
Information and Computation
Free choice Petri nets
Properties of Conflict-Free and Persistent Petri Nets
Journal of the ACM (JACM)
Signal Graphs: From Self-Timed to Timed Ones
International Workshop on Timed Petri Nets
Decidability and Complexity of Petri Net Problems - An Introduction
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Concurrency Relations and the Safety Problem for Petri Nets
Proceedings of the 13th International Conference on Application and Theory of Petri Nets
A structural encoding technique for the synthesis of asynchronous circuits
ACSD '01 Proceedings of the Second International Conference on Application of Concurrency to System Design
Checking signal transition graph implementability by symbolic BDD traversal
EDTC '95 Proceedings of the 1995 European conference on Design and Test
On the models for designing VLSI asynchronous digital systems
Integration, the VLSI Journal
Structural methods for the synthesis of speed-independent circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Optimized synthesis of asynchronous control circuits from graph-theoretic specifications
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
On Compositionality of Boundedness and Liveness for Nested Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
Hi-index | 0.00 |
Signal Transition Graphs (STGs) are one of the most popular models for the specification of asynchronous circuits. A STG can be implemented if it admits a so-called consistent and complete binary encoding. Deciding this is EXPSPACE-hard for arbitrary STGs, and so a lot of attention has been devoted to the subclass of free-choice STGs, which offers a good compromise between expressive power and analizability. In the last years, polynomial time synthesis techniques have been developed for free-choice STGs, but they assume that the STG has a consistent binary encoding. This paper presents the first polynomial algorithm for checking consistency.