Pages that link to "Item:Q3457774"
From MaRDI portal
The following pages link to Verifying Communicating Multi-pushdown Systems via Split-Width (Q3457774):
Displaying 8 items.
- Realizability of concurrent recursive programs (Q1620953) (← links)
- Leafy automata for higher-order concurrency (Q2233404) (← links)
- The complexity of model checking multi-stack systems (Q2398213) (← links)
- Verification of Parameterized Communicating Automata via Split-Width (Q2811340) (← links)
- (Q5028474) (← links)
- Non axiomatisability of positive relation algebras with constants, via graph homomorphisms (Q5089316) (← links)
- Data Multi-Pushdown Automata (Q5111652) (← links)
- Decidable models of integer-manipulating programs with recursive parallelism (Q5915566) (← links)