2009 |
25 | EE | Parosh Aziz Abdulla,
Giorgio Delzanno,
Laurent Van Begin:
A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations.
LATA 2009: 71-82 |
2008 |
24 | EE | Giorgio Delzanno,
Laurent Van Begin:
A Biologically Inspired Model with Fusion and Clonation of Membranes.
UC 2008: 64-82 |
23 | EE | Parosh Aziz Abdulla,
Giorgio Delzanno,
Laurent Van Begin:
On the Qualitative Analysis of Conformon P Systems.
Workshop on Membrane Computing 2008: 78-94 |
22 | 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) |
21 | EE | Thierry Massart,
Cédric Meuter,
Laurent Van Begin:
On the complexity of partial order trace model checking.
Inf. Process. Lett. 106(3): 120-126 (2008) |
2007 |
20 | 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 |
19 | EE | Parosh Aziz Abdulla,
Giorgio Delzanno,
Laurent Van Begin:
Comparing the Expressive Power of Well-Structured Transition Systems.
CSL 2007: 99-114 |
18 | EE | Gabriel Kalyon,
Thierry Massart,
Cédric Meuter,
Laurent Van Begin:
Testing Distributed Systems Through Symbolic Model Checking.
FORTE 2007: 263-279 |
17 | 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 |
16 | EE | Giorgio Delzanno,
Laurent Van Begin:
On the Dynamics of PB Systems with Volatile Membranes.
Workshop on Membrane Computing 2007: 240-256 |
15 | EE | Gilles Geeraerts,
Jean-François Raskin,
Laurent Van Begin:
Well-structured languages.
Acta Inf. 44(3-4): 249-288 (2007) |
2006 |
14 | EE | Pierre Ganty,
Jean-François Raskin,
Laurent Van Begin:
A Complete Abstract Interpretation Framework for Coverability Properties of WSTS.
VMCAI 2006: 49-64 |
13 | EE | Raymond R. Devillers,
Laurent Van Begin:
Boundedness undecidability for synchronized nets.
Inf. Process. Lett. 99(5): 208-214 (2006) |
12 | 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) |
11 | 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) |
2005 |
10 | EE | Gilles Geeraerts,
Jean-François Raskin,
Laurent Van Begin:
Expand, Enlarge and Check... Made Efficient.
CAV 2005: 394-407 |
9 | 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) |
8 | EE | Jean-François Raskin,
Mathias Samuelides,
Laurent Van Begin:
Games for Counting Abstractions.
Electr. Notes Theor. Comput. Sci. 128(6): 69-85 (2005) |
7 | EE | Christophe Darlot,
Alain Finkel,
Laurent Van Begin:
About Fast and TReX Accelerations.
Electr. Notes Theor. Comput. Sci. 128(6): 87-103 (2005) |
2004 |
6 | 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 |
5 | 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) |
4 | 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) |
2002 |
3 | EE | Giorgio Delzanno,
Jean-François Raskin,
Laurent Van Begin:
Towards the Automated Verification of Multithreaded Java Programs.
TACAS 2002: 173-187 |
2 | 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) |
2001 |
1 | EE | Giorgio Delzanno,
Jean-François Raskin,
Laurent Van Begin:
Attacking Symbolic State Explosion.
CAV 2001: 298-310 |