Results 21 to 30 of about 8,430 (314)
Reachability and liveness in parametric timed automata [PDF]
Logical Methods in Computer Science, 2022 We study timed systems in which some timing features are unknown parameters. Parametric timed automata (PTAs) are a classical formalism for such systems but for which most interesting problems are undecidable.
Étienne André +2 more
doaj +1 more source
Timed automaton models for simple programmable logic controllers [PDF]
Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99, 2003 We give timed automaton models for a class of Programmable Logic Controller (PLC) applications, that are programmed in a simple fragment of the language Instruction Lists as defined in the standard IEC 1131-3. Two different approaches for modelling timers are suggested, that lead to two different timed automaton models.
Mader, Angelika H., Wupper, Hanno
openaire +1 more source
The Multilateral Instrument: Avoidance of Permanent Establishment Status and the Reservations on behalf of Australia and the UK [PDF]
, 2013 This paper considers fully probabilistic system models. Each transition is quantified with a probability—its likelihood of occurrence. Properties are expressed as automata that either accept or reject system runs. The central question is to determine the
Ivanova, Milla
core +13 more sources
Electronic Proceedings in Theoretical Computer Science, 2014 In this paper, we define the class of hourglass automata, which are timed automata with bounded clocks that can be made to progress backwards as well as forwards at a constant rate.
Yuki Osada +3 more
doaj +1 more source
A DYNAMIC SUPERVISION APPROACH BASED ON STOCHASTIC P-TIMED PETRI NETS: APPLICATION TO A RAILWAY TRANSPORT NETWORK [PDF]
Proceedings on Engineering Sciences, 2022 Developments presented in this paper are devoted to the monitoring of railway transport systems. Stochastic P-time Petri Nets (SP-TPN) are used for modelling.
Anis M’halla
doaj +1 more source
Timed Automata for Modelling Caches and Pipelines [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 In this paper, we focus on modelling the timing aspects of binary programs running on architectures featuring caches and pipelines. The objective is to obtain a timed automaton model to compute tight bounds for the worst-case execution time (WCET) of the
Franck Cassez +1 more
doaj +1 more source
An Automaton Approach for Waiting Times in DNA Evolution [PDF]
Journal of Computational Biology, 2012 8 ...
Behrens, Sarah +2 more
openaire +5 more sources
Real-Time Model-Checking: Parameters everywhere [PDF]
Logical Methods in Computer Science, 2007 In this paper, we study the model-checking and parameter synthesis problems of the logic TCTL over discrete-timed automata where parameters are allowed both in the model (timed automaton) and in the property (temporal formula). Our results are as follows.
Veronique Bruyere, Jean-Francois Raskin
doaj +1 more source
Avoiding Shared Clocks in Networks of Timed Automata [PDF]
Logical Methods in Computer Science, 2013 Networks of timed automata (NTA) are widely used to model distributed real-time systems. Quite often in the literature, the automata are allowed to share clocks, i.e.
Sandie Balaguer, Thomas Chatain
doaj +1 more source
On the decidability and complexity of Metric Temporal Logic over finite words [PDF]
Logical Methods in Computer Science, 2007 Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity.
Joel Ouaknine, James Worrell
doaj +1 more source