The following pages link to Michael Blondin (Q347112):
Displaying 28 items.
- The complexity of intersecting finite automata having few final states (Q347114) (← links)
- Handling infinitely branching well-structured transition systems (Q1686118) (← links)
- Towards efficient verification of population protocols (Q2058386) (← links)
- Checking qualitative liveness properties of replicated systems with stochastic scheduling (Q2226750) (← links)
- Directed reachability for infinite-state systems (Q2233488) (← links)
- Approaching the coverability problem continuously (Q2272922) (← links)
- The Complexity of Intersecting Finite Automata Having Few Final States (Q2907484) (← links)
- (Q3304110) (← links)
- Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete (Q4635789) (← links)
- (Q5009428) (← links)
- Automatic Analysis of Expected Termination Time for Population Protocols (Q5009451) (← links)
- The Reachability Problem for Two-Dimensional Vector Addition Systems with States (Q5056423) (← links)
- (Q5114831) (← links)
- (Q5136306) (← links)
- (Q5144614) (← links)
- Black Ninjas in the Dark (Q5145270) (← links)
- The Complexity of Reachability in Affine Vector Addition Systems with States (Q5145633) (← links)
- (Q5155662) (← links)
- (Q5155664) (← links)
- Handling Infinitely Branching WSTS (Q5167823) (← links)
- (Q5367063) (← links)
- The Logical View on Continuous Petri Nets (Q5369247) (← links)
- Succinct Population Protocols for Presburger Arithmetic (Q5874313) (← links)
- Expressive Power of Broadcast Consensus Protocols (Q5875393) (← links)
- Continuous One-counter Automata (Q5875944) (← links)
- Separators in Continuous Petri Nets (Q6151564) (← links)
- Population protocols with unordered data (Q6638124) (← links)
- The complexity of soundness in workflow nets (Q6649450) (← links)
