: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
We propose that the behaviour of non-linear media can be controlled automatically through coevolutionary systems. By extension, forms of unconventional computing, i.e., massively ...
Christopher Stone, Rita Toth, Andrew Adamatzky, Be...
The evaluation of successor or predecessor state spaces through time progress is a central component in the model-checking algorithm of dense-time automata. The definition of the t...
Efficient matching of incoming events to persistent queries is fundamental to event pattern matching, complex event processing, and publish/subscribe systems. Recent processing e...
Lars Brenna, Johannes Gehrke, Mingsheng Hong, Dag ...
Timed I/O Automata (TIOA) is a mathematical framework for modeling and verification of distributed systems that involve discrete and continuous dynamics. TIOA can be used for exa...
Myla Archer, Hongping Lim, Nancy A. Lynch, Sayan M...