Translating FSP into LOTOS and Networks of Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Formal Aspects of Computing Year : 2010

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 possiblethe 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 of FSP sequential processes into Lotos. Since FSP composite processes (i.e., parallel compositions of processes) are hard to encode directly in 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.
Fichier principal
Vignette du fichier
Lang-Salaun-Herilier-Kramer-Magee-version-HAL.pdf (353.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00533808 , version 1 (08-11-2010)

Identifiers

  • HAL Id : hal-00533808 , version 1

Cite

Frédéric Lang, Gwen Salaün, Rémi Hérilier, Jeff Kramer, Jeff Magee. Translating FSP into LOTOS and Networks of Automata. Formal Aspects of Computing, 2010, 22, pp.681-711. ⟨hal-00533808⟩
456 View
307 Download

Share

Gmail Facebook X LinkedIn More