Sciweavers

93 search results - page 3 / 19
» Timed Unfoldings for Networks of Timed Automata
Sort
View
CONCUR
1999
Springer
13 years 10 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea
IEE
2010
41views more  IEE 2010»
13 years 4 months ago
Synthesising certificates in networks of timed automata
Bernd Finkbeiner, H.-J. Peter, Sven Schewe
ACTA
2010
104views more  ACTA 2010»
13 years 6 months ago
Reachability results for timed automata with unbounded data structures
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
RTCSA
1999
IEEE
13 years 10 months ago
Scheduling a Steel Plant with Timed Automata
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 ...
Ansgar Fehnker
FORMATS
2010
Springer
13 years 4 months ago
Layered Composition for Timed Automata
Abstract. We investigate layered composition for real-time systems modelled as (networks of) timed automata (TA). We first formulate the principles of layering and transition indep...
Ernst-Rüdiger Olderog, Mani Swaminathan