The following pages link to Antti Valmari (Q216118):
Displaying 50 items.
- Lumpability abstractions of rule-based systems (Q418843) (← links)
- Fast brief practical DFA minimization (Q437674) (← links)
- Repairing time-determinism in the process algebra for hybrid systems (Q442292) (← links)
- The weakest deadlock-preserving congruence (Q673911) (← links)
- A stubborn attack on state explosion (Q685106) (← links)
- (Q862860) (redirect page) (← links)
- Question-guided stubborn set methods for state properties (Q862861) (← links)
- Essential transitions to bisimulation equivalences (Q1391753) (← links)
- Stubborn sets with frozen actions (Q1685794) (← links)
- Safety property-driven stubborn sets (Q1708658) (← links)
- More stubborn set methods for process algebras (Q1708720) (← links)
- Compositional failure-based semantic models for basic LOTOS (Q1903079) (← links)
- Mixed sessions (Q2055956) (← links)
- All congruences below stability-preserving fair testing or CFFD (Q2182664) (← links)
- Translating between models of concurrency (Q2182666) (← links)
- The inconsistent labelling problem of stutter-preserving partial-order reduction (Q2200842) (← links)
- On constructibility and unconstructibility of LTS operators from other LTS operators (Q2340256) (← links)
- Nested-unit Petri nets (Q2423743) (← links)
- Parameterized model checking of weighted networks (Q2447757) (← links)
- More efficient on-the-fly LTL verification with Tarjan's algorithm (Q2575734) (← links)
- (Q2766568) (← links)
- Fair Testing and Stubborn Sets (Q2814628) (← links)
- All Linear-Time Congruences for Familiar Operators (Q2865064) (← links)
- (Q2866408) (← links)
- Old and New Algorithms for Minimal Coverability Sets (Q2908208) (← links)
- All Linear-Time Congruences for Familiar Operators Part 2: Infinite LTSs (Q2914369) (← links)
- Asymptotic Proportion of Hard Instances of the Halting Problem (Q2937541) (← links)
- Constructing Minimal Coverability Sets (Q2968530) (← links)
- Simple Bisimilarity Minimization in O(m log n) Time (Q3084988) (← links)
- (Q3225722) (← links)
- Simple O(m logn) Time Markov Chain Lumping (Q3557064) (← links)
- Can Stubborn Sets Be Optimal? (Q3569861) (← links)
- Bisimilarity Minimization in O(m logn) Time (Q3636842) (← links)
- Exploring the Scope for Partial Order Reduction (Q3648689) (← links)
- (Q4037087) (← links)
- (Q4037380) (← links)
- (Q4270078) (← links)
- (Q4353636) (← links)
- (Q4426377) (← links)
- (Q4484486) (← links)
- (Q4518900) (← links)
- (Q4532076) (← links)
- Compositionality in state space verification methods (Q4633153) (← links)
- (Q4791836) (← links)
- (Q4791838) (← links)
- Efficient Minimization of DFAs with Partial Transition Functions (Q4910757) (← links)
- Does the Shannon bound really apply to all data structures? (Q4917531) (← links)
- External Behaviour of Systems of State Machines with Variables (Q4924450) (← links)
- Stubborn Sets, Frozen Actions, and Fair Testing (Q4989170) (← links)
- Stubborn Set Intuition Explained (Q4994076) (← links)
