343 search results - page 18 / 69 » On Making Directed Graphs Transitive |
100
Voted
MFCS
1997
Springer
15 years 6 months ago
1997
Springer
The aim of this paper is an integration of graph grammars with different kinds of behavioural constraints, in particular with temporal logic constraints. Since the usual algebraic ...
122
click to vote
ACSD
2005
IEEE
15 years 7 months ago
2005
IEEE
Signal Transition Graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a...
108
click to vote
TCAD
2008
15 years 1 months ago
2008
State encoding is one of the most difficult problems in the synthesis of asynchronous controllers. This paper presents a method that can solve the problem of large controllers spec...
108
Voted
HCW
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper describes a simulation tool for the analysis of complex jobs described in the form of task graphs. The simulation procedure relies on the PN-based topological represent...
98
Voted
DM
2008
15 years 1 months ago
2008
A homogeneous factorisation of a digraph consists of a partition P = {P1, . . . , Pk} of the arc set A and two vertex-transitive subgroups M G Aut() such that M fixes each Pi set...