The following pages link to M. Praveen (Q1949743):
Displaying 21 items.
- Small vertex cover makes Petri net coverability and boundedness easier (Q1949744) (← links)
- Checking regular invariance under tightly-controlled string modifications (Q2163978) (← links)
- ω-Petri Nets: Algorithms and Complexity (Q2805418) (← links)
- Reasoning about Data Repetitions with Counter Systems (Q2818761) (← links)
- A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness (Q2842102) (← links)
- Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE (Q2920142) (← links)
- Extending the Rackoff technique to Affine nets (Q2957508) (← links)
- Parameterized Complexity Results for 1-safe Petri Nets (Q3090841) (← links)
- Playing with Repetitions in Data Words Using Energy Games (Q3300789) (← links)
- Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity (Q4598259) (← links)
- Hyper-Ackermannian bounds for pushdown vector addition systems (Q4635648) (← links)
- Analyzing Reachability for Some Petri Nets With Fast Growing Markings (Q4982096) (← links)
- (Q5129947) (← links)
- (Q5207052) (← links)
- Reasoning about Data Repetitions with Counter Systems (Q5271038) (← links)
- ω-Petri Nets (Q5300865) (← links)
- Verification of Flat FIFO Systems (Q5875373) (← links)
- Query Preserving Watermarking Schemes for Locally Treelike Databases. (Q5875671) (← links)
- Does Treewidth Help in Modal Satisfiability? (Q5892171) (← links)
- Does Treewidth Help in Modal Satisfiability? (Q5901156) (← links)
- Realizability problem for constraint LTL (Q6178458) (← links)
