Travelled to:1 × Belgium
1 × Germany
1 × Greece
1 × Italy
1 × Portugal
1 × Spain
1 × United Kingdom
Collaborated with:∅ A.Slissenko J.Pin M.Nivat D.Niwinski T.Crolard E.Prokofieva A.M.Rabinovich
Talks about:infinit (3) time (3) automaton (2) automata (2) ration (2) factor (2) model (2) logic (2) check (2) about (2)
Person: Danièle Beauquier
DBLP: Beauquier:Dani=egrave=le
Contributed to:
2004
2002
1998
1989198719851984
19931997Wrote 9 papers:
- TACAS-2004-BeauquierCP #automation #first-order #logic #parametricity #protocol #state machine #verification
- Automatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic (DB, TC, EP), pp. 372–387.
- CSL-2002-BeauquierRS #decidability #logic #model checking #probability
- A Logic of Probability with Decidable Model-Checking (DB, AMR, AS), pp. 306–321.
- FoSSaCS-1998-Beauquier #automaton
- Pumping Lemmas for Timed Automata (DB), pp. 81–94.
- ICALP-1989-BeauquierP #word
- Factors of Words (DB, JÉP), pp. 63–79.
- ICALP-1987-Beauquier #automaton
- Minimal Automaton of a Rational Cover (DB), pp. 174–189.
- ICALP-1985-BeauquierN #set #word
- About Rational Sets of Factors of a Bi-Infinite Word (DB, MN), pp. 33–42.
- ICALP-1984-Girault-Beauquier #automaton #behaviour #finite #infinity
- Some Results About Finite and Infinite Behaviours of a Pushdown Automaton (DB), pp. 187–195.
- TAPSOFT-1993-BeauquirerN #automaton #constraints #infinity
- Automata on Infinite Trees with Counting Constraints (DB, DN), pp. 266–281.
- TAPSOFT-1997-BeauquierS #algorithm #model checking #problem #semantics #towards
- The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages (DB, AS), pp. 201–212.