The following pages link to (Q3780411):
Displaying 10 items.
- Testing for unboundedness of fifo channels (Q685434) (← links)
- The complexity of reachability in distributed communicating processes (Q1098622) (← links)
- Reduction and covering of infinite reachability trees (Q1173681) (← links)
- Analysis of a class of communicating finite state machines (Q1323365) (← links)
- Well-abstracted transition systems: Application to FIFO automata. (Q1401924) (← links)
- A multiparameter analysis of the boundedness problem for vector addition systems (Q1819938) (← links)
- Communicating processes, scheduling, and the complexity of nontermination (Q3034829) (← links)
- Undecidable verification problems for programs with unreliable channels (Q4632436) (← links)
- (Q5028474) (← links)
- Non axiomatisability of positive relation algebras with constants, via graph homomorphisms (Q5089316) (← links)
