- Le problme de couverture pour les rseaux de Petri: rsultats classiques et
- Model Checking :Etude et implantation Laurent VAN BEGIN
- On the Dynamics of PB Systems with Volatile Giorgio Delzanno 1 and Laurent Van Begin 2#
- On the !-language Expressive Power of Extended A. Finkel y G. Geeraerts za J.-F. Raskin za
- Design of timed systems using a real-time process Thierry Massart, Laurent Van Begin, Eric Van Nu el
- From Many Places to Few: Automatic Abstraction Refinement for Petri Nets
- A Complete Abstract Interpretation Framework for Coverability Properties of WSTS
- A counterexample to the minimal coverability tree algorithm A. Finkel, G. Geeraerts, J.F. Raskin and L. Van Begin
- A Biologically Inspired Model with Fusion and Clonation of Membranes
- Software Tools for Technology Transfer manuscript No. (will be inserted by the editor)
- Babylon: An Integrated Toolkit for the Speci cation and Veri cation of
- Expand, Enlarge, and Check New algorithms for the coverability problem of WSTS
- Anne Acadmique 2003-2004 Laurent Van Begin E cient Veri cation of Counting Abstractions
- Acta Informatica manuscript No. (will be inserted by the editor)
- Attacking Symbolic State Explosion Giorgio Delzanno 1;? Jean-Fran cois Raskin 2;?? Laurent Van Begin 2;? ? ?
- On the #language Expressive Power of Extended Petri Nets
- Table des matires TABLE DES MATIERES .................................................................................................................................... 1
- Fundamenta Informaticae XX (2008) 1?? 1 From Many Places to Few: Automatic Abstraction Refinement for
- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
- Concurrent Boolean Programs Gilles Geeraerts
- Boundedness Undecidability for Synchronized Nets Raymond Devillers and Laurent Van Begin
- Electronic Notes in Theoretical Computer Science 68 No. 6 (2004) URL: http://www.elsevier.nl/locate/entcs/volume68.html 16 pages
- On the Qualitative Analysis of Conformon PSystems Parosh Aziz Abdulla 1 and Giorgio Delzanno 2 and Laurent Van Begin 3
- Comparing the Expressive Power of Wellstructured Transition Systems
- universite libre de bruxelles Facult e des sciences
- On the Complexity of Partial Order Trace Model Checking Thierry Massart Cedric Meuter
- Expand, Enlarge and Check... Made Efficient Submitted for publication to CAV'05
- Symbolic Data Structure for sets of kuples of Pierre Ganty 1 , Cedric Meuter 1 , Laurent Van Begin 1 , Gabriel Kalyon 1 ,
- Towards the Automated Veri cation of Multithreaded Java Programs
- On the efficient computation of the minimal coverability set for Petri nets
- August 3, 2008 17:2 WSPC/INSTRUCTION FILE main International Journal of Foundations of Computer Science
- Games for Counting Abstractions # J.F. Raskin 1 , M. Samuelides 2 and L. Van Begin 1+
