Results 91 to 100 of about 63,385 (219)
Compositional detection of Zeno behavior in Timed Automata with Deadlines [PDF]
, 2009 We present a compositional analysis to detect Zeno behavior in Timed Automata with Deadlines. A syntactic analysis is defined, based on Tripakis' strong non-Zenoness property, which identifies all elementary cycles where Zeno behavior may occur.
Gomez, Rodolfo
core
CoRR, 2015 This is a reissue of the book Tree Automata by F. Gécseg and M. Steinby originally published in 1984 by Akadémiai Kiadó, Budapest. Some mistakes have been corrected and a few obscure passages have been clarified. Moreover, some more recent contributions and current lines of research are reviewed in an appendix that also contains several new references.
Ferenc Gécseg, Magnus Steinby
openaire +2 more sources
Non-blocking supervisory control for initialised rectangular automata
, 2004 We consider the problem of supervisory control for a class of rectangular automata and more specifically for compact rectangular automata with uniform rectangular activity, i.e. initialised.
Spathopoulos, M.P. +1 more
core
Journal of Computer and System Sciences, 1987 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jürgen Dassow, Helmut Jürgensen
openaire +2 more sources
Verification of Timed Automata with Deadlines in Uppaal [PDF]
, 2008 Timed Automata with Deadlines (TAD) is a notation to model concurrent real-time systems that has a number of advantages over mainstream Timed Automata (TA). The semantics of deadlines and synchronisation rule out the most common form of timelocks, making
Gomez, Rodolfo
core
Pseudorandom number generation based on controllable cellular automata
, 2004 A novel Cellular Automata (CA) Controllable CA (CCA) is proposed in this paper. Further, CCA are applied in Pseudorandom Number Generation. Randomness test results on CCA Pseudorandom Number Generators (PRNGs) show that they are better than 1-d CA PRNGs
Zhang, S. +3 more
core +1 more source
Group and total dissipativity and stability of multi-equilibria hybrid automata [PDF]
, 2013 Complex systems, which consist of different interdependent and interlocking subsystems, typically have multiple equilibrium points associated with different set points of each operation mode.
Navarro-López, Eva M. +7 more
core +1 more source
International Journal of Mathematics and Mathematical Sciences, 1986 A topology on the state set of an automaton is considered and it is shown that under this topology, genetically closed subsets and primaries, in the sense of Bavel [1] turn out to be precisely the regular closed subsets and minimal regular closed subsets
Arun K. Srivastava, Wagish Shukla
doaj +1 more source
Pseudorandom number generation with self programmable cellular automata
, 2004 In this paper, we propose a new class of cellular automata – self programming cellular automata (SPCA) with specific application to pseudorandom number generation. By changing a cell's state transition rules in relation to factors such as its neighboring
Guan, SU, Tan, SK
core
Expecting the Intelligent Machine: Literary Interpretations and Images of Artificial Intelligence
Проблеми на постмодерносттаIs it possible to create an artificial human? This question has received its answers long before the advent of computers and artificial intelligence systems.
Nikolay Yanev
doaj +1 more source