A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Filters
Preemptive Job-Shop Scheduling Using Stopwatch Automata
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
In this paper we show how the problem of job-shop scheduling where the jobs are preemptible can b emodeled naturally as a shortest path problem de ned on an extension of timed automata, namely stopwatch ...
Although standard veri cation problems on stopwatch automata are known to b eundecidable, we show that due to well-known properties of optimal schedules, the shortest path in the automaton belongs to a ...
Corollary 3 (Preemptive Scheduling and Stopwatch Automata)
Table 1 : 1 Resolving con icts when J 1 m J 2 . ...
doi:10.1007/3-540-46002-0_9
fatcat:fxz3gyyzo5bwpd4ijddz2hvxai
A Conservative Approximation Method for the Verification of Preemptive Scheduling Using Timed Automata
2009
2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium
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 2012; you can also visit the original URL.
The file type is application/pdf.
The proposed approach is based on composable timed automata models that provide a sufficient condition to determine schedulability. We demonstrate the method on a real-time CORBA avionics design. ...
A method based on stopwatch automata [1] was proposed for the job-shop scheduling of preemptive systems [12] . ...
The schedulability of preemptive multi-processor systems is undecidable using timed automata in the generic case [3] , as timed automata cannot directly model stopwatches. ...
doi:10.1109/rtas.2009.32
dblp:conf/rtas/MadlDA09
fatcat:xba2tt4lobhzrpl35xsekiz7dq
Models and formal verification of multiprocessor system-on-chips
2008
The Journal of Logic and Algebraic Programming
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 model is translated to timed automata and a tool for system verification and simulation has been developed using Uppaal as backend. ...
We present a discrete model of computation for such systems and characterize the size of the computation tree it suffices to consider when checking for schedulability. ...
systems as well as models with stopwatches. ...
doi:10.1016/j.jlap.2008.05.002
fatcat:ookxwu7givhrnptu3megsqmb44
Task automata: Schedulability, decidability and undecidability
2007
Information and Computation
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.
Compared with classical task models for real time systems, task automata may be used to describe tasks (1) that are generated non-deterministically according to timing constraints in timed automata, (2 ...
We generalize the classical notion of schedulability to task automata. ...
To prove the first two clauses, we use the known fact on the standard region equivalence ∼, that u ∼ v implies that for all t, u + t ∼ v + t for some real number t such that t = t and ...
doi:10.1016/j.ic.2007.01.009
fatcat:n2e6cmhcnnctfhnkbhrxjyko24
Timed Automata with Asynchronous Processes: Schedulability and Decidability
[chapter]
2002
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 crucial observation is that the schedulability checking problem can be encoded as a reachability problem for such automata using clock subtractions. ...
An automaton is schedulable if there exists a (preemptive or non-preemptive) scheduling strategy such that all possible sequences of events accepted by the automaton are schedulable in the sense that all ...
Timed automata has been used to solve non-preemptive scheduling problems mainly for job-shop scheduling [1, 12, 15] . ...
doi:10.1007/3-540-46002-0_6
fatcat:snlwrh4v7zgq3bb4bts5hzp5ou
Parametric schedulability analysis of a launcher flight control system under reactivity constraints
[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.
We first describe the problematic of the scheduling of a launcher flight control, then we show how this problematic can be formalized with parametric stopwatch automata; we then present the results computed ...
We compare the results to the ones obtained by other tools classically used in scheduling. ...
In [AM01] , [AM02] , [AAM06] , (acyclic) TAs are used to solve job-shop and scheduling problems. ...
arXiv:1903.07217v1
fatcat:sy5pahsshfgipi67pyufzzehle
Verifying distributed real-time properties of embedded systems via graph transformations and model checking
2006
Real-time systems
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 2006; you can also visit the original URL.
The file type is application/pdf.
We introduce a formal semantic domain for a general class of DRE systems that enables the verification of distributed non-preemptive real-time scheduling. ...
To this end, this paper applies model checking techniques to DRE design models using model transformations to verify key QoS properties of component-based DRE systems developed using Real-time CORBA. ...
Methods that consider task dependencies are usually extensions of the job shop scheduling problem, which is NP-complete [40] . ...
doi:10.1007/s11241-006-6883-y
fatcat:vcr7e7eqebcthpyauzloanfwry
Schedulability analysis of fixed-priority systems using timed automata
2006
Theoretical 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 2005; you can also visit the original URL.
The file type is application/pdf.
In this paper, we show that for fixed priority scheduling strategy, the schedulability checking problem can be solved using standard timed automata with two extra clocks in addition to the clocks used ...
To relax the stringent constraints on task arrival times, we propose to use timed automata to describe task arrival patterns. ...
Similarly, stopwatch automata have been used to solve preemptive job-shop scheduling problems e.g. [2] . ...
doi:10.1016/j.tcs.2005.11.019
fatcat:gq5r3uuwf5dpfforlb5hhtxxyi
Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm
2012
Real-time systems
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.
We show that our improved algorithm yields dramatically improved performance for the schedulability test and opens for many further improvements. ...
Baker and Cirinei have introduced an exact but naive algorithm [3], that consists in solving a state reachability problem in a finite automaton, to check whether a set of sporadic hard real-time tasks is schedulable ...
In the field of operational research, Abdeddaïm and Maler have studied the use of stopwatch automata to solve job-shop scheduling problems [1] . ...
doi:10.1007/s11241-012-9172-y
fatcat:6c3ghxocirft7nutiwucfdgepq
High-level frameworks for the specification and verification of scheduling problems
2017
International Journal on Software Tools for Technology Transfer (STTT)
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.
These techniques are known to be effective but limited to a few classes of scheduling policies. ...
Over the years, schedulability of Cyber-Physical Systems (CPS) has mainly been performed by analytical methods. ...
The model in Fig. 1b implements a preemptive task using a stopwatch automata. ...
doi:10.1007/s10009-017-0466-1
fatcat:hmx6snzr4vhjdb2h7bkrxymd3q
Real-Time Scheduling of Energy Harvesting Embedded Systems with Timed Automata
2012
2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
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.
We first introduce the problem and show how to model it using timed automata. ...
We then propose a feasibility test based on CTL model checking and schedulability tests for EDF and Preemptive Fixed Priority algorithms (PFP). ...
Preemption could however be modeled using stopwatch automata, a model where clocks can be stopped. ...
doi:10.1109/rtcsa.2012.21
dblp:conf/rtcsa/AbdeddaimM12
fatcat:aj6ih2a4djfdpndaxeym3audxy
The scheduling problem of self-suspending periodic real-time tasks
2012
Proceedings of the 20th International Conference on Real-Time and Network Systems - RTNS '12
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.
We show how to use model checking to obtain both a necessary and sufficient feasibility test, and a schedulability test for classical scheduling policies (RM, DM, EDF). ...
We provide also a method to test the sustainability of a schedule w.r.t execution and suspension durations. Finally, using a model checking tool we validate our approach. ...
In this paper, we propose a timed-automata-based model to solve this scheduling problem. The timed automata approach has been already used to solve job shop scheduling problems [1, 10] . ...
doi:10.1145/2392987.2393014
dblp:conf/rtns/AbdeddaimM12
fatcat:vcq2n5i4jjfgjffpjeyolhfhny
Model Checking Real-Time Systems
[chapter]
2018
Handbook of Model Checking
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 chapter surveys timed automata as a formalism for model checking real-time systems. ...
We begin with introducing the model, as an extension of finite-state automata with real-valued variables for measuring time. ...
Acknowledgement We thank the reviewers for their numerous comments, remarks and additional references, which greatly helped us improve this chapter. ...
doi:10.1007/978-3-319-10575-8_29
fatcat:thsp3udcpnfyjpjzn6i2slbplm
Aalborg Universitet Time and Cost Optimization of Cyber-Physical Systems by Distributed Reachability Analysis TIME AND COST OPTIMIZATION OF CYBER-PHYSICAL SYSTEMS BY DISTRIBUTED REACHABILITY ANALYSIS Time and Cost Optimization of Cyber-Physical Systems by Distributed Reachability Analysis
unpublished
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.
Time optimal reachability analysis is a novel use of timed automata for solving scheduling and planning problems in a static environment. ...
Timed automata have been widely used as the input models for real-time model checking. ...
Conclusions We introduced the Pareto optimal reachability analysis to solve multi-objective scheduling and planing problems modeled by simple priced timed automata. ...
fatcat:umffshswyvhglb4tzjxw6yh6dq
OASIcs, Volume 31, FSFMA'13, Complete Volume
[article]
2013
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.
Le Tallec for their useful insights on Unmanned Aircrafts. ...
Acknowledgement I am grateful to an anonymous reviewer for his/her useful comments. Acknowledgements. Supervisor: Dr. Jin Song Dong.
References Acknowledgements. The authors thank J. ...
Preemptive job-shop scheduling using stopwatch automata. In TACAS, volume 2280 of Lecture Notes in Computer Science, pages 113-126. Springer, 2002. 3 Rajeev Alur and David L. Dill. ...
doi:10.4230/oasics.fsfma.2013
fatcat:2g2xorcow5gqvaqruei6zwh3bm