206 search results - page 19 / 42 » Weak Alternating Automata Are Not That Weak |
FAC
2008
13 years 7 months ago
2008
Given deterministic interfaces P and Q, we investigate the problem of synthesising an interface R such that P composed with R refines Q. We show that a solution exists iff P and Q ...
JACIII
2008
13 years 7 months ago
2008
Abstract. In this paper we introduce a multi-stage decision making procedure where decision makers' opinions are weighted by their contribution to the agreement after they sor...
WIA
2004
Springer
14 years 28 days ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
HYBRID
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In this paper, we propose a new approach for formal verification of hybrid systems. To do so, we present a new refinement proof technique, a weak refinement using step in...
FAC
2007
13 years 7 months ago
2007
Abstract. In this paper we consider two performance modelling techniques from the perspectives of model construction, generation of an underlying continuous time Markov process, an...