Filters








16,398 Hits in 1.3 sec

Scheduling with timed automata

Yasmina Abdeddaı¨m, Eugene Asarin, Oded Maler
2006 Theoretical Computer Science  
In this work, we present timed automata as a natural tool for posing and solving scheduling problems.  ...  We show how efficient shortest path algorithms for timed automata can find optimal schedules for the classical job-shop problem.  ...  We believe that the insight gained from this point of view will contribute both to scheduling and to the study of timed automata.  ... 
doi:10.1016/j.tcs.2005.11.018 fatcat:6imydoapfvdjdgesr34qcexxnm

Timed Automata with Asynchronous Processes: Schedulability and Decidability [chapter]

Elena Fersman, Paul Pettersson, Wang Yi
2002 Lecture Notes in Computer Science  
In this paper, we exend timed automata with asynchronous processes i.e. tasks triggered by events as a model for real-time systems.  ...  The proof is based on a class of updatable automata: timed automata with subtraction in which clocks may be updated by subtractions.  ...  We have studied a model of timed systems (timed automata extended with tasks), which unifies timed automata with the classic task models from scheduling theory.  ... 
doi:10.1007/3-540-46002-0_6 fatcat:snlwrh4v7zgq3bb4bts5hzp5ou

Real-Time Scheduling of Energy Harvesting Embedded Systems with Timed Automata

Yasmina Abdeddaim, Damien Masson
2012 2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications  
We first introduce the problem and show how to model it using timed automata.  ...  In this paper, we propose feasibility and schedulability tests for a realtime scheduling problem under energy constraints.  ...  The Modeling step 4.1 Timed Automata A Timed automaton [17] is a model extending the classical automaton model with a set of variables, called clocks.  ... 
doi:10.1109/rtcsa.2012.21 dblp:conf/rtcsa/AbdeddaimM12 fatcat:aj6ih2a4djfdpndaxeym3audxy

Near Optimal Task Graph Scheduling with Priced Timed Automata and Priced Timed Markov Decision Processes [article]

Anne Ejsing, Martin Jensen, Marco Muñiz, Jacob Nørhave, Lars Rechter
2020 arXiv   pre-print
The task graph scheduling problem is reduced to location reachability via the fastest path in Priced Timed Automata (PTA) and Priced Timed Markov Decision Processes (PTMDP).  ...  Task graph scheduling is a relevant problem in computer science with application to diverse real world domains.  ...  As the task graph scheduling problem is reducible to the reachability problem in timed automata [2] , we use extensions of timed automata to find near-optimal solutions, being Priced Timed Automata and  ... 
arXiv:2002.10783v1 fatcat:f3b5lsckezbuzfne7df5ejqbs4

Scheduling a steel plant with timed automata

A. Fehnker
Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306)  
Scheduling in an environment with constraints of many different types is known to be a hard problem.  ...  We tackle this problem for an integrated steel plant in Ghent, Belgium, using UPPAAL, a model checker for networks of timed automata.  ...  Timed Automata, due to Alur and Dill [2] , are finite state automata with clock variables. This formalism can be used to model real-time requirements of systems in a natural way.  ... 
doi:10.1109/rtcsa.1999.811256 dblp:conf/rtcsa/Fehnker99 fatcat:xftmxe7tl5e3rn55zqxzwdczcy

TIMES b— A Tool for Modelling and Implementation of Embedded Systems [chapter]

Tobias Amnell, Elena Fersman, Leonid Mokrushin, Paul Pettersson, Wang Yi
2002 Lecture Notes in Computer Science  
For more information about how to solve scheduling problems of timed automata with tasks using timed automata, see [1] .  ...  A system specification in Times consists of three parts: the control automata modelled as a network of timed automata extended with tasks [1], a task table with information about the processes triggered  ... 
doi:10.1007/3-540-46002-0_32 fatcat:3euyflrb7vg53eqq7fkm4r4pd4

From nonpreemptive to preemptive scheduling

Mohammad Mahdi Jaghoori
2011 Proceedings of the 2011 ACM Symposium on Applied Computing - SAC '11  
In this paper, we consider the possibility of specifying tasks using timed automata.  ...  The use of automata for specifying patterns of task generation has broaden the perspective of schedulability analysis; scheduling has moved from periodic or rate-monotonic to aperiodic and non-uniform  ...  To analyze a system in Uppaal, we make a network of timed automata with instances of task generation and specifications automata and the automata for scheduling, task dispatching and error handling.  ... 
doi:10.1145/1982185.1982342 dblp:conf/sac/Jaghoori11 fatcat:3xzl7n6lz5esrooc7lr7ck4xga

Adaptive Task Automata: A Framework for Verifying Adaptive Embedded Systems [chapter]

Leo Hatvani, Paul Pettersson, Cristina Seceleanu
2012 Lecture Notes in Computer Science  
We present a framework for modeling and analysis of adaptive embedded systems, based on the model of timed automata with tasks.  ...  The model is extended with primitives allowing modeling of adaptivity, by testing the potential schedulability of a given task, in the context of the set of currently enqueued tasks.  ...  Preliminaries: Task Automata Our model of adaptive task automata is based on the model of task automata (or timed automata with tasks) [8, 10, 12] , which extends the model of timed automata with a notion  ... 
doi:10.1007/978-3-642-28872-2_9 fatcat:jhiuungibfgd7az56vgnz6ukii

Timed Automata Semantics for Analyzing Creol

Mohammad Mahdi Jaghoori, Tom Chothia
2010 Electronic Proceedings in Theoretical Computer Science  
We give a real-time semantics for the concurrent, object-oriented modeling language Creol, by mapping Creol processes to a network of timed automata.  ...  We can use our semantics to verify real time properties of Creol objects, in particular to see whether processes can be scheduled correctly and meet their end-to-end deadlines.  ...  We enrich Creol with real-time and provide a timed-automata semantics for it where in particular schedulability can be analyzed; this semantics allows for explicit modeling of scheduling strategies.  ... 
doi:10.4204/eptcs.30.8 fatcat:6jjybncq5fb75hbou4angpasi4

Schedulability of asynchronous real-time concurrent objects

Mohammad Mahdi Jaghoori, Frank S. de Boer, Tom Chothia, Marjan Sirjani
2009 The Journal of Logic and Algebraic Programming  
We extend the actor model, as the asynchronous model for concurrent objects, with real time using timed automata, and show how actors can be analyzed individually to make sure that no task misses its deadline  ...  Using these drivers we can verify schedulability, for a given scheduler, by doing a reachability check with the Uppaal model checker.  ...  Networks of timed automata. A system may be described as a collection of timed automata communicating with each other.  ... 
doi:10.1016/j.jlap.2009.02.009 fatcat:jwzqdu6qt5bfpi3yj6boutqk2i

Modular Schedulability Analysis of Concurrent Objects in Creol [chapter]

Frank de Boer, Tom Chothia, Mohammad Mahdi Jaghoori
2010 Lecture Notes in Computer Science  
In previous work we analyzed the schedulability of objects modeled as Timed Automata.  ...  We provide an algorithm for automatically translating Creol code annotated with this real time information to timed automata.  ...  Networks of timed automata. A system may be described as a collection of timed automata communicating with each other.  ... 
doi:10.1007/978-3-642-11623-0_12 fatcat:rg3pcxrqtzhktk6gmhytsnt55y

Multi-resource sharing scheduling considering uncontrollable environment

Mahya Rahimi, Emil Dumitrescu, Eric Niel
2018 2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)  
This paper addresses the problem of scheduling through a visual, expressive and formal modeling approach, based on Timed Game Automata (TGA).  ...  The obtained result for a scheduling example shows the huge difference in the obtained schedule with and without considering uncontrollable behaviors.  ...  [5] propose shortest path algorithms for timed automata to find optimal schedules in a job shop scheduling problem. The authors also investigate non-lazy scheduling with uncertain task duration.  ... 
doi:10.1109/etfa.2018.8502611 dblp:conf/etfa/RahimiDN18 fatcat:43wtdc6zirc3jft3w323j4f5x4

Adaptive Task Automata with Earliest-Deadline-First Scheduling

Leo Hatvani, Alexandre David, Cristina Seceleanu, Paul Pettersson
2014 Electronic Communications of the EASST  
To support this, we also show that reachability in our class of timed automata with updates is decidable.  ...  To prove the decidability of our model, and at the same time maintain a manageable degree of conciseness, we show an encoding of our model as a network of timed automata with clock updates.  ...  in our variant of timed automata with updates is decidable.  ... 
doi:10.14279/tuj.eceasst.70.975 dblp:journals/eceasst/HatvaniDSP14 fatcat:qo7xs5qexrglnjo4535wn2kbve

Analysis of Scheduling Behaviour using Generic Timed Automata

Thorsten Gerdsmeier, Rachel Cardell-Oliver
2001 Electronical Notes in Theoretical Computer Science  
Each scheduling algorithm is defined by a generic timed automaton which can be instantiated with data for a particular set of tasks.  ...  The resulting network of instantiated timed automata can be analysed automatically in the model-checker Uppaal, to ensure correctness properties are satisfied.  ...  Generic timed automata are timed automata templates that can be instantiated with parameters.  ... 
doi:10.1016/s1571-0661(04)80883-1 fatcat:e6yaj2gtvzd53cuq4q4eyyfz3e

Modeling and analysis of adaptive embedded systems using adaptive task automata

Leo Hatvani, Cristina Seceleanu, Paul Pettersson
2013 ACM SIGBED Review  
Recently, we have introduced Adaptive Task Automata, to meet this goal.  ...  In this paper, we overview the current functionality implemented in the Adaptive Task Automata framework (ATA), as well as some of the challenges encountered during the development.  ...  OVERVIEW OF TASK AUTOMATA The model of task automata is a model for real time systems with asynchronous tasks, first introduced with nonpreemptive scheduling by Norström et.al [12] and extended to include  ... 
doi:10.1145/2492385.2492393 fatcat:xakbud5dqzcm5jjay6vltg533y
« Previous Showing results 1 — 15 out of 16,398 results