Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems

Bønneland, Fredrik Meyer; Jensen, Peter Gjøl; Larsen, Kim Guldstrand; Muñiz, Marco; Srba, Jǐŕı

doi:10.1007/978-3-319-96145-3_28

Cited by 9 publications

(7 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Other future work include techniques to avoid the state explosion problem explored. Partial Order Reduction (POR) has been recently successfully applied to timed systems [5]. Application of POR for timed systems with costs could greatly improve the computation of schedulers for task graphs.…”

Section: Discussionmentioning

confidence: 99%

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

Ejsing,

Jensen,

Muñiz

et al. 2020

Preprint

Self Cite

View full text Add to dashboard Cite

Task graph scheduling is a relevant problem in computer science with application to diverse real world domains. Task graph scheduling suffers from a combinatorial explosion and thus finding optimal schedulers is a difficult task. In this paper we present a methodology for computing near-optimal preemptive and non-preemptive schedulers for task graphs. 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). Additionally, we explore the effect of using chains to reduce the computation time for finding schedules. We have implemented our models in Uppaal Cora and Uppaal Stratego. We conduct an exhaustive experimental evaluation where we compare our resulting schedules with the best-known schedules of a state of the art tool. A significant number of our resulting schedules are shown to be shorter than or equal to the best-known schedules.

show abstract

Section: Discussionmentioning

confidence: 99%

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

Ejsing,

Jensen,

Muñiz

et al. 2020

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Thus, it will be very interesting to understand the structure of local zone graphs better. A recent partialorder method proposed for timed-arc Petri nets [6] gives a hope that such obstacles can be overcome. For timed networks with cycles, the interplay of partial-order and subsumption adds another level of difficulty.…”

Section: Discussionmentioning

confidence: 99%

Revisiting local time semantics for networks of timed automata

Govind,

Herbreteau,

Srivathsan

et al. 2019

Preprint

View full text Add to dashboard Cite

We investigate a zone based approach for the reachability problem in timed automata. The challenge is to alleviate the size explosion of the search space when considering networks of timed automata working in parallel. In the timed setting this explosion is particularly visible as even different interleavings of local actions of processes may lead to different zones. Salah et al. in 2006 have shown that the union of all these different zones is also a zone. This observation was used in an algorithm which from time to time detects and aggregates these zones into a single zone.We show that such aggregated zones can be calculated more efficiently using the local time semantics and the related notion of local zones proposed by Bengtsson et al. in 1998. Next, we point out a flaw in the existing method to ensure termination of the local zone graph computation. We fix this with a new algorithm that builds the local zone graph and uses abstraction techniques over (standard) zones for termination. We evaluate our algorithm on standard examples. On various examples, we observe an order of magnitude decrease in the search space. On the other examples, the algorithm performs like the standard zone algorithm.

show abstract

“…The experiments show promising results on a number of case studies, achieving in general a substantial state space reduction with only a small overhead for computing the stubborn sets. In the future work, we plan to combine our contribution with a recent insight on how to effectively use partial order reduction in the timed setting [5] in order to extend our framework to general timed games.…”

Section: Discussionmentioning

confidence: 99%

“…In order to achieve this, we define the set of interesting transitions A M (ϕ) for a formulae ϕ so that any firing sequence of transitions from a marking that does not satisfy ϕ leading to a marking that satisfies ϕ must contain at least one interesting transition. Table 2 provides the definition of A M (ϕ) that is similar to the one presented in [5] for the non-game setting, except for the conjunction where we in our setting use Equation (4.1) that provides an optimisation for Condition S and possibly ends with a smaller set of interesting transitions.…”

Section: Stable Reductions On Petri Net Gamesmentioning

confidence: 99%

See 1 more Smart Citation

Stubborn Set Reduction for Two-Player Reachability Games

Bønneland,

Jensen,

Larsen

et al. 2019

Preprint

Self Cite

View full text Add to dashboard Cite

Partial order reductions have been successfully applied to model checking of concurrent systems and practical applications of the technique show nontrivial reduction in the size of the explored state space. We present a theory of partial order reduction based on stubborn sets in the game-theoretical setting of 2-player games with reachability objectives. Our stubborn reduction allows us to prune the interleaving behaviour of both players in the game, and we formally prove its correctness on the class of games played on general labelled transition systems. We then instantiate the framework to the class of weighted Petri net games with inhibitor arcs and provide its efficient implementation in the model checker TAPAAL. Finally, we evaluate our stubborn reduction on several case studies and demonstrate its efficiency.

show abstract

Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems

Cited by 9 publications

References 35 publications

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

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

Revisiting local time semantics for networks of timed automata

Stubborn Set Reduction for Two-Player Reachability Games

Contact Info

Product

Resources

About