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.
G. Salaün currently works at Universidad de Málaga, Spain.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Basten, T., Hooman, J.: Process Algebra in Pvs. In: Cleaveland, W.R. (ed.) ETAPS 1999 and TACAS 1999. LNCS, vol. 1579, pp. 270–284. Springer, Heidelberg (1999)
Bergamini, D., Descoubes, N., Joubert, C., Mateescu, R.: Bisimulator: A Modular Tool for On-the-Fly Equivalence Checking. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 581–585. Springer, Heidelberg (2005)
Butler, M.: Csp2B: A Practical Approach to Combining Csp and B. Formal Aspects of Computing 12(3), 182–198 (2000)
Dutertre, B., Schneider, S.: Using a Pvs Embedding of Csp to Verify Authentication Protocols. In: Gunter, E.L., Felty, A.P. (eds.) TPHOLs 1997. LNCS, vol. 1275, pp. 121–136. Springer, Heidelberg (1997)
Foster, H., Uchitel, S., Magee, J., Kramer, J.: Tool Support for Model-Based Engineering of Web Service Compositions. In: Proc. of ICWS 2005, pp. 95–101. IEEE Computer Society Press, Los Alamitos (2005)
Garavel, H.: Compilation of Lotos Abstract Data Types. In: Proc. of FORTE 1989, pp. 147–162. North-Holland, Amsterdam (1989)
Garavel, H.: Open/Cæsar: An Open Software Architecture for Verification, Simulation, and Testing. In: Steffen, B. (ed.) ETAPS 1998 and TACAS 1998. LNCS, vol. 1384, pp. 68–84. Springer, Heidelberg (1998)
Garavel, H., Lang, F.: Svl: A Scripting Language for Compositional Verification. In: Proc. of FORTE 2001, pp. 377–394. Kluwer, Dordrecht (2001)
Garavel, H., Lang, F., Mateescu, R.: An Overview of Cadp 2001. EASST Newsletter 4, 13–24 (2001)
Garavel, H., Lang, F., Mateescu, R.: Compiler Construction Using Lotos nt. In: Horspool, R.N. (ed.) CC 2002 and ETAPS 2002. LNCS, vol. 2304, pp. 9–13. Springer, Heidelberg (2002)
Garavel, H., Serwe, W.: State Space Reduction for Process Algebra Specifications. Theoretical Computer Science 351(2), 131–145 (2006)
Garavel, H., Sifakis, J.: Compilation and Verification of Lotos Specifications. In: Proc. of PSTV 1990, pp. 379–394. North-Holland, Amsterdam (1990)
ISO. Lotos: a Formal Description Technique based on the Temporal Ordering of Observational Behaviour. Technical Report 8807, International Standards Organisation (1989)
Lang, F.: Exp.Open 2.0: A Flexible Tool Integrating Partial Order, Compositional, and On-The-Fly Verification Methods. In: Romijn, J.M.T., Smith, G.P., van de Pol, J. (eds.) IFM 2005. LNCS, vol. 3771, pp. 70–88. Springer, Heidelberg (2005)
Lang, F., Salaün, G.: Translating Fsp into Lotos and Networks of Automata. Technical report, INRIA (2007)
Magee, J., Kramer, J.: Concurrency: State Models & Java Programs. Wiley, Chichester (1999)
Mateescu, R., Sighireanu, M.: Efficient On-the-Fly Model-Checking for Regular Alternation-Free Mu-Calculus. Science of Comp. Progr. 46(3), 255–281 (2003)
Nesi, M.: Formalising a Value-Passing Calculus in Hol. Formal Aspects of Computing 11(2), 160–199 (1999)
Salaün, G., Bordeaux, L., Schaerf, M.: Describing and Reasoning on Web Services using Process Algebra. In: Proc. of ICWS 2004, pp. 43–51. IEEE Computer Society Press, Los Alamitos (2004)
Salaün, G., Serwe, W.: Translating Hardware Process Algebras into Standard Process Algebras: Illustration with Chp and Lotos. In: Romijn, J.M.T., Smith, G.P., van de Pol, J. (eds.) IFM 2005. LNCS, vol. 3771, pp. 287–306. Springer, Heidelberg (2005)
Tej, H., Wolff, B.: A Corrected Failure-Divergence Model for Csp in Isabelle/Hol. In: Jones, C.B. (ed.) FME 1997. LNCS, vol. 1313, pp. 318–337. Springer, Heidelberg (1997)
van Glabbeek, R.J., Weijland, W.P.: Branching Time and Abstraction in Bisimulation Semantics. Journal of the ACM 43(3), 555–600 (1996)
Wang, X., Kwiatkowska, M.Z., Theodoropoulos, G.K., Zhang, Q.: Towards a Unifying Csp approach to Hierarchical Verification of Asynchronous Hardware. ENTCS, vol. 128, pp. 231–246 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Salaün, G., Kramer, J., Lang, F., Magee, J. (2007). Translating FSP into LOTOS and Networks of Automata. In: Davies, J., Gibbons, J. (eds) Integrated Formal Methods. IFM 2007. Lecture Notes in Computer Science, vol 4591. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73210-5_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-73210-5_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73209-9
Online ISBN: 978-3-540-73210-5
eBook Packages: Computer ScienceComputer Science (R0)