177 search results - page 32 / 36 » Logical complexity of graphs: a survey |
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
PEPM
2004
ACM
14 years 1 months ago
2004
ACM
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...
SAMOS
2004
Springer
14 years 1 months ago
2004
Springer
A high-performance data-path to implement DSP kernels is proposed in this paper. The data-path is based on a flexible, universal, and regular component to optimally exploiting both...
VR
1993
IEEE
13 years 11 months ago
1993
IEEE
Existing network management systems typically use a combination of textual displays and 2D directed graph representations of network topology. We are designing a network managemen...
ATVA
2004
Springer
13 years 11 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...