Corpus ID: 11235158

Guiding and Cost-Optimality in UPPAAL

  title={Guiding and Cost-Optimality in UPPAAL},
  author={G. Behrmann and A. Fehnker and T. Hune and K. Larsen and P. Pettersson and J. Romijn},
In this paper we present an algorithm for efficiently computing the minimum cost of reaching a goal state in the model of Uniformly Priced Timed Automata (UPTA). This model can be seen as a submodel of the recently suggested model of linearly priced timed automata, which extends timed automata with prices on both locations and transitions. The presented algorithm is based on a symbolic semantics of UTPA, and an efficient representation and operations based on difference bound matrices. In… Expand
Mapping temporal planning constraints into timed automata
Synthesis and stochastic assessment of cost-optimal schedules
New Approach for Differential Harvest Problem: The model checking way
5 Research School
First Solutions to PDDL+ Planning Problems
Trail-directed model checking
Automated test generation using model checking: an industrial evaluation


Efficient Guiding Towards Cost-Optimality in UPPAAL
Minimum-Cost Reachability for Priced Timed Automata
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata
Guided Synthesis of Control Programs Using UPPAAL
Error Detection with Directed Symbolic Model Checking
A Computational Study of the Job-Shop Scheduling Problem
Scheduling a steel plant with timed automata
  • A. Fehnker
  • Computer Science
  • Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306)
  • 1999
Deterministic job-shop scheduling: Past, present and future
Kronos: A Model-Checking Tool for Real-Time Systems
A Computational Study of Local Search Algorithms for Job Shop Scheduling