The following pages link to Developments in Language Theory (Q5711975):
Displaying 7 items.
- On the bound of algorithmic resolvability of correctness problems of automaton interaction through communication channels (Q1974312) (← links)
- Kleene theorems for free choice automata over distributed alphabets (Q2032915) (← links)
- Infinite-state high-level MSCs: model-checking and realizability (Q2495403) (← links)
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata (Q2496297) (← links)
- Message-passing automata are expressively equivalent to EMSO logic (Q2503037) (← links)
- On the decidability of correctness problems for a communicating automata net (Q2735908) (← links)
- Communicating Finite-State Machines and Two-Variable Logic (Q3304111) (← links)