Sciweavers

180 search results - page 9 / 36
» Self-Assembly of Infinite Structures
Sort
View
CONCUR
2007
Springer
14 years 1 months ago
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
Abstract. We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) i...
Rohit Chadha, Mahesh Viswanathan
NJC
2000
99views more  NJC 2000»
13 years 9 months ago
An Incremental Unique Representation for Regular Trees
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
LICS
1997
IEEE
14 years 1 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
CGIM
2003
13 years 11 months ago
Modeling an Infinite Emotion Space for Expressionistic Cartoon Face Animation
Inspired by traditional expressive animation, we attempt to propose an infinite emotion-space as a model to control free-form facial expression synthesis. Although a number of mod...
Prashant Chopra, Joerg Meyer
CADE
2007
Springer
14 years 10 months ago
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...