FAST: Fast acceleration of symbolic transition systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2725, Issue , 2003, Pages 118-121

  Bardin, Sébastien ^a   Finkel, Alain ^a   Leroux, Jérôme ^a   Petrucci, Laure ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

CASE-STUDIES; INFINITE SYSTEM; SYMBOLIC TRANSITION SYSTEMS; TOOL DESIGNS;

COMPUTER AIDED ANALYSIS;

EID: 35248857942     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45069-6_12     Document Type: Article

References (12)

1. ∼bultan/composite/.
2. ∼voronkov/BRAIN/.
3. DESIGN/CPN online. http://www.daimi.au.dk/designCPN.
4. G. Delzanno. Home Page - Giorgio Delzanno. http://www.disi.unige.it/person/DelzannoG/.
5. ∼leroux/fast/.
6. A. Finkel and J. Leroux. How to compose Presburger-accelerations: Applications to broadcast protocols. In Proc. 22nd Conf. Found, of Software Technology and Theor. Comp. Sci. (FST&TCS'2002), Kanpur, India, Dec. 2002, volume 2556 of Lecture Notes in Computer Science, pages 145-156. Springer, 2002.
7. ∼tah/HyTech/.
8. ∼boigelot/research/lash/.
9. the MONA project. http://www.brics.dk/mona/.
10. ∼kenmcmil/.
11. SPIN homepage. http://spinroot.com/spin/.
12. ∼sighirea/trex/.