Sciweavers

3229 search results - page 35 / 646
» The Theory of Timed Automata
Sort
View
BMCBI
2004
121views more  BMCBI 2004»
13 years 8 months ago
Asynchronous adaptive time step in quantitative cellular automata modeling
Background: The behaviors of cells in metazoans are context dependent, thus large-scale multicellular modeling is often necessary, for which cellular automata are natural candidat...
Hao Zhu, Peter Y. H. Pang, Yan Sun, Pawan Dhar
ICIAP
1999
ACM
14 years 1 months ago
Cellular Automata Based Optical Flow Computation for "Just-in-Time" Applications
Real-world tasks often require real-time performances. However, in many practical cases, “just in time” responses are sufficient. This means that a system should be efficien...
Giovanni Adorni, Stefano Cagnoni, Monica Mordonini
IFIPTCS
2000
14 years 9 days ago
Real-Time Language Recognition by Alternating Cellular Automata
The capabilities of alternating cellular automata (ACA) to accept formal languages are investigated. Several notions of alternation in cellular automata have been proposed. Here we...
Thomas Buchholz, Andreas Klein, Martin Kutrib
FMSD
2006
140views more  FMSD 2006»
13 years 8 months ago
Dealing with practical limitations of distributed timed model checking for timed automata
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
Víctor A. Braberman, Alfredo Olivero, Ferna...
LATA
2009
Springer
14 years 3 months ago
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
Bruno Courcelle