The following pages link to Pierre-Alain Reynier (Q1622949):
Displaying 50 items.
- From two-way transducers to regular function expressions (Q1622950) (← links)
- Decision problems of tree transducers with origin (Q1641005) (← links)
- Visibly pushdown transducers (Q1672009) (← links)
- Copyful streaming string transducers (Q1685783) (← links)
- Optimal and robust controller synthesis using energy timed automata with uncertainty (Q1996422) (← links)
- Optimal and robust controller synthesis. Using energy timed automata with uncertainty (Q2024347) (← links)
- On computability of data word functions defined by transducers (Q2200823) (← links)
- On the computation of the minimal coverability set of Petri nets (Q2330599) (← links)
- Trimming visibly pushdown automata (Q2344743) (← links)
- Timed Petri nets and timed automata: On the discriminating power of Zeno sequences (Q2475807) (← links)
- Aperiodic String Transducers (Q2817381) (← links)
- Robust Controller Synthesis in Timed Automata (Q2842132) (← links)
- On characteristic formulae for Event-Recording Automata (Q2842241) (← links)
- (Q2911634) (← links)
- Robustness of Time Petri Nets under Guard Enlargement (Q2968522) (← links)
- Optimal Reachability in Divergent Weighted Timed Games (Q2988366) (← links)
- Degree of Sequentiality of Weighted Automata (Q2988370) (← links)
- Quantitative Robustness Analysis of Flat Timed Automata (Q3000612) (← links)
- Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning (Q3011882) (← links)
- Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness (Q3167498) (← links)
- A Hierarchical Approach for the Synthesis of Stabilizing Controllers for Hybrid Systems (Q3172915) (← links)
- Weak Time Petri Nets Strike Back! (Q3184699) (← links)
- Probabilistic Robust Timed Games (Q3190118) (← links)
- Decision Problems of Tree Transducers with Origin (Q3449477) (← links)
- Timed Unfoldings for Networks of Timed Automata (Q3522916) (← links)
- Robust Model-Checking of Linear-Time Properties in Timed Automata (Q3525763) (← links)
- Properties of Visibly Pushdown Transducers (Q3586097) (← links)
- Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences (Q3591404) (← links)
- Automatic Synthesis of Robust and Optimal Controllers – An Industrial Case Study (Q3624564) (← links)
- Undecidability Results for Timed Automata with Silent Transitions (Q3635988) (← links)
- Two-Way Visibly Pushdown Automata and Transducers (Q4635877) (← links)
- A Generalised Twinning Property for Minimisation of Cost Register Automata (Q4635950) (← links)
- Controllers with Minimal Observation Power (Application to Timed Systems) (Q4649298) (← links)
- Aperiodic String Transducers (Q4683232) (← links)
- Robustness of Time Petri Nets under Guard Enlargement (Q4899146) (← links)
- Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning (Q4914290) (← links)
- Copyful Streaming String Transducers (Q4989167) (← links)
- (Q4994131) (← links)
- Reaching Your Goal Optimally by Playing at Random with No Memory (Q5089292) (← links)
- Symbolic Approximation of Weighted Timed Games (Q5090965) (← links)
- (Q5092330) (← links)
- (Q5101342) (← links)
- From Two-Way to One-Way Finite State Transducers (Q5271084) (← links)
- Trimming Visibly Pushdown Automata (Q5327485) (← links)
- (Q5376652) (← links)
- Robust Analysis of Timed Automata Via Channel Machines (Q5458357) (← links)
- (Q5856426) (← links)
- From Two-Way Transducers to Regular Function Expressions (Q5859650) (← links)
- Synthesis of Data Word Transducers (Q5875385) (← links)
- Visibly Pushdown Transducers with Well-Nested Outputs (Q5890815) (← links)
