Pages that link to "Item:Q2978552"
From MaRDI portal
The following pages link to Parameterized communicating automata: complementation and model checking (Q2978552):
Displaying 7 items.
- On the bound of algorithmic resolvability of correctness problems of automaton interaction through communication channels (Q1974312) (← links)
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata (Q2496297) (← links)
- On the decidability of correctness problems for a communicating automata net (Q2735908) (← links)
- Verification of Parameterized Communicating Automata via Split-Width (Q2811340) (← links)
- Parameterized Verification of Communicating Automata under Context Bounds (Q3447694) (← links)
- Logic for communicating automata with parameterized topology (Q4635601) (← links)
- Generalized Communicating P Automata (Q4982997) (← links)