Results 51 to 60 of about 8,430 (314)
Using balm-ii for Deriving Cascade Parallel Composition of Timed Finite State Machines
Моделирование и анализ информационных систем, 2016 In this paper, we consider the problem of deriving a cascade parallel composition of timed finite state machines (TFSMs). In order to build such a composition we can derive the corresponding binary parallel compositions step-by-step.
M. L. Gromov, N. V. Shabaldina
doaj +1 more source
Model Checking One-clock Priced Timed Automata [PDF]
, 2007 We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical ...
Helmut Seidl +3 more
core +9 more sources
Automaton-based Implicit Controlled Invariant Set Computation for\n Discrete-Time Linear Systems [PDF]
, 2021 Zexiang Liu +3 more
openalex +2 more sources
Playing Stochastically in Weighted Timed Games to Emulate Memory [PDF]
Logical Methods in Computer ScienceWeighted timed games are two-player zero-sum games played in a timed automaton equipped with integer weights. We consider optimal reachability objectives, in which one of the players, that we call Min, wants to reach a target location while minimising ...
Benjamin Monmege +2 more
doaj +1 more source
An Individual-based Probabilistic Model for Fish Stock Simulation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We define an individual-based probabilistic model of a sole (Solea solea) behaviour. The individual model is given in terms of an Extended Probabilistic Discrete Timed Automaton (EPDTA), a new formalism that is introduced in the paper and that is shown ...
Federico Buti +5 more
doaj +1 more source
Weak Alternating Timed Automata [PDF]
, 2012 Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for these automata is decidable.
Igor Walukiewicz +2 more
core +3 more sources
Timed Automata Approach for Motion Planning Using Metric Interval Temporal Logic
, 2016 In this paper, we consider the robot motion (or task) planning problem under some given time bounded high level specifications. We use metric interval temporal logic (MITL), a member of the temporal logic family, to represent the task specification and ...
Baras, John S. +2 more
core +1 more source
Augmenting the discrete timed automaton with other data structures
Theoretical Computer Science, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ibarra, Oscar H., Su, Jianwen
openaire +2 more sources
An Infinite Automaton Characterization of Double Exponential Time [PDF]
, 2008 Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of initial and final states. Infinite-state automata have gained recent interest due to a remarkable result by Morvan and Stirling, which shows that automata with transitions ...
SALVATORE LA TORRE +2 more
openaire +5 more sources
FEBS Letters, EarlyView.This perspective highlights emerging insights into how the circadian transcription factor CLOCK:BMAL1 regulates chromatin architecture, cooperates with other transcription factors, and coordinates enhancer dynamics. We propose an updated framework for how circadian transcription factors operate within dynamic and multifactorial chromatin landscapes ...
Xinyu Y. Nie, Jerome S. Menet
wiley +1 more source