Sciweavers

20126 search results - page 86 / 4026
» Timed Transition Systems
Sort
View
ASM
2004
ASM
15 years 8 months ago
Observations on the Decidability of Transitions
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
Yuri Gurevich, Rostislav Yavorskiy
PODS
2008
ACM
143views Database» more  PODS 2008»
16 years 3 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin
SPIN
2009
Springer
15 years 9 months ago
Automatic Discovery of Transition Symmetry in Multithreaded Programs Using Dynamic Analysis
While symmetry reduction has been established to be an important technique for reducing the search space in model checking, its application in concurrent software verification is ...
Yu Yang, Xiaofang Chen, Ganesh Gopalakrishnan, Cha...
JVCA
2007
132views more  JVCA 2007»
15 years 3 months ago
Interactive and flexible motion transition
In this paper, we present an example-based motion synthesis technique. Users can interactively control the virtual character to perform desired actions in any order. The desired a...
Jen-Yu Peng, I-Chen Lin, Jui-Hsiang Chao, Yan-Ju C...
DM
1999
145views more  DM 1999»
15 years 2 months ago
Modular decomposition and transitive orientation
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
Ross M. McConnell, Jeremy Spinrad