A polynomial-time algorithm for checking consistency of free-choice signal transition graphs

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

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

I would like to thank my supervisor Prof. Javier Esparza for his support and constant advices. The comments and encouragements given by him were invaluable to the completion of this thesis. I also want to recognize the kind support received from Dipl.Inf. Claus Schröter and Dipl.Inf. Alin Stefanescu. Many thanks to the staff members of FMI for the amiable environment of work. Finally I thank my parents and brother for their constant support and love. Without them I would not have reached this point in my life. This work is dedicated to them. 2 Table of contents

Free-choice Signal Transition Graphs (STG) are a class of interpreted Petri nets with applications to the verification and synthesis of speed-independet circuits. Several synthesis techniques for free-choice STGs have been proposed which require to know the concurrency relation of the net, i

In this paper, we showhow a decomposition of a free choice Petri net into a #routing" network and marked graph subnetworks #i.e. linear subnetworks in the #max; +# setting# leads to new methods and algorithms to test structural as well as temporal properties of the net. Although several

that checking consistency is polynomial, but checking the existence of a complete state coding is co-NP-complete. In fact, co-NP-completeness already holds for acyclic and 1-bounded marked graph STGs and for live and 1-bounded marked graph STGs. We add some relevant results for free-choice, bounded, and general

: In this paper, we show how a decomposition of a free choice Petri net into a "routing" network and marked graph subnetworks (i.e. linear subnetworks in the [max; +] setting) leads to new methods and algorithms to test structural as well as temporal properties of the net. Although

-- not containing circuit hazards under given timing constraints -- can be found by using the relations between signal transitions of the specification. Moreover, the relations can be efficiently found using a heuristic timing analysis algorithm. By allowing significantly larger designs to be synthesized, this work

This paper defines conditions for a Signal Transition Graph to be implemented by an asynchronous circuit. A hierarchy of the implementability classes is presented. Our main concern is the implementability of the specification under the restricted input-output interface between the design