The following pages link to Olga Kouchnarenko (Q442147):
Displaying 29 items.
- (Q344513) (redirect page) (← links)
- The emptiness problem for tree automata with at least one global disequality constraint is NP-hard (Q344514) (← links)
- Loops and overloops for tree-walking automata (Q442148) (← links)
- Component simulation-based substitutivity managing QoS and composition issues (Q988175) (← links)
- Opacity for linear constraint Markov chains (Q1745942) (← links)
- Test generation from event system abstractions to cover their states and transitions (Q2216864) (← links)
- (Q2764139) (← links)
- From Linear Temporal Logic Properties to Rewrite Propositions (Q2908502) (← links)
- On Positive TAGED with a Bounded Number of Constraints (Q2914722) (← links)
- Automatic Decidability: A Schematic Calculus for Theories with Counting Operators (Q2958392) (← links)
- Reduction of Workflow Nets for Generalised Soundness Verification (Q2961558) (← links)
- A Rule-Based Framework for Building Superposition-Based Decision Procedures (Q3164838) (← links)
- Constraint Solving for Verifying Modal Specifications of Workflow Nets with Data (Q3179169) (← links)
- (Q3181700) (← links)
- How to Verify and Exploit a Refinement of Component-Based Systems (Q3401955) (← links)
- Finer Is Better: Abstraction Refinement for Rewriting Approximations (Q3522008) (← links)
- Handling Algebraic Properties in Automatic Analysis of Security Protocols (Q3525147) (← links)
- TAGED Approximations for Temporal Properties Model-Checking (Q3637350) (← links)
- HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA (Q3646168) (← links)
- How to Tackle Integer Weighted Automata Positivity (Q3646253) (← links)
- (Q4436980) (← links)
- (Q4472200) (← links)
- When Structural Refinement of Components Keeps Temporal Properties over Reconfigurations (Q4647842) (← links)
- Handling Left-Quadratic Rules When Completing Tree Automata (Q4982086) (← links)
- Approximating Event System Abstractions by Covering Their States and Transitions (Q4989673) (← links)
- Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives (Q5179050) (← links)
- Loops and Overloops for Tree Walking Automata (Q5200062) (← links)
- Algebraic Methodology and Software Technology (Q5312987) (← links)
- Enhancing Approximations for Regular Reachability Analysis (Q5327507) (← links)
