We show a Kleene theorem for existentially bounded communicating automata, namely the equivalence between communicating automata, globally cooperative ...
We show a Kleene theorem for existentially bounded communicat- ing automata, namely the equivalence between communicating automata, globally- cooperative ...
Appeared in: Information and Computation 204:920–956, 2006. A Kleene Theorem and Model Checking Algorithms for Existentially Bounded Communicating Automata.
A Kleene theorem and model checking algorithms for existentially bounded communicating automata. Blaise Genest (1) , Dietrich Kuske (2) , Anca Muscholl (3).
We show in this paper the equivalence of several formalisms over existentially bounded models: monadic second order logic, communicating automata and globally- ...
A Kleene theorem and model checking algorithms for existentially bounded communicating automata. B Genest, D Kuske, A Muscholl. Information and Computation 204 ...
We show in this paper the equivalence of several formalisms over existentially bounded models: monadic second order logic, communicating automata and globally- ...
A Kleene theorem and model checking algorithms for ... - dblp
dblp1.uni-trier.de › iandc › GenestKM06
Blaise Genest, Dietrich Kuske, Anca Muscholl: A Kleene theorem and model checking algorithms for existentially bounded communicating automata. Inf. Comput.
We review the characterization of communicating finite-state machines whose behaviors have universally or existentially bounded channels.
10. B. Genest, D. Kuske, and A. Muscholl. A Kleene theorem and model check- ing algorithms for existentially bounded communicating automata.