Results 231 to 240 of about 38,502 (282)
Simulation of the Diffusion Characteristics of Multifunctional Nanocarriers in Tumor Tissues Using Lattice Gas Automata and the Lattice Boltzmann Method. [PDF]
Bioengineering (Basel)Qin Y +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2006 IEEE Conference on Computer-Aided Control Systems Design, 2006
The determination of the optimal mode sequence for hybrid systems with autonomous transitions is examined. A class of hybrid systems that exhibit a locally Lipschitz mapping between their parameters and their continuous states is introduced. Lipschitzian optimization methods such as bundle methods are explored for the solution of parametric ...
Mehmet Yunt, Paul I. Barton
openaire +1 more source
The determination of the optimal mode sequence for hybrid systems with autonomous transitions is examined. A class of hybrid systems that exhibit a locally Lipschitz mapping between their parameters and their continuous states is introduced. Lipschitzian optimization methods such as bundle methods are explored for the solution of parametric ...
Mehmet Yunt, Paul I. Barton
openaire +1 more source
2012 19th Asia-Pacific Software Engineering Conference, 2012
Cyber-Physical Systems (CPS) are hybrid, component-based and open systems. Hybrid interface automata (HIA), which extend from interface automata, are introduced to model CPS. HIA are not input-enable, that is, only certain inputs can be accepted on a location of HIA. Thus, HIA can specify assumptions about the environment made by a component.
Yan Zhang 0007, Tian Zhang 0001
openaire +1 more source
Cyber-Physical Systems (CPS) are hybrid, component-based and open systems. Hybrid interface automata (HIA), which extend from interface automata, are introduced to model CPS. HIA are not input-enable, that is, only certain inputs can be accepted on a location of HIA. Thus, HIA can specify assumptions about the environment made by a component.
Yan Zhang 0007, Tian Zhang 0001
openaire +1 more source
HYBRID EXTENDED FINITE AUTOMATA
International Journal of Foundations of Computer Science, 2006Extended finite automata are finite state automata equipped with the additional ability to apply an operation on the currently remaining input word, depending on the current state. Hybrid extended finite automata can choose from a finite set of such operations.
Henning Bordihn +2 more
openaire +1 more source
(Hybrid) automata and (stochastic) programs * The hybrid automata lattice of a stochastic program
Journal of Logic and Computation, 2011We define a semantics for stochastic Concurrent Constraint Programming (sCCP), a stochastic process algebra, in terms of stochastic hybrid automata with piecewise deterministic continuous dynamics. To each program we associate a lattice of hybrid models, parameterized with respect to the degree of discreteness left.
Luca Bortolussi, Alberto Policriti
openaire +3 more sources
Polyhedral Flows in Hybrid Automata
Formal Methods in System Design, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ALUR R, KANNAN S, LA TORRE, Salvatore
openaire +2 more sources
2009
Hybrid automata is a modeling formalism for hybrid systems that results from an extension of finite-state machines by associating with each discrete state a continuous-state model. Conditions on the continuous evolution of the system invoke discrete state transitions.
Kowalewski, S +7 more
openaire +4 more sources
Hybrid automata is a modeling formalism for hybrid systems that results from an extension of finite-state machines by associating with each discrete state a continuous-state model. Conditions on the continuous evolution of the system invoke discrete state transitions.
Kowalewski, S +7 more
openaire +4 more sources
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 2000
We summarize several recent results about hybrid automata. Our goal is to demonstrate that concepts from the theory of discrete concurrent systems can give insights into partly continuous systems, and that methods for the verification of finite-state systems can be used to analyze certain systems with uncountable state spaces.
openaire +1 more source
We summarize several recent results about hybrid automata. Our goal is to demonstrate that concepts from the theory of discrete concurrent systems can give insights into partly continuous systems, and that methods for the verification of finite-state systems can be used to analyze certain systems with uncountable state spaces.
openaire +1 more source
On Transfinite Hybrid Automata
2005In this paper, we propose a new method to deal with hybrid systems based on the concept of the nonstandard analysis and the Buchi's transfinite automata. An essential point of the method is a generalization of hybrid automata with hyperfinite iteration of an infinitesimal transition in * ℝ.
Katsunori Nakamura, Akira Fusaoka
openaire +1 more source
Observability of Hybrid Automata by Abstraction
2006In this paper, we deal with the observability problem of a class of Hybrid Systems whose output is a timed string on a finite alphabet. We determine under which conditions it is always possible to immediately detect, using the observed output, when the system enters a given discrete state.
D'INNOCENZO, ALESSANDRO +2 more
openaire +1 more source