Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Laurent Van Begin
2010 – today
- 2011
[j16]Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin: A classification of the expressive power of well-structured transition systems. Inf. Comput. 209(3): 248-279 (2011)- 2010
- [j15]Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin: On the Efficient Computation of the Minimal Coverability Set of Petri Nets. Int. J. Found. Comput. Sci. 21(2): 135-165 (2010)
- [j14]Giorgio Delzanno, Laurent Van Begin: On the verification of membrane systems with dynamic structure. Natural Computing 9(4): 795-818 (2010)
2000 – 2009
- 2009
- [j13]Pierre Ganty, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin: Le problème de couverture pour les réseaux de Petri. Résultats classiques et développements récents. Technique et Science Informatiques 28(9): 1107-1142 (2009)
- [c13]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
- [j12]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)
- [j11]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)
- [c12]Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin: On the Qualitative Analysis of Conformon P Systems. Workshop on Membrane Computing 2008: 78-94
- [c11]Giorgio Delzanno, Laurent Van Begin: A Biologically Inspired Model with Fusion and Clonation of Membranes. UC 2008: 64-82
- 2007
- [j10]Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin: Well-structured languages. Acta Inf. 44(3-4): 249-288 (2007)
- [c10]Pierre Ganty, Jean-François Raskin, Laurent Van Begin: From Many Places to Few: Automatic Abstraction Refinement for Petri Nets. ICATPN 2007: 124-143
- [c9]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
- [c8]Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin: Comparing the Expressive Power of Well-Structured Transition Systems. CSL 2007: 99-114
- [c7]Gabriel Kalyon, Thierry Massart, Cédric Meuter, Laurent Van Begin: Testing Distributed Systems Through Symbolic Model Checking. FORTE 2007: 263-279
- [c6]Giorgio Delzanno, Laurent Van Begin: On the Dynamics of PB Systems with Volatile Membranes. Workshop on Membrane Computing 2007: 240-256
- 2006
- [j9]Raymond R. Devillers, Laurent Van Begin: Boundedness undecidability for synchronized nets. Inf. Process. Lett. 99(5): 208-214 (2006)
- [j8]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)
- [j7]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)
- [c5]Pierre Ganty, Jean-François Raskin, Laurent Van Begin: A Complete Abstract Interpretation Framework for Coverability Properties of WSTS. VMCAI 2006: 49-64
- 2005
- [j6]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)
- [j5]Jean-François Raskin, Mathias Samuelides, Laurent Van Begin: Games for Counting Abstractions. Electr. Notes Theor. Comput. Sci. 128(6): 69-85 (2005)
- [j4]Christophe Darlot, Alain Finkel, Laurent Van Begin: About Fast and TReX Accelerations. Electr. Notes Theor. Comput. Sci. 128(6): 87-103 (2005)
- [c4]Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin: Expand, Enlarge and Check... Made Efficient. CAV 2005: 394-407
- 2004
- [j3]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)
- [j2]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)
- [c3]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
- 2002
- [j1]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): 85-106 (2002)
- [c2]Giorgio Delzanno, Jean-François Raskin, Laurent Van Begin: Towards the Automated Verification of Multithreaded Java Programs. TACAS 2002: 173-187
- 2001
- [c1]Giorgio Delzanno, Jean-François Raskin, Laurent Van Begin: Attacking Symbolic State Explosion. CAV 2001: 298-310
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:38 CET by the dblp team