Sciweavers

898 search results - page 11 / 180
» Transitions of the Pre-Symmetry Set
Sort
View
CONCUR
1998
Springer
13 years 11 months ago
Alternating Refinement Relations
Alternating transition systems are a general model for composite systems which allow the study of collaborative as well as adversarial relationships between individual system compo...
Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, ...
VMCAI
2007
Springer
14 years 1 months ago
Better Under-Approximation of Programs by Hiding Variables
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
Thomas Ball, Orna Kupferman
LPNMR
1999
Springer
13 years 11 months ago
Representing Transition Systems by Logic Programs
This paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action langua...
Vladimir Lifschitz, Hudson Turner
GLVLSI
2007
IEEE
111views VLSI» more  GLVLSI 2007»
14 years 1 months ago
Probabilistic gate-level power estimation using a novel waveform set method
A probabilistic power estimation technique for combinational circuits is presented. A novel set of simple waveforms is the kernel of this technique. The transition density of each...
Saeeid Tahmasbi Oskuii, Per Gunnar Kjeldsberg, Ein...
JCT
2008
71views more  JCT 2008»
13 years 7 months ago
Primitive decompositions of Johnson graphs
A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all t...
Alice Devillers, Michael Giudici, Cai Heng Li, Che...