Travelled to:1 × Australia
1 × Austria
1 × Cyprus
1 × Czech Republic
1 × Iceland
1 × India
1 × Italy
1 × Japan
1 × Poland
1 × Portugal
1 × South Africa
1 × Switzerland
1 × The Netherlands
2 × Denmark
2 × Germany
2 × Hungary
2 × United Kingdom
3 × France
7 × USA
Collaborated with:L.Doyen T.A.Henzinger L.V.Begin G.Delzanno V.Bruyère E.Filiot P.Schobbens P.Ganty R.Brenguier M.D.Wulf M.Randour O.Sankur T.Brihaye N.Meunier N.Maquet N.Jin L.Clemente K.Chatterjee G.Geeraerts F.Servais A.Bohy M.Sassolas P.Cousot P.Hunter G.A.Pérez V.S.Prabhu R.Majumdar F.Y.C.Mang A.Degorre R.Gentilini S.Torunczyk A.Claßen P.Heymans A.Legay N.Basset I.Jecker A.Pauly M.v.d.Bogaard J.Ouaknine J.Worrell
Talks about:game (9) time (7) algorithm (6) automata (5) abstract (5) check (5) antichain (4) regular (4) payoff (4) model (4)
♂ Person: Jean-François Raskin
DBLP: Raskin:Jean=Fran=ccedil=ois
Facilitated 1 volumes:
PblChContributed to:
20152015
2015
2015
201520142014
20132012
20112010
201020102009
200920082008
20082007
200720072006200620062005
200520022001200020001998199720162018Wrote 35 papers:
- CAV-2015-BrenguierR #game studies #multi
- Pareto Curves of Multidimensional Mean-Payoff Games (RB, JFR), pp. 251–267.
- CAV-2015-RandourRS #markov #multi #process #query
- Percentile Queries in Multi-dimensional Markov Decision Processes (MR, JFR, OS), pp. 123–139.
- CSL-2015-BrihayeBMR #reachability
- Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability (TB, VB, NM, JFR), pp. 504–518.
- LICS-2015-ClementeR #multi #problem #worst-case
- Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives (LC, JFR), pp. 257–268.
- VMCAI-2015-RandourRS #probability #problem
- Variations on the Stochastic Shortest Path Problem (MR, JFR, OS), pp. 1–18.
- LICS-CSL-2014-BrenguierRS #complexity #game studies
- The complexity of admissibility in ω-regular games (RB, JFR, MS), p. 10.
- LICS-CSL-2014-BruyereMR #game studies
- Secure equilibria in weighted games (VB, NM, JFR), p. 26.
- VMCAI-2014-Chatterjee0FR #game studies
- Doomsday Equilibria for Omega-Regular Games (KC, LD, EF, JFR), pp. 78–97.
- TACAS-2013-BohyBFR #ltl #specification #synthesis
- Synthesis from LTL Specifications with Mean-Payoff Objectives (AB, VB, EF, JFR), pp. 169–184.
- CAV-2012-BohyBFJR #ltl #synthesis
- Acacia+, a Tool for LTL Synthesis (AB, VB, EF, NJ, JFR), pp. 652–657.
- ICALP-v2-2011-BrihayeDGORW #automaton #bound #hybrid #on the #reachability
- On Reachability for Hybrid Automata over Bounded Time (TB, LD, GG, JO, JFR, JW), pp. 416–427.
- CSL-2010-DegorreDGRT #energy #game studies
- Energy and Mean-Payoff Games with Imperfect Information (AD, LD, RG, JFR, ST), pp. 260–274.
- ICSE-2010-ClassenHSLR #model checking #performance #product line #verification
- Model checking lots of systems: efficient verification of temporal properties in software product lines (AC, PH, PYS, AL, JFR), pp. 335–344.
- TACAS-2010-DoyenR #algorithm #automaton #finite
- Antichain Algorithms for Finite Automata (LD, JFR), pp. 2–22.
- CAV-2009-FiliotJR #algorithm #ltl
- An Antichain Algorithm for LTL Realizability (EF, NJ, JFR), pp. 263–277.
- CIAA-2009-GantyMR #abstraction #automaton #fixpoint #refinement
- Fixpoint Guided Abstraction Refinement for Alternating Automata (PG, NM, JFR), pp. 155–164.
- ICALP-B-2008-RaskinS #automaton #transducer
- Visibly Pushdown Transducers (JFR, FS), pp. 386–397.
- TACAS-2008-WulfDMR #algorithm #anti #ltl #model checking #named #satisfiability
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking (MDW, LD, NM, JFR), pp. 63–77.
- DLT-J-2007-DoyenHR08 #equivalence #markov
- Equivalence of Labeled Markov Chains (LD, TAH, JFR), pp. 549–563.
- ICALP-2007-BrihayeHPR #game studies #reachability
- Minimum-Time Reachability in Timed Games (TB, TAH, VSP, JFR), pp. 825–837.
- SAS-2007-CousotGR #abstraction
- Fixpoint-Guided Abstraction Refinements (PC, PG, JFR), pp. 333–348.
- TACAS-2007-DoyenR #algorithm #approach #model checking
- Improved Algorithms for the Automata-Based Approach to Model-Checking (LD, JFR), pp. 451–465.
- CAV-2006-WulfDHR #algorithm #anti #automaton #finite #named
- Antichains: A New Algorithm for Checking Universality of Finite Automata (MDW, LD, TAH, JFR), pp. 17–30.
- CSL-2006-ChatterjeeDHR #algorithm #game studies
- Algorithms for ω-Regular Games with Imperfect Information (KC, LD, TAH, JFR), pp. 287–302.
- VMCAI-2006-GantyRB #abstract interpretation #framework
- A Complete Abstract Interpretation Framework for Coverability Properties of WSTS (PG, JFR, LVB), pp. 49–64.
- CAV-2005-GeeraertsRB #performance
- Expand, Enlarge and Check... Made Efficient (GG, JFR, LVB), pp. 394–407.
- FM-2005-WulfDR #implementation #modelling #realtime
- Systematic Implementation of Real-Time Models (MDW, LD, JFR), pp. 139–156.
- TACAS-2002-DelzannoRB #automation #java #parallel #source code #thread #towards #verification
- Towards the Automated Verification of Multithreaded Java Programs (GD, JFR, LVB), pp. 173–187.
- CAV-2001-DelzannoRB #explosion
- Attacking Symbolic State Explosion (GD, JFR, LVB), pp. 298–310.
- SAS-2000-HenzingerMMR #abstract interpretation #game studies
- Abstract Interpretation of Game Properties (TAH, RM, FYCM, JFR), pp. 220–239.
- TACAS-2000-DelzannoR #representation #set
- Symbolic Representation of Upward-Closed Sets (GD, JFR), pp. 426–440.
- ICALP-1998-HenzingerRS #realtime
- The Regular Real-Time Languages (TAH, JFR, PYS), pp. 580–591.
- TACAS-1997-RaskinS #abstraction #logic #realtime
- Real-Time Logics: Fictitious Clock as an Abstraction of Dense Time (JFR, PYS), pp. 165–182.
- CSL-2016-HunterPR #game studies
- Minimizing Regret in Discounted-Sum Games (PH, GAP, JFR), p. 17.
- CSL-2018-BassetJPRB
- Beyond Admissibility: Dominance Between Chains of Strategies (NB, IJ, AP, JFR, MvdB), p. 22.