888 search results - page 94 / 178 » The Power of Temporal Proofs |
PODC
2009
ACM
15 years 10 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
ASPDAC
2006
ACM
15 years 3 months ago
2006
ACM
— Sakurai-Newton (SN) delay metric [1] is a widely used closed form delay metric for CMOS gates because of simplicity and reasonable accuracy. Nevertheless it can be shown that t...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...
COMBINATORICS
2004
14 years 9 months ago
2004
A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...
ENTCS
2002
14 years 9 months ago
2002
Petri nets where, to my knowledge, the first theoretical model augmented with time constraints [Mer74], and the support of the first reachability algorithm of timed system [BM83, ...