321 search results - page 9 / 65 » Symbolic Model Checking for Probabilistic Timed Automata |
ICALP
1997
Springer
14 years 28 days ago
1997
Springer
FORMATS
2006
Springer
14 years 13 days ago
2006
Springer
Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event o...
ASIAN
2003
Springer
14 years 2 months ago
2003
Springer
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
FORMATS
2009
Springer
14 years 19 days ago
2009
Springer
Abstract In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. We define timed weak ...
ENTCS
2008
13 years 8 months ago
2008
Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of...