The following pages link to Martin Leucker (Q444482):
Displaying 26 items.
- Three-valued abstraction for probabilistic systems (Q444484) (← links)
- Learning of event-recording automata (Q604474) (← links)
- Network invariants for real-time systems (Q1019007) (← links)
- Property-directed verification and robustness certification of recurrent neural networks (Q2147216) (← links)
- A brief account of runtime verification (Q2390027) (← links)
- Topology, monitorable properties and runtime verification (Q2453532) (← links)
- Message-passing automata are expressively equivalent to EMSO logic (Q2503037) (← links)
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus (Q2643076) (← links)
- (Q2703694) (← links)
- (Q2766537) (← links)
- (Q2847414) (← links)
- (Q2848151) (← links)
- (Q2849548) (← links)
- (Q2851066) (← links)
- A Robust Class of Data Languages and an Application to Learning (Q2938772) (← links)
- Ordered Navigation on Multi-attributed Data Words (Q3190138) (← links)
- (Q3225714) (← links)
- Regular Linear Temporal Logic (Q3525092) (← links)
- Learning Meets Verification (Q3525110) (← links)
- Impartial Anticipation in Runtime-Verification (Q3540087) (← links)
- Abstraction for Stochastic Systems by Erlang’s Method of Stages (Q3541024) (← links)
- Comparing LTL Semantics for Runtime Verification (Q3569195) (← links)
- Learning Workflow Petri Nets (Q3569868) (← links)
- Inferring Network Invariants Automatically (Q3613429) (← links)
- Model-Checking Counting Temporal Logics on Flat Structures (Q5111643) (← links)
- CONCUR 2004 - Concurrency Theory (Q5311471) (← links)
