Laurent Van Begin

According to our database1, Laurent Van Begin authored at least 28 papers between 2001 and 2011.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 




A classification of the expressive power of well-structured transition systems.
Inf. Comput., 2011

On the verification of membrane systems with dynamic structure.
Natural Computing, 2010

On the Efficient Computation of the Minimal Coverability Set of Petri Nets.
Int. J. Found. Comput. Sci., 2010

Le problème de couverture pour les réseaux de Petri. Résultats classiques et développements récents.
Technique et Science Informatiques, 2009

A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations.
Proceedings of the Language and Automata Theory and Applications, 2009

On the complexity of partial order trace model checking.
Inf. Process. Lett., 2008

A Biologically Inspired Model with Fusion and Clonation of Membranes.
Proceedings of the Unconventional Computing, 7th International Conference, 2008

On the Qualitative Analysis of Conformon P Systems.
Proceedings of the Membrane Computing - 9th International Workshop, 2008

Well-structured languages.
Acta Inf., 2007

On the Dynamics of PB Systems with Volatile Membranes.
Proceedings of the Membrane Computing, 8th International Workshop, 2007

Testing Distributed Systems Through Symbolic Model Checking.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2007

Comparing the Expressive Power of Well-Structured Transition Systems.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

On the Efficient Computation of the Minimal Coverability Set for Petri Nets.
Proceedings of the Automated Technology for Verification and Analysis, 2007

From Many Places to Few: Automatic Abstraction Refinement for Petri Nets.
Proceedings of the Petri Nets and Other Models of Concurrency, 2007

On the omega-language expressive power of extended Petri nets.
Theor. Comput. Sci., 2006

Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS.
J. Comput. Syst. Sci., 2006

Boundedness undecidability for synchronized nets.
Inf. Process. Lett., 2006

A Complete Abstract Interpretation Framework for Coverability Properties of WSTS.
Proceedings of the Verification, 2006

Games for Counting Abstractions.
Electr. Notes Theor. Comput. Sci., 2005

On the omega-language Expressive Power of Extended Petri Nets.
Electr. Notes Theor. Comput. Sci., 2005

About Fast and TReX Accelerations.
Electr. Notes Theor. Comput. Sci., 2005

Expand, Enlarge and Check... Made Efficient.
Proceedings of the Computer Aided Verification, 17th International Conference, 2005

Covering sharing trees: a compact data structure for parameterized verification.
STTT, 2004

Petri Nets with Non-blocking Arcs are Difficult to Analyze.
Electr. Notes Theor. Comput. Sci., 2004

Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited.
Electr. Notes Theor. Comput. Sci., 2002

Towards the Automated Verification of Multithreaded Java Programs.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2002

Attacking Symbolic State Explosion.
Proceedings of the Computer Aided Verification, 13th International Conference, 2001