321 search results - page 25 / 65 » Symbolic Model Checking for Probabilistic Timed Automata |
FMOODS
2006
13 years 10 months ago
2006
Long-Running transactions consist of tasks which may be executed sequentially and in parallel, may contain sub-tasks, and may require to be completed before a deadline. These trans...
FORMATS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We examine to what extent implementation of timed automata can be achieved using the standard semantics and appropriate modeling, instead of introducing new semantics. We...
CONCUR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We propose a model of distributed timed systems where each component is a timed automaton with a set of local clocks that evolve at a rate independent of the clocks of th...
ICFEM
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations. While d...
FORMATS
2007
Springer
14 years 18 days ago
2007
Springer
Abstract. We describe a partial order reduction technique for a realtime component model. Components are described as timed automata with data ports, which can be composed in stati...