Translating FSP into LOTOS and Networks of Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Translating FSP into LOTOS and Networks of Automata

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.
Fichier principal
Vignette du fichier
Salaun-Kramer-Lang-Magee-07.pdf (239.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00198731 , version 1 (17-12-2007)

Identifiers

  • HAL Id : inria-00198731 , version 1

Cite

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⟩
203 View
286 Download

Share

Gmail Facebook X LinkedIn More