Pages that link to "Item:Q2965467"
From MaRDI portal
The following pages link to Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk). (Q2965467):
Displaying 16 items.
- Parametric runtime verification is NP-complete and coNP-complete (Q522961) (← links)
- Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates (Q680540) (← links)
- Parameterized model checking of rendezvous systems (Q1635829) (← links)
- An automata-theoretic approach to the verification of distributed algorithms (Q1706162) (← links)
- Parameterized verification of coverability in infinite state broadcast networks (Q2029598) (← links)
- Liveness in broadcast networks (Q2676223) (← links)
- (Q3384884) (← links)
- Parameterized Verification of Communicating Automata under Context Bounds (Q3447694) (← links)
- (Q5089313) (← links)
- (Q5111624) (← links)
- (Q5227517) (← links)
- (Q5856427) (← links)
- Fine-grained complexity of safety verification (Q5919003) (← links)
- Round- and context-bounded control of dynamic pushdown systems (Q6564172) (← links)
- On the satisfiability of local first-order logics with data (Q6597951) (← links)
- Stochastic games with synchronizing objectives (Q6649478) (← links)