Skip to Main content Skip to Navigation
Conference papers

Translating FSP into LOTOS and Networks of Automata

Gwen Salaun 1 Jeff Kramer 2 Frederic Lang 1, * Jeff Magee 2 
* Corresponding author
1 VASY - System validation - Research and applications
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : Many process calculi have been proposed since Robin Milner and Tony Hoare opened the way more than 25 years ago. Although they are based on the same kernel of operators, most of them are incompatible in practice. We aim at reducing the gap between process calculi, and especially making possible the joint use of underlying tool support. FSP is a widely-used calculus equipped with LTSA, a graphical and user-friendly tool. LOTOS is the only process calculus that has led to an international standard, and is supported by the CADP verification toolbox. We propose a translation from FSP to LOTOS. Since FSP composite processes are hard to encode into LOTOS, they are translated into networks of automata which are another input language accepted by CADP. Hence, it is possible to use jointly LTSA and CADP to validate FSP specifications. Our approach is completely automated by a translator tool we implemented.
Document type :
Conference papers
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Frederic Lang Connect in order to contact the contributor
Submitted on : Monday, December 17, 2007 - 6:21:51 PM
Last modification on : Wednesday, July 6, 2022 - 4:21:03 AM
Long-term archiving on: : Monday, April 12, 2010 - 8:14:00 AM


Files produced by the author(s)


  • HAL Id : inria-00198731, version 1



Gwen Salaun, Jeff Kramer, Frederic Lang, Jeff Magee. Translating FSP into LOTOS and Networks of Automata. 6th International Conference on Integrated Formal Methods IFM'2007, Jul 2007, Oxford, United Kingdom. ⟨inria-00198731⟩



Record views


Files downloads