Pages that link to "Item:Q1856175"
From MaRDI portal
The following pages link to A minimized automaton representation of reachable states (Q1856175):
Displaying 6 items.
- An invariant-based approach to the verification of asynchronous parameterized networks (Q604385) (← links)
- Flash memory efficient LTL model checking (Q617930) (← links)
- An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
- On automation in the verification of software barriers: experience report (Q2351145) (← links)
- More efficient on-the-fly LTL verification with Tarjan's algorithm (Q2575734) (← links)
- Minimization of Visibly Pushdown Automata Using Partial Max-SAT (Q3303909) (← links)
