TReX: A Tool for Reachability Analysis of Complex Systems, Proc. CAV'01, pp.368-372, 2001. ,
DOI : 10.1007/3-540-44585-4_34
URL : https://hal.archives-ouvertes.fr/hal-00110460
FAST: acceleration from theory to practice, International Journal on Software Tools for Technology Transfer, vol.15, issue.2, pp.401-424, 2008. ,
DOI : 10.1007/s10009-008-0064-3
URL : https://hal.archives-ouvertes.fr/hal-00345968
Symbolic verification with periodic sets, Proc. CAV'94, pp.55-67, 1994. ,
DOI : 10.1007/3-540-58179-0_43
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.6568
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations, Theoretical Computer Science, vol.221, issue.1-2, pp.211-250, 1999. ,
DOI : 10.1016/S0304-3975(99)00033-X
Fast Acceleration of Ultimately Periodic Relations, Proc. CAV'10, pp.227-242, 2010. ,
DOI : 10.1007/978-3-642-14295-6_23
URL : https://hal.archives-ouvertes.fr/hal-01418908
BOUNDED PARIKH AUTOMATA, International Journal of Foundations of Computer Science, vol.23, issue.08, pp.1691-1710, 2012. ,
DOI : 10.1142/S0129054112400709
URL : http://doi.org/10.4204/eptcs.63.13
Forward analysis and model checking for trace bounded WSTS, Proc. ICATPN'11, pp.49-68, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00610011
Multiple counters automata, safety analysis and presburger arithmetic, Proc. CAV'98, pp.268-279, 1998. ,
DOI : 10.1007/BFb0028751
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.6334
A Perfect Model for Bounded Verification, 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp.285-294, 2012. ,
DOI : 10.1109/LICS.2012.39
Well-abstracted transition systems: application to FIFO automata, Information and Computation, vol.181, issue.1, pp.1-31, 2003. ,
DOI : 10.1016/S0890-5401(02)00027-5
URL : http://doi.org/10.1016/s0890-5401(02)00027-5
Bounded Algol-Like Languages, Transactions of the American Mathematical Society, vol.113, issue.2, pp.333-368, 1964. ,
DOI : 10.2307/1994067
Bounded regular sets, Proc. Amer, pp.1043-1049, 1966. ,
DOI : 10.1090/S0002-9939-1966-0201310-3
Semigroups, Presburger formulas, and languages, Pacific Journal of Mathematics, vol.16, issue.2, pp.285-296, 1966. ,
DOI : 10.2140/pjm.1966.16.285
The Mathematical Theory of Context-Free Languages, 1966. ,
On the reachability problem for 5-dimensional vector addition systems, Theoretical Computer Science, vol.8, issue.2, pp.135-159, 1979. ,
DOI : 10.1016/0304-3975(79)90041-0
CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES, International Journal of Foundations of Computer Science, vol.23, issue.06, pp.1291-1306, 2012. ,
DOI : 10.1142/S0129054112400539
On the open problem of Ginsburg concerning semilinear sets and related problems, Theoretical Computer Science, vol.501, pp.11-19, 2013. ,
DOI : 10.1016/j.tcs.2013.07.025
On the Context-Freeness Problem for Vector Addition Systems, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.43-52, 2013. ,
DOI : 10.1109/LICS.2013.9
URL : https://hal.archives-ouvertes.fr/hal-00788744
A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness, Proc. CONCUR'13, pp.137-151, 2013. ,
DOI : 10.1007/978-3-642-40184-8_11
URL : https://hal.archives-ouvertes.fr/hal-00851915
A characterization of semilinear sets, Journal of Computer and System Sciences, vol.4, issue.4, pp.299-307, 1970. ,
DOI : 10.1016/S0022-0000(70)80015-0
Theory of Linear and Integer Programming, 1987. ,
The context-freeness of the languages associated with vector addition systems is decidable, Theoretical Computer Science, vol.98, issue.2, pp.199-247, 1992. ,
DOI : 10.1016/0304-3975(92)90002-W