3600 search results - page 58 / 720 » The settling-time reducibility ordering |
186
click to vote
FORMATS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We describe a partial order reduction technique for a realtime component model. Components are described as timed automata with data ports, which can be composed in stati...
159
click to vote
ACL
1993
15 years 7 months ago
1993
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...
149
click to vote
ICCAD
2005
IEEE
16 years 2 months ago
2005
IEEE
In this paper we propose a novel parameterized interconnect order reduction algorithm, CORE, to efficiently capture both inter-die and intra-die variations. CORE applies a two-ste...
136
click to vote
ICCAD
2002
IEEE
16 years 2 months ago
2002
IEEE
- The new concept of Multi-node Moment Matching (MMM) is introduced in this paper. The MMM technique simultaneously matches the moments at several nodes of a circuit using explicit...
225
click to vote
CONCUR
2009
Springer
16 years 16 days ago
2009
Springer
Abstract. The technique of partial order reduction (POR) for probabilistic model checking prunes the state space of the model so that a maximizing scheduler and a minimizing one pe...