Translating FSP into LOTOS and networks of automata

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

Volumn 4591 LNCS, Issue , 2007, Pages 558-578

  Salaün, Gwen ^a,c   Kramer, Jeff ^b   Lang, Frédéric ^a   Magee, Jeff ^b  

^a INRIA   (France)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

^c UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; GRAPHICAL USER INTERFACES; MATHEMATICAL OPERATORS; STANDARDS; TRANSLATION (LANGUAGES); VERIFICATION;

COMPOSITE PROCESSES; INTERNATIONAL STANDARDS; TOOL SUPPORT; TRANSLATOR TOOL;

AUTOMATA THEORY;

EID: 38149099227     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73210-5_29     Document Type: Conference Paper

References (23)

1. 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)
2. 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)
3. Butler, M.: Csp2B: A Practical Approach to Combining Csp and B. Formal Aspects of Computing 12(3), 182-198 (2000)
4. 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)
5. Foster, H., Uchitel, S., Magee, J., Kramer, J.: Tool Support for Model-Based Engineering of Web Service Compositions. In: Proc. of ICWS'05, pp. 95-101. IEEE Computer Society Press, Los Alamitos (2005)
6. Garavel, H.: Compilation of Lotos Abstract Data Types. In: Proc. of FORTE'89, pp. 147-162. North-Holland, Amsterdam (1989)
7. 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)
8. Garavel, H., Lang, F.: Svl: A Scripting Language for Compositional Verification. In: Proc. of FORTE'01, pp. 377-394. Kluwer, Dordrecht (2001)
9. Garavel, H., Lang, F., Mateescu, R.: An Overview of Cadp 2001. EASST Newsletter 4, 13-24 (2001)
10. 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)
11. Garavel, H., Serwe, W.: State Space Reduction for Process Algebra Specifications. Theoretical Computer Science 351(2), 131-145 (2006)
12. Garavel, H., Sifakis, J.: Compilation and Verification of Lotos Specifications. In: Proc. of PSTV'90, pp. 379-394. North-Holland, Amsterdam (1990)
13. ISO. Lotos: a Formal Description Technique based on the Temporal Ordering of Observational Behaviour. Technical Report 8807, International Standards Organisation (1989)
14. 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)
15. Lang, F., Salaün, G.: Translating Fsp into Lotos and Networks of Automata. Technical report, INRIA (2007)
16. Magee, J., Kramer, J.: Concurrency: State Models & Java Programs. Wiley, Chichester (1999)
17. 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)
18. Nesi, M.: Formalising a Value-Passing Calculus in Hol. Formal Aspects of Computing 11(2), 160-199 (1999)
19. Salaün, G., Bordeaux, L., Schaerf, M.: Describing and Reasoning on Web Services using Process Algebra. In: Proc. of ICWS'04, pp. 43-51. IEEE Computer Society Press, Los Alamitos (2004)
20. 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)
21. 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)
22. van Glabbeek, R.J., Weijland, W.P.: Branching Time and Abstraction in Bisimulation Semantics. Journal of the ACM 43(3), 555-600 (1996)
23. 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)