Pages that link to "Item:Q2735908"
From MaRDI portal
The following pages link to On the decidability of correctness problems for a communicating automata net (Q2735908):
Displaying 5 items.
- Verifying identical communicating processes is undecidable (Q1269916) (← links)
- Boundedness, empty channel detection, and synchronization for communicating finite automata (Q1819939) (← links)
- On the bound of algorithmic resolvability of correctness problems of automaton interaction through communication channels (Q1974312) (← links)
- A characterization of definable communicating systems (Q2720916) (← links)
- Synchronizability of communicating finite state machines is not decidable (Q5111454) (← links)