The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jean-François Raskin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Giorgio Delzanno, Jean-François Raskin, Laurent Van Begin
    Attacking Symbolic State Explosion. [Citation Graph (0, 0)][DBLP]
    CAV, 2001, pp:298-310 [Conf]
  2. Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
    Expand, Enlarge and Check... Made Efficient. [Citation Graph (0, 0)][DBLP]
    CAV, 2005, pp:394-407 [Conf]
  3. Martin De Wulf, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin
    Antichains: A New Algorithm for Checking Universality of Finite Automata. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:17-30 [Conf]
  4. Steve Kremer, Jean-François Raskin
    A Game-Based Verification of Non-repudiation and Fair Exchange Protocols. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2001, pp:551-565 [Conf]
  5. Nicolas Markey, Jean-François Raskin
    Model Checking Restricted Sets of Timed Paths. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:432-447 [Conf]
  6. Jean-François Raskin, Pierre-Yves Schobbens, Thomas A. Henzinger
    Axioms for Real-Time Logics. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1998, pp:219-236 [Conf]
  7. Steve Kremer, Jean-François Raskin
    Game Analysis of Abuse-free Contract Signing. [Citation Graph (0, 0)][DBLP]
    CSFW, 2002, pp:206-0 [Conf]
  8. Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin
    Algorithms for Omega-Regular Games with Imperfect Information, . [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:287-302 [Conf]
  9. Martin De Wulf, Laurent Doyen, Jean-François Raskin
    Systematic Implementation of Real-Time Models. [Citation Graph (0, 0)][DBLP]
    FM, 2005, pp:139-156 [Conf]
  10. Martin De Wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin
    Robustness and Implementability of Timed Automata. [Citation Graph (0, 0)][DBLP]
    FORMATS/FTRTFT, 2004, pp:118-133 [Conf]
  11. Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
    Model-Checking for Weighted Timed Automata. [Citation Graph (0, 0)][DBLP]
    FORMATS/FTRTFT, 2004, pp:277-292 [Conf]
  12. Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
    On Optimal Timed Strategies. [Citation Graph (0, 0)][DBLP]
    FORMATS, 2005, pp:49-64 [Conf]
  13. Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin
    Automatic Rectangular Refinement of Affine Hybrid Systems. [Citation Graph (0, 0)][DBLP]
    FORMATS, 2005, pp:144-161 [Conf]
  14. Véronique Bruyère, Jean-François Raskin
    Real-Time Model-Checking: Parameters Everywhere. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:100-111 [Conf]
  15. Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
    Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:287-298 [Conf]
  16. Franck Cassez, Thomas A. Henzinger, Jean-François Raskin
    A Comparison of Control Problems for Timed and Hybrid Systems. [Citation Graph (0, 0)][DBLP]
    HSCC, 2002, pp:134-148 [Conf]
  17. Thomas A. Henzinger, Jean-François Raskin
    Robust Undecidability of Timed and Hybrid Systems. [Citation Graph (0, 0)][DBLP]
    HSCC, 2000, pp:145-159 [Conf]
  18. Jean-François Raskin, Pierre-Yves Schobbens
    State Clock Logic: A Decidable Real-Time Logic. [Citation Graph (0, 0)][DBLP]
    HART, 1997, pp:33-47 [Conf]
  19. Martin De Wulf, Laurent Doyen, Jean-François Raskin
    Almost ASAP Semantics: From Timed Models to Timed Implementations. [Citation Graph (0, 0)][DBLP]
    HSCC, 2004, pp:296-310 [Conf]
  20. Martin De Wulf, Laurent Doyen, Jean-François Raskin
    A Lattice Theory for Solving Games of Imperfect Information. [Citation Graph (0, 0)][DBLP]
    HSCC, 2006, pp:153-168 [Conf]
  21. Thomas A. Henzinger, Jean-François Raskin, Pierre-Yves Schobbens
    The Regular Real-Time Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:580-591 [Conf]
  22. Thomas A. Henzinger, Rupak Majumdar, Freddy Y. C. Mang, Jean-François Raskin
    Abstract Interpretation of Game Properties. [Citation Graph (0, 0)][DBLP]
    SAS, 2000, pp:220-239 [Conf]
  23. Véronique Bruyère, Emmanuel Dall'Olio, Jean-François Raskin
    Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:687-698 [Conf]
  24. Giorgio Delzanno, Jean-François Raskin
    Symbolic Representation of Upward-Closed Sets. [Citation Graph (0, 0)][DBLP]
    TACAS, 2000, pp:426-440 [Conf]
  25. Giorgio Delzanno, Jean-François Raskin, Laurent Van Begin
    Towards the Automated Verification of Multithreaded Java Programs. [Citation Graph (0, 0)][DBLP]
    TACAS, 2002, pp:173-187 [Conf]
  26. Jean-François Raskin, Pierre-Yves Schobbens
    Real-Time Logics: Fictitious Clock as an Abstraction of Dense Time. [Citation Graph (0, 0)][DBLP]
    TACAS, 1997, pp:165-182 [Conf]
  27. Pierre Ganty, Jean-François Raskin, Laurent Van Begin
    A Complete Abstract Interpretation Framework for Coverability Properties of WSTS. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2006, pp:49-64 [Conf]
  28. Thomas A. Henzinger, Rupak Majumdar, Jean-François Raskin
    A Classification of Symbolic Transition Systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  29. Laurent Ferier, Jean-François Raskin, Pierre-Yves Schobbens
    Model-Generation of a Fictitious Clock Real-Time Logic Using Sharing Trees. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:23, n:2, pp:- [Journal]
  30. Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
    On the omega-language Expressive Power of Extended Petri Nets. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:128, n:2, pp:87-101 [Journal]
  31. Alain Finkel, Jean-François Raskin, Mathias Samuelides, Laurent Van Begin
    Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:68, n:6, pp:- [Journal]
  32. Jean-François Raskin, Laurent Van Begin
    Petri Nets with Non-blocking Arcs are Difficult to Analyze. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:98, n:, pp:35-55 [Journal]
  33. Jean-François Raskin, Mathias Samuelides, Laurent Van Begin
    Games for Counting Abstractions. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:128, n:6, pp:69-85 [Journal]
  34. Martin De Wulf, Laurent Doyen, Jean-François Raskin
    Almost ASAP semantics: from timed models to timed implementations. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 2005, v:17, n:3, pp:319-341 [Journal]
  35. Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
    On model-checking timed automata with stopwatch observers. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:3, pp:408-433 [Journal]
  36. Pierre-Yves Schobbens, Jean-François Raskin
    The Logic of ``Initially'' and ``Next'': Complete Axiomatization and Complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:5, pp:221-225 [Journal]
  37. Jean-François Raskin, Pierre-Yves Schobbens
    The Logic of Event Clocks - Decidability, Complexity and Expressiveness. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 1999, v:4, n:3, pp:247-286 [Journal]
  38. Steve Kremer, Jean-François Raskin
    A Game-based Verification of Non-repudiation and Fair Exchange Protocols. [Citation Graph (0, 0)][DBLP]
    Journal of Computer Security, 2003, v:11, n:3, pp:399-430 [Journal]
  39. Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
    Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:1, pp:180-203 [Journal]
  40. Giorgio Delzanno, Jean-François Raskin, Laurent Van Begin
    Covering sharing trees: a compact data structure for parameterized verification. [Citation Graph (0, 0)][DBLP]
    STTT, 2004, v:5, n:2-3, pp:268-297 [Journal]
  41. Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
    On the omega-language expressive power of extended Petri nets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:356, n:3, pp:374-386 [Journal]
  42. Nicolas Markey, Jean-François Raskin
    Model checking restricted sets of timed paths. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:358, n:2-3, pp:273-292 [Journal]
  43. Pierre-Yves Schobbens, Jean-François Raskin, Thomas A. Henzinger
    Axioms for real-time logics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:274, n:1-2, pp:151-182 [Journal]
  44. Thomas A. Henzinger, Rupak Majumdar, Jean-François Raskin
    A classification of symbolic transition systems. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2005, v:6, n:1, pp:1-32 [Journal]
  45. Pierre Ganty, Jean-François Raskin, Laurent Van Begin
    From Many Places to Few: Automatic Abstraction Refinement for Petri Nets. [Citation Graph (0, 0)][DBLP]
    ICATPN, 2007, pp:124-143 [Conf]
  46. Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
    On the Efficient Computation of the Minimal Coverability Set for Petri Nets. [Citation Graph (0, 0)][DBLP]
    ATVA, 2007, pp:98-113 [Conf]
  47. Franck Cassez, Alexandre David, Kim Guldstrand Larsen, Didier Lime, Jean-François Raskin
    Timed Control with Observation Based and Stuttering Invariant Strategies. [Citation Graph (0, 0)][DBLP]
    ATVA, 2007, pp:192-206 [Conf]
  48. Sébastien Collette, Jean-François Raskin, Frédéric Servais
    On the Symbolic Computation of the Hardest Configurations of the RUSH HOUR Game. [Citation Graph (0, 0)][DBLP]
    Computers and Games, 2006, pp:220-233 [Conf]
  49. Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Prabhu, Jean-François Raskin
    Minimum-Time Reachability in Timed Games. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:825-837 [Conf]
  50. Patrick Cousot, Pierre Ganty, Jean-François Raskin
    Fixpoint-Guided Abstraction Refinements. [Citation Graph (0, 0)][DBLP]
    SAS, 2007, pp:333-348 [Conf]
  51. Laurent Doyen, Jean-François Raskin
    Improved Algorithms for the Automata-Based Approach to Model-Checking. [Citation Graph (0, 0)][DBLP]
    TACAS, 2007, pp:451-465 [Conf]
  52. Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
    Well-structured languages. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2007, v:44, n:3-4, pp:249-288 [Journal]
  53. Véronique Bruyère, Jean-François Raskin
    Real-Time Model-Checking: Parameters everywhere [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  54. Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin
    Algorithms for Omega-Regular Games with Imperfect Information [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  55. Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
    On the optimal reachability problem of weighted timed automata. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2007, v:31, n:2, pp:135-175 [Journal]

  56. Alaska. [Citation Graph (, )][DBLP]


  57. Compositional Algorithms for LTL Synthesis. [Citation Graph (, )][DBLP]


  58. Lattice-Valued Binary Decision Diagrams. [Citation Graph (, )][DBLP]


  59. An Antichain Algorithm for LTL Realizability. [Citation Graph (, )][DBLP]


  60. Energy and Mean-Payoff Games with Imperfect Information. [Citation Graph (, )][DBLP]


  61. Realizability of Real-Time Logics. [Citation Graph (, )][DBLP]


  62. Automatic Synthesis of Robust and Optimal Controllers - An Industrial Case Study. [Citation Graph (, )][DBLP]


  63. Visibly Pushdown Transducers. [Citation Graph (, )][DBLP]


  64. Model checking <u>lots</u> of systems: efficient verification of temporal properties in software product lines. [Citation Graph (, )][DBLP]


  65. Properties of Visibly Pushdown Transducers. [Citation Graph (, )][DBLP]


  66. Iterated Regret Minimization in Game Graphs. [Citation Graph (, )][DBLP]


  67. Antichain Algorithms for Finite Automata. [Citation Graph (, )][DBLP]


  68. Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking. [Citation Graph (, )][DBLP]


  69. Fixpoint Guided Abstraction Refinement for Alternating Automata. [Citation Graph (, )][DBLP]


  70. Antichains for the Automata-Based Approach to Model-Checking [Citation Graph (, )][DBLP]


  71. On Functionality of Visibly Pushdown Transducers [Citation Graph (, )][DBLP]


  72. Iterated Regret Minimization in Game Graphs [Citation Graph (, )][DBLP]


  73. Generalized Mean-payoff and Energy Games [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002