Sciweavers

134 search results - page 16 / 27
» Model-Checking for Weighted Timed Automata
Sort
View
ATVA
2006
Springer
130views Hardware» more  ATVA 2006»
13 years 10 months ago
The Implementation of Mazurkiewicz Traces in POEM
We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to sto...
Peter Niebert, Hongyang Qu
RTS
2008
131views more  RTS 2008»
13 years 6 months ago
Formal verification of multitasking applications based on timed automata model
The aim of this paper is to show, how a multitasking application running under a real-time operating system compliant with an OSEK/VDX standard can be modeled by timed automata. Th...
Libor Waszniowski, Zdenek Hanzálek
IPPS
2005
IEEE
14 years 9 days ago
Production Scheduling by Reachability Analysis - A Case Study
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
Gerd Behrmann, Ed Brinksma, Martijn Hendriks, Ange...
FMSD
2007
97views more  FMSD 2007»
13 years 6 months ago
On the optimal reachability problem of weighted timed automata
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
Patricia Bouyer, Thomas Brihaye, Véronique ...
HYBRID
2001
Springer
13 years 11 months ago
Optimal Paths in Weighted Timed Automata
Rajeev Alur, Salvatore La Torre, George J. Pappas