The following pages link to Grégoire Sutre (Q1401923):
Displaying 34 items.
- Well-abstracted transition systems: Application to FIFO automata. (Q1401924) (← links)
- On boundedness problems for pushdown vector addition systems (Q1675154) (← links)
- Co-finiteness and co-emptiness of reachability sets in vector addition systems with states (Q2280187) (← links)
- A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness (Q2842102) (← links)
- Safety Verification of Communicating One-Counter Machines (Q2957494) (← links)
- (Q3044342) (← links)
- Decidable Topologies for Communicating Automata with FIFO and Bag Channels (Q3190124) (← links)
- (Q3408150) (← links)
- On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension (Q3449486) (← links)
- The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems (Q3457800) (← links)
- Accelerated Data-Flow Analysis (Q3612002) (← links)
- Polynomial Precise Interval Analysis Revisited (Q3644736) (← links)
- (Q4426387) (← links)
- (Q4501546) (← links)
- (Q4536371) (← links)
- (Q4536629) (← links)
- Hyper-Ackermannian bounds for pushdown vector addition systems (Q4635648) (← links)
- (Q4804923) (← links)
- Reachability of Communicating Timed Processes (Q4910413) (← links)
- (Q5089304) (← links)
- (Q5090970) (← links)
- On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems (Q5090985) (← links)
- Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One (Q5111451) (← links)
- Lazy abstraction (Q5178898) (← links)
- (Q5207052) (← links)
- Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States (Q5212023) (← links)
- On the Context-Freeness Problem for Vector Addition Systems (Q5271039) (← links)
- CONCUR 2004 - Concurrency Theory (Q5311488) (← links)
- Acceleration in Convex Data-Flow Analysis (Q5458862) (← links)
- Automated Technology for Verification and Analysis (Q5491889) (← links)
- Unfolding Concurrent Well-Structured Transition Systems (Q5758140) (← links)
- Reachability Analysis of Communicating Pushdown Systems (Q5894957) (← links)
- Reachability Analysis of Communicating Pushdown Systems (Q5900852) (← links)
- Occam's razor applied to the Petri net coverability problem (Q5915567) (← links)
