Pages that link to "Item:Q1049401"
From MaRDI portal
The following pages link to An efficient simulation algorithm based on abstract interpretation (Q1049401):
Displaying 12 items.
- Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation (Q453545) (← links)
- Generalizing the Paige-Tarjan algorithm by abstract interpretation (Q924726) (← links)
- Transformational design and implementation of a new efficient solution to the ready simulation problem (Q1899135) (← links)
- Employing behavioral preorders to define controllability for nondeterministic discrete-event systems (Q2348368) (← links)
- An efficient simulation algorithm on Kripke structures (Q2453984) (← links)
- A space-efficient simulation algorithm on probabilistic automata (Q2629854) (← links)
- Saving space in a time efficient simulation algorithm (Q2895774) (← links)
- Rank and simulation: the well-founded case (Q3458888) (← links)
- (Q4994701) (← links)
- A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata (Q5170274) (← links)
- Process equivalence problems as energy games (Q6535628) (← links)
- Simulations in rank-based Büchi automata complementation (Q6536321) (← links)