5100 search results - page 412 / 1020 » The Linear Complexity of a Graph |
192
click to vote
TVLSI
2002
15 years 7 months ago
2002
In this paper, we deal with arbitrarily shaped rectilinear module placement using the transitive closure graph (TCG) representation. The geometric meanings of modules are transpare...
189
Voted
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (contPN). Specifically, we consider two problems: (1) given an initial set o...
193
click to vote
JSYML
2007
15 years 7 months ago
2007
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...
219
click to vote
TII
2010
15 years 2 months ago
2010
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (ContPNs). Specifically, we consider two problems: (1) given an initial set ...
182
click to vote
IV
2003
IEEE
16 years 27 days ago
2003
IEEE
In this paper we present a “lightweight” visual formalism that can be used to examine the state space complexity of an interface. The method can form a basis for designing, te...