Sciweavers

227 search results - page 27 / 46
» P Systems and Finite Automata
Sort
View
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...
ALIFE
2007
13 years 10 months ago
Evolution of Birdsong Syntax by Interjection Communication
Animals use diverse forms of communication, from sound signals to body postures. Recent ethological studies have reported a unique syntactic communication of a songbird, the Bengal...
Kazutoshi Sasahara, Takashi Ikegami
ACSW
2004
13 years 11 months ago
A Framework for Obfuscated Interpretation
Software protection via obscurity is now considered fundamental for securing software systems. This paper proposes a framework for obfuscating the program interpretation instead o...
Akito Monden, Antoine Monsifrot, Clark D. Thombors...
FAC
2008
139views more  FAC 2008»
13 years 10 months ago
Network invariants for real-time systems
We extend the approach of model checking parameterized networks of processes by means of network invariants to the setting of real-time systems. We introduce timed transition stru...
Olga Grinchtein, Martin Leucker
SIGPRO
2008
136views more  SIGPRO 2008»
13 years 9 months ago
Estimation of slowly varying parameters in nonlinear systems via symbolic dynamic filtering
This paper introduces a novel method for real-time estimation of slowly varying parameters in nonlinear dynamical systems. The core concept is built upon the principles of symboli...
Venkatesh Rajagopalan, Subhadeep Chakraborty, Asok...