Laurent Van Begin

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

2010
On the verification of membrane systems with dynamic structure.
Nat. Comput., 2010

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

2009
Le problème de couverture pour les réseaux de Petri. Résultats classiques et développements récents.
Tech. Sci. 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

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

From Many Places to Few: Automatic Abstraction Refinement for Petri Nets.
Fundam. Informaticae, 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

2007
Well-structured languages.
Acta Informatica, 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

2006
On the <i>omega</i>-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

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

2004
Covering sharing trees: a compact data structure for parameterized verification.
Int. J. Softw. Tools Technol. Transf., 2004

Games for Counting Abstractions.
Proceedings of the Fouth International Workshop on Automated Verification of Critical Systems, 2004

On the omega-language Expressive Power of Extended Petri Nets.
Proceedings of the 11th International Workshop on Expressiveness in Concurrency, 2004

About Fast and TReX Accelerations.
Proceedings of the Fouth International Workshop on Automated Verification of Critical Systems, 2004

2003
Petri Nets with Non-blocking Arcs are Difficult to Analyze.
Proceedings of INFINITY 2003, 2003

2002
Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited.
Proceedings of the 4th International Workshop on Verification of Infinite-State Systems (CONCUR 2002 Satellite Workshop), 2002

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

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


  Loading...