The following pages link to Serge Haddad (Q314812):
Displaying 50 items.
- Optimal constructions for active diagnosis (Q314815) (← links)
- Interrupt timed automata: verification and expressiveness (Q453513) (← links)
- Expressiveness and conciseness of timed automata for the verification of stochastic models (Q782571) (← links)
- Sub-stochastic matrix analysis for bounds computation -- theoretical results (Q852968) (← links)
- (Q944372) (redirect page) (← links)
- When are timed automata weakly timed bisimilar to time Petri nets? (Q944375) (← links)
- Polynomial interrupt timed automata (Q1675144) (← links)
- Memoryless determinacy of finite parity games: another simple proof (Q1705645) (← links)
- The expressive power of time Petri nets (Q1944773) (← links)
- Ordinal theory for expressiveness of well-structured transition systems (Q1951597) (← links)
- Guarded autonomous transitions increase conciseness and expressiveness of timed automata (Q1996031) (← links)
- Commodification of accelerations for the Karp and Miller construction (Q2058566) (← links)
- Revisiting reachability in polynomial interrupt timed automata (Q2059890) (← links)
- Corrigendum to: ``Revisiting reachability in polynomial interrupt timed automata'' (Q2059913) (← links)
- A turn-based approach for qualitative time concurrent games (Q2117153) (← links)
- Property-directed verification and robustness certification of recurrent neural networks (Q2147216) (← links)
- Minimal coverability tree construction made complete and efficient (Q2200824) (← links)
- Diagnosis and degradation control for probabilistic systems (Q2220350) (← links)
- Approaching the coverability problem continuously (Q2272922) (← links)
- A tale of two diagnoses in probabilistic systems (Q2280320) (← links)
- Recursive Petri nets (Q2464034) (← links)
- Timed Petri nets and timed automata: On the discriminating power of Zeno sequences (Q2475807) (← links)
- Interval iteration algorithm for MDPs and IMDPs (Q2636515) (← links)
- Polynomial interrupt timed automata: verification and expressiveness (Q2662502) (← links)
- Accurate Approximate Diagnosability of Stochastic Systems (Q2798748) (← links)
- Complexity Analysis of Continuous Petri Nets (Q2805416) (← links)
- Specification of Asynchronous Component Systems with Modal I/O-Petri Nets (Q2830035) (← links)
- Refinement and Asynchronous Composition of Modal Petri Nets (Q2889610) (← links)
- Coupling and Importance Sampling for Statistical Model Checking (Q2894280) (← links)
- Concurrent Games on VASS with Inhibition (Q2914363) (← links)
- (Q2963940) (← links)
- Interrupt Timed Automata with Auxiliary Clocks and Parameters* (Q2968523) (← links)
- (Q2978532) (← links)
- The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets (Q2986811) (← links)
- Ordinal Theory for Expressiveness of Well Structured Transition Systems (Q3000606) (← links)
- Synthesis and Analysis of Product-Form Petri Nets (Q3011895) (← links)
- Reachability in MDPs: Refining Convergence of Value Iteration (Q3447700) (← links)
- Continuous Petri Nets: Expressive Power and Decidability Issues (Q3510807) (← links)
- On the Computational Power of Timed Differentiable Petri Nets (Q3511238) (← links)
- Timed Unfoldings for Networks of Timed Automata (Q3522916) (← links)
- CONTINUOUS PETRI NETS: EXPRESSIVE POWER AND DECIDABILITY ISSUES (Q3552522) (← links)
- Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences (Q3591404) (← links)
- Transactional Reduction of Component Compositions (Q3612363) (← links)
- Interrupt Timed Automata (Q3617730) (← links)
- A New Approach to the Evaluation of Non Markovian Stochastic Petri Nets (Q3618707) (← links)
- Undecidability Results for Timed Automata with Silent Transitions (Q3635988) (← links)
- (Q3776648) (← links)
- (Q4263301) (← links)
- (Q4535177) (← links)
- Diagnosis in Infinite-State Probabilistic Systems (Q4608690) (← links)
