Pages that link to "Item:Q3393383"
From MaRDI portal
The following pages link to Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall (Q3393383):
Displaying 3 items.
- Model-checking graded computation-tree logic with finite path semantics (Q2285155) (← links)
- Uniform strategies, rational relations and jumping automata (Q2346407) (← links)
- Synchronous or alternating? LTL black-box checking of Mealy machines by combining the LearnLib and LTSmin (Q6165822) (← links)