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