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...
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...
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 ...
Peter Bulychev, Thomas Chatain, Alexandre David, K...
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...