Results 1 - 10
of
254
A Polynomial-Time Algorithm for Checking Consistency of FreeChoice Signal Transition Graphs
- Fundam. Inform
"... A polynomial-time algorithm for checking consistency of free-choice signal transition graphs ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
A polynomial-time algorithm for checking consistency of free-choice signal transition graphs
A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs
"... 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. Checking this is EXPSPACE-hard for arbitrary STGs, and so a lot of attention has been devoted ..."
Abstract
- Add to MetaCart
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
IOS Press A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs
"... Abstract. 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 bee ..."
Abstract
- Add to MetaCart
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
Implementation of a Consistency Test for Free-Choice Signal Transition Graphs
, 2004
"... 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 ..."
Abstract
- Add to MetaCart
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
A Polynomial Algorithm to Compute the Concurrency Relation of Free-choice Signal Transition Graphs
- In Proc. of the International Workshop on Discrete Event Systems (WODES
, 1995
"... 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.e., the ..."
Abstract
-
Cited by 17 (2 self)
- Add to MetaCart
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
Structural, Temporal And Stochastic Properties Of Unbounded Free-Choice Petri Nets
- INRIA, Sophia Antipolis
, 1994
"... 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 results ..."
Abstract
-
Cited by 8 (1 self)
- Add to MetaCart
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
On the complexity of consistency and complete state coding for signal transition graphs
- In Proceedings of the 6th International Conference on Application of Concurrency to System Design (ACSD 2006
, 2006
"... Signal Transition Graphs (STGs) are a popular formalism for the specification of asynchronous circuits. A necessary condition for the implementability of an STG is the existence of a consistent and complete state encoding. For an important subclass of STGs, the marked graph STGs, we show that checki ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
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
Structural, temporal and stochastic properties of unbounded free-choice Petri nets
, 1994
"... : 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 several ..."
Abstract
- Add to MetaCart
: 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
Direct Synthesis of Timed Circuits from Free-Choice STGs
, 2001
"... This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a graph specification with timing constraints. A timing analysis extracts the timed concurrency and timed causality relatio ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
-- 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
Checking Signal Transition Graph Implementability by Symbolic BDD Traversal
, 1995
"... 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 and the env ..."
Abstract
-
Cited by 20 (13 self)
- Add to MetaCart
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
Results 1 - 10
of
254