Pages that link to "Item:Q1323365"
From MaRDI portal
The following pages link to Analysis of a class of communicating finite state machines (Q1323365):
Displaying 14 items.
- Exposure to deadlock for communicating processes is hard to detect (Q1064050) (← links)
- The complexity of reachability in distributed communicating processes (Q1098622) (← links)
- Verification in loosely synchronous queue-connected discrete timed automata. (Q1401187) (← links)
- Counter machines and verification problems. (Q1853523) (← links)
- Algorithmic analysis of programs with well quasi-ordered domains. (Q1854355) (← links)
- Eliminating the storage tape in reachability constructions. (Q1874416) (← links)
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata (Q2496297) (← links)
- A characterization of definable communicating systems (Q2720916) (← links)
- Safety Verification of Communicating One-Counter Machines (Q2957494) (← links)
- Context-Bounded Analysis of Concurrent Queue Systems (Q5458334) (← links)
- Developments in Language Theory (Q5711975) (← links)
- (Q5856424) (← links)
- A Sound Algorithm for Asynchronous Session Subtyping (Q5875400) (← links)
- Complete multiparty session type projection with automata (Q6535693) (← links)