Results 161 to 170 of about 549 (191)
Survey, taxonomy, and emerging paradigms of societal digital twins for public health preparedness. [PDF]
NPJ Digit MedRehan MW, Rehan MM.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The SHIFT programming language for dynamic networks of hybrid automata
IEEE Transactions on Automatic Control, 1998Summary: SHIFT is a programming language for describing and simulating dynamic networks of hybrid automata. In the first section, we examine other work related to the SHIFT approach. In Section II, we describe the main features of the SHIFT language -- states, inputs, outputs, differential equations, and algebraic definitions, discrete states, and ...
Akash Deshpande +2 more
openaire +1 more source
On the representation of formal languages using automata on networks
10th Annual Symposium on Switching and Automata Theory (swat 1969), 1969A new model of abstract automata is presented employing the concept of finite automata on a network. Each normal network n provided with a one-way input tape determines a family of languages nl. A representation theorem, analogous to the Chomsky-Schutzenberger representation theorem for context free languages1, is proved for the class nl.
Gerald A. Fischer, George N. Raney
openaire +1 more source
2015 54th IEEE Conference on Decision and Control (CDC), 2015
In this paper, how to determine the observability of switched Boolean control networks (SBCNs) is investigated. First, a new concept of weighted pair graph for an SBCN is defined. Second, the weighted pair graph is used to transform an SBCN into a deterministic finite automaton (DFA).
Kuize Zhang +3 more
openaire +1 more source
In this paper, how to determine the observability of switched Boolean control networks (SBCNs) is investigated. First, a new concept of weighted pair graph for an SBCN is defined. Second, the weighted pair graph is used to transform an SBCN into a deterministic finite automaton (DFA).
Kuize Zhang +3 more
openaire +1 more source
Proceedings of the 33rd Chinese Control Conference, 2014
In this paper, we solve a basic problem of whether there are algorithms to determine the observability of Boolean control networks (BCNs). In fact, we give a unified approach to design algorithms to judge whether a given BCN is observable with respect to different observability.
Kuize Zhang, Lijun Zhang
openaire +1 more source
In this paper, we solve a basic problem of whether there are algorithms to determine the observability of Boolean control networks (BCNs). In fact, we give a unified approach to design algorithms to judge whether a given BCN is observable with respect to different observability.
Kuize Zhang, Lijun Zhang
openaire +1 more source
Incremental Language Inclusion Checking for Networks of Timed Automata
2013Checking the language inclusion between two models is a fundamental problem arising in application areas such as formal verification or refinement in top-down design. We propose an incremental procedure for checking the language inclusion between two real-time specifications, modeled as networks of deterministic timed automata, where the two ...
Willibald Krenn +2 more
openaire +1 more source
SHIFT: A formalism and a programming language for dynamic networks of hybrid automata
1997SHIFT is a programming language for the specification and simulation of dynamic networks of hybrid automata. Such systems consist of components which can be created, interconnected and destroyed as the system evolves. Components exhibit hybrid behavior, consisting of continuous-time phases separated by discrete-event transitions.
Akash Deshpande +2 more
openaire +1 more source
Fractals, neural networks, cellular automata, formal language and coding theory
[Proceedings] 1992 IEEE International Conference on Systems, Man, and Cybernetics, 2003The authors unify fractal theory for: learning, computer graphics, and data compression; Hopfield neural networks for pattern recognition; cellular automata for parallel computation; formal language theory; and coding theory for fault tolerance, data compression, and cryptography.
openaire +1 more source
CANL: A Language for Cellular Automata Network Modeling.
1996This paper discusses a new methodological approach for the modeling of complex physical systems and a new programming language to express it in a simple and user-friendly way. The methodological approach is based on a reduction process through which a model of a complex physical phenomenon can be decomposed in several components; each component is ...
C Di Napoli +4 more
openaire +1 more source
Combination of finite state automata and neural network for spoken language understanding
8th European Conference on Speech Communication and Technology (Eurospeech 2003), 2003Chai Wutiwiwatchai, Sadaoki Furui
openaire +1 more source