Pages that link to "Item:Q685434"
From MaRDI portal
The following pages link to Testing for unboundedness of fifo channels (Q685434):
Displaying 10 items.
- Well-abstracted transition systems: Application to FIFO automata. (Q1401924) (← links)
- Automated verification of automata communicating via FIFO and bag buffers (Q1650866) (← links)
- Quasi-static scheduling of communicating tasks (Q1959479) (← links)
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations (Q1960526) (← links)
- Branch-well-structured transition systems and extensions (Q2165211) (← links)
- Verification of programs with half-duplex communication (Q2573635) (← links)
- (Q5028474) (← links)
- Non axiomatisability of positive relation algebras with constants, via graph homomorphisms (Q5089316) (← links)
- (Q5129947) (← links)
- Verification of Flat FIFO Systems (Q5875373) (← links)
