Pages that link to "Item:Q5326330"
From MaRDI portal
The following pages link to Runtime Verification Based on Register Automata (Q5326330):
Displaying 12 items.
- Gate automata-driven run-time enforcement (Q418362) (← links)
- Regular and context-free nominal traces (Q530218) (← links)
- A theory of monitors (Q2051767) (← links)
- Coalgebraic semantics for nominal automata (Q2104476) (← links)
- Reachability in pushdown register automata (Q2396722) (← links)
- Automatic verification of fault-tolerant register emulations (Q2852016) (← links)
- Polynomial-time equivalence testing for deterministic fresh-register automata (Q5005176) (← links)
- (Q5028487) (← links)
- (Q5089311) (← links)
- Assumption-based runtime verification (Q6102167) (← links)
- Runtime Verification with Imperfect Information Through Indistinguishability Relations (Q6111611) (← links)
- Automata and grammars for data words (Q6666782) (← links)