The following pages link to Béatrice Bérard (Q453511):
Displaying 50 items.
- Interrupt timed automata: verification and expressiveness (Q453513) (← links)
- Probabilistic opacity for Markov decision processes (Q458386) (← links)
- (Q672020) (redirect page) (← links)
- Untiming timed languages (Q672021) (← links)
- (Q944370) (redirect page) (← links)
- When are timed automata weakly timed bisimilar to time Petri nets? (Q944375) (← links)
- Literal shuffle (Q1098321) (← links)
- Global serializability of concurrent programs (Q1318722) (← links)
- A compared study of two correctness proofs for the standardized algorithm of ABR conformance (Q1395676) (← links)
- Accepting zeno words: A way toward timed refinements (Q1581898) (← links)
- Timed automata and additive clock constraints (Q1583056) (← links)
- The complexity of diagnosability and opacity verification for Petri nets (Q1662539) (← links)
- Polynomial interrupt timed automata (Q1675144) (← links)
- Opacity for linear constraint Markov chains (Q1745942) (← links)
- The expressive power of time Petri nets (Q1944773) (← links)
- Revisiting reachability in polynomial interrupt timed automata (Q2059890) (← links)
- Corrigendum to: ``Revisiting reachability in polynomial interrupt timed automata'' (Q2059913) (← links)
- Synthesis in presence of dynamic links (Q2105465) (← links)
- Parameterized synthesis for fragments of first-order logic over data words (Q2200816) (← links)
- Formal verification of mobile robot protocols (Q2359768) (← links)
- Timed substitutions for regular signal-event languages (Q2385194) (← links)
- Polynomial interrupt timed automata: verification and expressiveness (Q2662502) (← links)
- Concurrent Games on VASS with Inhibition (Q2914363) (← links)
- Interrupt Timed Automata with Auxiliary Clocks and Parameters* (Q2968523) (← links)
- Intersection of Regular Signal-Event (Timed) Languages (Q3511222) (← links)
- Refinements and Abstractions of Signal-Event (Timed) Languages (Q3511223) (← links)
- Timed Temporal Logics for Abstracting Transient States (Q3522919) (← links)
- Interrupt Timed Automata (Q3617730) (← links)
- (Q3740263) (← links)
- (Q3742747) (← links)
- (Q4264103) (← links)
- (Q4270057) (← links)
- (Q4508291) (← links)
- On the power of non-observable actions in timed automata (Q4593936) (← links)
- The Complexity of Diagnosability and Opacity Verification for Petri Nets (Q4686521) (← links)
- (Q4699292) (← links)
- (Q4728261) (← links)
- (Q4817536) (← links)
- CHANNEL SYNTHESIS FOR FINITE TRANSDUCERS (Q4923278) (← links)
- (Q5020999) (← links)
- (Q5079750) (← links)
- (Q5090956) (← links)
- (Q5136302) (← links)
- Proving convergence of self-stabilizing systems using first-order rewriting and regular languages (Q5138353) (← links)
- Parametric Interrupt Timed Automata (Q5168513) (← links)
- Channel Synthesis Revisited (Q5404908) (← links)
- Automated Technology for Verification and Analysis (Q5491871) (← links)
- An Introduction to Timed Automata (Q5496927) (← links)
- Petri Nets with Time (Q5496934) (← links)
- (Q5740413) (← links)
