Rémi Bonnet

According to our database1, Rémi Bonnet authored at least 9 papers between 2010 and 2014.

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

2014
Analysis of Probabilistic Basic Parallel Processes.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

2013
Ordinal theory for expressiveness of well-structured transition systems.
Inf. Comput., 2013

Reachability under Contextual Locking.
Log. Methods Comput. Sci., 2013

Bounded Context-Switching and Reentrant Locking.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

2012
Model Checking Vector Addition Systems with one zero-test
Log. Methods Comput. Sci., 2012

Extending the Rackoff technique to Affine nets.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011
Decidability of LTL for Vector Addition Systems with One Zero-Test.
Proceedings of the Reachability Problems - 5th International Workshop, 2011

The Reachability Problem for Vector Addition System with One Zero-Test.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2010
Place-Boundedness for Vector Addition Systems with one zero-test.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010


  Loading...