A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Filters
Nested Timed Automata
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
This paper proposes a new timed model named nested timed automata (NeTAs). An NeTA is a pushdown system whose stack symbols are timed automata (TAs). ...
NeTAs provide a natural way to analyze the recursive behaviors of component-based timed systems with structure retained. We illustrate this advantage by the deadline analysis of nested interrupts. ...
Nondeterministic clock updates are also taken from [7] with interval tests as diagonal free time constraints where decidability results are not affected.
Definition 1 (Timed Automata). ...
doi:10.1007/978-3-642-40229-6_12
fatcat:efmxojlgf5aufik72isdu4z6de
Formalized Timed Automata
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
the common approximation operation correctly decides emptiness for the class of diagonal-free timed automata. ...
Timed automata are a widely used formalism for modeling real-time systems, which is employed in a class of successful model checkers such as UPPAAL. ...
Section 2 will present the formalization of the basic notions for diagonal-free timed automata. ...
doi:10.1007/978-3-319-43144-4_26
fatcat:ns23wsetjnbyxki553hyjwk3ou
Updatable timed automata with one updatable clock
2017
Science China Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We will show that (1) the reachability of general UTAs with one updatable clock (UTA1s) is still undecidable, and (2) that of UTA1s under diagonal-free constraints is decidable, and the complexity is Pspace-complete ...
Updatable timed automata (UTAs) proposed by Bouyer et.al., is an extension of timed automata (TAs) having the extra ability to update clocks in a more elaborate way than simply reset them to zero. ...
Nested timed automata (NeTAs) [11, 20, 30] extended TAs with recursive structure in a different way. ...
doi:10.1007/s11432-016-9027-y
fatcat:yynkopatfvhxfiqain4iggxsry
Transient induced global response synchronization
2016
International Journal of Design & Nature and Ecodynamics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper reviews the notion of TIGoRS and its expression in several complex systems models including driven cellular automata, cocktail party and dispositional cellular automata. ...
This occurs even though the underlying system dynamics is time varying and inhomogeneous across the system. Previous work has shown that TIGoRS is a ubiquitous phenomenon among complex systems. ...
The initial rules were 7 (diagonal), 14 (diagonal), 37 (vertical), 40 (uniform), 41 (complex), 43 (diagonal), 44 (fixed), 45 (chaotic). ...
doi:10.2495/dne-v11-n4-712-721
fatcat:xt5u7qrebbhebn7gle3orrxj2q
Fast zone-based algorithms for reachability in pushdown timed automata
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
One extension that has received a lot of interest is timed automata with a, possibly unbounded, stack, also called the pushdown timed automata (PDTA) model. ...
Given the versatility of timed automata a huge body of work has evolved that considers extensions of timed automata. ...
[16] for timed automata with diagonal constraints. ...
arXiv:2105.13683v2
fatcat:7sx2qa2asrh7fmud4fzjrpevwi
Analyzing Timed Systems Using Tree Automata
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The main idea is to consider timed behaviors as graphs with matching edges capturing timing constraints. ...
The classical region abstraction for timed automata reduces them to (untimed) finite state automata with the same time-abstract properties, such as state reachability. ...
For a constraint x − y ∈ [1, 5], we add an edge between the last reset of x and last reset of y with [1, 5] interval. Thus, we can check the diagonal constraint at the time of last reset. ...
arXiv:1604.08443v3
fatcat:hsgq6ornprah3hl6h34jac65aa
Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account
[chapter]
2020
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This article revisits the problem of decomposing a Petri net into a network of automata, a problem that has been around since the early 70s. ...
We reformulate this problem as the transformation of an ordinary, one-safe Petri net into a flat, unit-safe NUPN (Nested-Unit Petri Net) and define a quality criterion based on the number of bits required ...
The determination of idle and permanent units is done in linear time, with a simple iteration that examines the pre-set and post-set of each transition. ...
doi:10.1007/978-3-030-51831-8_1
fatcat:bvqqmr2dkfhutjjdavq2yluoha
Computing Maximal Expected Termination Time of Probabilistic Timed Automata
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The paper addresses the problem of computing maximal expected time to termination of probabilistic timed automata (PTA) models, under the condition that the system will, eventually, terminate. ...
Second, it can bring the "worst case execution time" problem of PTAs within the bounds of feasibility for model checking techniques. ...
Then the diagonal constraints involving z 1 and z 2 can be updated as follows. ...
arXiv:1709.07171v8
fatcat:knv43dvf5ranbg764cghsh2shq
Verification and Control of Partially Observable Probabilistic Real-Time Systems
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
To formally model such systems, we define an extension of probabilistic timed automata in which local states are partially visible to an observer or controller. ...
We propose automated techniques for the verification and control of probabilistic real-time systems that are only partially observable. ...
Partially Observable Probabilistic Timed Automata In this section, we define partially observable probabilistic timed automata (POP-TAs), which generalise the existing model of probabilistic timed automata ...
doi:10.1007/978-3-319-22975-1_16
fatcat:doe2lmfqljd7johgaubc4xfi3q
Timed Systems through the Lens of Logic
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We start by describing behaviors of timed systems using graphs with timing constraints. ...
Such a graph is called realizable if we can assign time-stamps to nodes or events so that they are consistent with the timing constraints. ...
For instance, consider diagonal guards in timed automata, which are expressively equivalent to timed automata without diagonal guards. ...
arXiv:1903.03773v2
fatcat:qzanusy5grhflmzmlm2oyw6nii
An Over-Approximation Forward Analysis for Nested Timed Automata
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Nested timed automata(NeTAs), proposed by Li et al., are a pushdown system whose stack symbols are timed automata (TAs). ...
With this formal models, we can model and analyze complex real-time frameworks with recursive context switches. ...
Nested Timed Automata
Definition 7 (Nested Timed automata). ...
doi:10.1007/978-3-319-17404-4_5
fatcat:vc7undjfcbe5xfzxhbmwuf3zyq
Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The paper gives comprehensive definitions of timed automata, priced (or weighted) timed automata, and timed games and highlights a number of results on associated decision problems related to model checking ...
This article aims at providing a concise and precise Travellers Guide, Phrase Book or Reference Manual to the timed automata modeling formalism introduced by Alur and Dill [8, 9] . ...
For additional modelling power, timed automata with diagonal constraints can be used, as it is shown in [9, 29] that any such automaton can be converted to a diagonal-free one; however the conversion ...
doi:10.1007/978-3-642-39721-9_2
fatcat:7x75bth3arcfxahcrd6tex5wbm
Mining Ecological Data with Cellular Automata
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper introduces a Cellular Automata (CA) approach to spatiotemporal data mining (STDM). ...
The problem of predicting wading-bird nest site locations in ecological data is used throughout to illustrate the concepts, and provides the framework for experimental analysis. ...
This project is supported by an Australian Research Council Linkage grant in collaboration with the Built Environment Research Unit (BERU), Queensland Department of Public Works. ...
doi:10.1007/978-3-540-30479-1_49
fatcat:vhlmnkjnvnbzljvair477iz2si
Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
2009
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
high quality plans in metric-time domains and domains involving soft goals or constraints. ...
; and we evaluate them in terms of their capability of dealing with soft goals and constraints, and of finding good quality plans in general. ...
Because modalities are not nested, the number of states and transitions in the automaton corresponding to a single basic constraint is bounded by a constant (assuming automata corresponding to constraints ...
doi:10.1016/j.artint.2008.10.012
fatcat:nnm56wydxvemljdamo7anawx3e
Model checking for probabilistic timed automata
2012
Formal methods in system design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Probabilistic timed automata (PTAs) are a formalism for modelling systems whose behaviour incorporates both probabilistic and real-time characteristics. ...
Embedded systems, for example, whether in communication and multimedia devices or in automotive and avionic control systems, often operate under timing constraints. ...
Any PTA can be transformed into one containing only diagonal-free constraints by applying the construction of [15] (the construction is presented for timed automata, and requires minor modifications ...
doi:10.1007/s10703-012-0177-x
fatcat:3drcwvmdprgexn5n5q2dy4j7je
« Previous
Showing results 1 — 15 out of 876 results