Linearization in parallel pCRL

Journal of Logic and Algebraic Programming

Volumn 48, Issue 1-2, 2001, Pages 39-70

  Groote, J F ^a,c   Ponse, A ^a,b   Usenko, Y S ^a  

^a CWI   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Linearization of recursive specifications; Process algebra; CRL

Indexed keywords

EID: 0002576839     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1567-8326(01)00005-4     Document Type: Article

References (34)

1. J.C.M. Baeten, J.A. Bergstra, J.W. Klop, Decidability of bisimulation equivalence for processes generating context-free languages, Journal of the ACM 40 (3) (1993) 653-682.
2. J.C.M. Baeten, W.P. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science, vol. 18, Cambridge University Press, Cambridge, 1990.
3. D.B. Benson, I. Guessarian, Algebraic solutions to recursion schemes, Journal of Computer and System Sciences 35 (1987) 365-400.
4. J.A. Bergstra, J.W. Klop, Process algebra for synchronous communication, Information and Computation 60 (1/3) (1984) 109-137.
5. J.A. Bergstra, J.W. Klop, A complete inference system for regular processes with silent moves, in: F.R. Drake, J.K. Truss (Eds.), Proceedings Logic Colloquium Hull 1986, North-Holland, Amsterdam 1988, pp. 21-81. First appeared as: Report CS-R8420, CWI, Amsterdam, 1984.
6. J.A. Bergstra, A. Ponse, Translation of a muCRL-fragment to I-CRL, in: Methods for the Transformation and Analysis of CRL. Deliverable 46/SPE/WP5/DS/A/007/bl, SPECS RACE Project no. 1046, pp. 125-148, Available through GSI Tecsi, May 1991.
7. M.A. Bezem, J.F. Groote, Invariants in process algebra with data, in: B. Jonsson, J. Parrow, (Eds.), CONCUR'94, Lecture Notes in Computer Science, vol. 836, Springer, Berlin, 1994, pp. 401-416.
8. D.J.B. Bosscher, A. Ponse, Translating a process algebra with symbolic data values to linear format, in: U.H. Engberg, K.G. Larsen, A. Skou (Eds.), Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems, Aarhus, Denmark, volume NS-95-2 of BRICS Notes Series, Department of Computer Science, University of Aarhus, May 1995, pp. 119-130.
9. J.J. Brunekreef, Process specification in a UNITY format, in: A. Ponse, C. Verhoef, S.F.M. van Vlijmen (Eds.), Algebra of Communicating Processes, Utrecht 1994, Workshops in Computing, Springer, Berlin, 1995, pp. 319-337.
10. S. Burris, H.P. Sankappanavar, A Course in Universal Algebra, Graduate Texts in Mathematics, vol. 78, Springer, Berlin, 1981.
11. K.M. Chandy, J. Misra, Parallel Program Design. A Foundation, Addison-Wesley, New York, 1988.
12. B. Courcelle, Equivalences and transformations of regular systems-applications to recursive program schemes and grammars, Theoretical Computer Science 42 (1986) 1-122.
13. B. Courcelle, Recursive applicative program schemes, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B, chapter 9, Elsevier, Amsterdam, 1990, pp. 459-492.
14. W.J. Fokkink, Introduction to Process Algebra, Texts in Theoretical Computer Science. An EATCS Series, Springer, Berlin, 2000.
15. R.J. van Glabbeek, The linear time-branching time spectrum II; the semantics of sequential systems with silent moves, Manuscript. Preliminary version available by ftp at ftp://boole.stanford.edu/pub/spectrum.ps.gz, 1993. Extended abstract, in: E. Best (Ed.), Proceedings CONCUR'93, 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 1993, Lecture Notes in Computer Science, vol. 715, Springer, Berlin, pp. 66-81.
16. R.J. van Glabbeek, The linear time-branching time spectrum II; the semantics of sequential systems with silent moves, Manuscript. Preliminary version available by ftp at ftp://boole.stanford.edu/pub/spectrum.ps.gz, 1993. Extended abstract, in: E. Best (Ed.), Proceedings CONCUR'93, 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 1993, Lecture Notes in Computer Science, vol. 715, Springer, Berlin, pp. 66-81.
17. J.F. Groote, The syntax and semantics of timed μCRL, Report SEN-R9709, CWI, The Netherlands, 1997.
18. J.F. Groote, B. Lisser, Tutorial and Reference Guide for the μCRL toolset version 1.0, CWI, 1999. Available from http://www.cwi.nl/~mcrl/mutool.html..
19. J.F. Groote, S.P. Luttik, Undecidability and completeness results for process algebras with alternative quantification over data, Report SEN-R9806, CWI, The Netherlands, July 1998. Available from http://www.cwi.nl/~luttik/; submitted for publication.
20. J.F. Groote, A. Ponse, Proof theory for μCRL: a language for processes with data, in: D.J. Andrews, J.F. Groote, C.A. Middelburg (Eds.), Semantics of Specification Languages, Workshop in Computing Series, Springer, Berlin, 1994, pp. 232-251.
21. J.F. Groote, A. Ponse, The syntax and semantics of μCRL, in: A. Ponse, C. Verhoef, S.F.M. van Vlijmen (Eds.), Algebra of Communicating Processes 1994, Workshop in Computing Series, Springer, Berlin, 1995, pp. 26-62.
22. J.F. Groote, J. Springintveld, Focus points and convergent process operators. A proof strategy for protocol verification, Technical Report 142, Department of Philosophy, Utrecht University, 1995. Available from ftp://ftp.phil.uu.nl/pub/logic/PREPRINTS/preprint142.ps.Z.
23. J.F. Groote, J.J. van Wamel, Algebraic data types and induction in μCRL, Technical Report P9409, University of Amsterdam, Programming Research Group, 1994.
24. Y. Hirshfeld, F. Moller. Decidability results in automata and process theory, in: F. Moller, G. Birtwistle (Eds.), Logics for Concurrency: Structure versus Automata, Lecture Notes in Computer Science, vol. 1043, Springer, Berlin, 1996, pp. 102-148.
25. ISO/IEC, LOTOS - a formal description technique based on the temporal ordering of observational behaviour, International Standard 8807, International Organization for Standardization-Information Processing Systems-Open Systems Interconection, Genève, September 1988.
26. S. Mauw, J.C. Mulder, Regularity of BPA-systems is decidable, in: B. Jonsson, J. Parrow (Eds.), Proc. CONCUR '94, Lecture Notes in Computer Science, vol. 836, Springer, Berlin, 1994, pp. 34-47.
27. S. Mauw, G.J. Veltink, A process specification formalism, Fundamenta Informaticae 13 (1990) 85-139.
28. S. Mauw, G.J. Veltink (Eds.), Algebraic Specification of Communication Protocols, Cambridge Tracts in Theoretical Computer Science, vol. 36, Cambridge University Press, Cambridge, 1993.
29. R. Milner, A complete inference system for a class of regular behaviours, Journal of Computer and System Sciences 28 (1984) 439-466.
30. V. van Oostrom, Personal communications, 2000.
31. A. Ponse, Computable processes and bisimulation equivalence, Formal Aspects of Computing 8 (6) (1996) 648-678.
32. A. Ponse, Y.S. Usenko, Equivalence of recursive specifications in process algebra, Information Processing Letters, to appear.
33. SPECS-Semantics and Analysis, Definition of MR and CRL Version 2.1. Deliverable 46/SPE/WP5/DS/A/017/b1, SPECS RACE Project no. 1046. Available through GSI Tecsi, 1990.
34. Specification and description language (SDL). ITU-T Recommendation Z. 100, 1994.