Algebraic specification of concurrency

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

Volumn 655 LNCS, Issue , 1993, Pages 1-39

  Astesiano, Egidio ^a   Reggio, Gianna ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85013589208     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56379-2_33     Document Type: Conference Paper

References (66)

1. A. Arnold and M. Nivat. Metric interpretations of infinite trees and semantics of non deterministic recursive programs. TCS, 11:181-205, 1980.
2. E. Astesiano, A. Giovini, and G. Reggio. Observational structures and their logic. TCS, 96, 1992.
3. E. Astesiano, G.F. Mascari, G. Reggio, and M. Wirsing. On the parameterized al-gebraic specification of concurrent systems. In H. Ehrig, C. Floyd, M. Nivat, and J. Thatcher, editors, Proc. TAPSOFT’85, Vol. 1, number 185 in Lecture Notes in Computer Science, pages 342-358, Berlin, 1985. Springer Verlag.
4. E. Astesiano, F. Mazzanti, G. Reggio, and E. Zucca. Formal specification of a concurrent architecture in a real project. In A Broad Perspective of Current Developments, Proc. ICS’85 (ACM International Computing Symposium), pages 185-195, Amsterdam, 1985. North-Holland.
5. E. Astesiano, C. Bendix Nielsen, N. Botta, A. Fantechi, A. Giovini, P. Inverardi, E. Karlsen, F. Mazzanti, J. Storbank Pedersen, G. Reggio, and E. Zucca. The draft formal definition of Ada. Deliverable, CEC MAP project: The Draft Formal Definition of ANSI/STD 1815A Ada, 1986.
6. E. Astesiano and G. Reggio. An outline of the SMoLCS approach. In M. Venturini Zilli, editor, Mathematical Models for the Semantics of Parallelism, Proc. Advanced School on Mathematical Models of Parallelism, Roma, 1986, number 280 in Lecture Notes in Computer Science, pages 81-113, Berlin, 1987. Springer Verlag.
7. E. Astesiano and G. Reggio. SMoLCS-driven concurrent calculi. In H. Ehrig, R. Kowalski, G. Levi, and U. Montanari, editors, Proc. TAPSOFT’87, Vol. 1, number 249 in Lecture Notes in Computer Science, pages 169-201, Berlin, 1987. Springer Verlag.
8. E. Astesiano and G. Reggio. A structural approach to the formal modelization and specification of concurrent systems. Technical Report 0, Formal Methods Group, Dipartimento di Matematica, Università di Genova, Italy, 1991.
9. E. Astesiano and G. Reggio. Entity institutions: Frameworks for dynamic systems, in preparation, 1992.
10. E. Astesiano, G. Reggio, and M. Wirsing. Relational specification and observational semantics. In Proc. MFCS’86, number 233 in Lecture Notes in Computer Science, pages 209-217, Berlin, 1986. Springer Verlag.
11. E. Astesiano and M. Wirising. An introduction to ASL. In L.G.L.T. Meertens, editor, Program Specification and Transformation, pages 343-365. North-Holland, 1987.
12. E. Astesiano and M. Wirising. Bisimulation in algebraic specifications. In M. Nivat and H. Ait-Kaci, editors, Proc. of the Colloquium on Resolution of Equations in Algebraic Structures, San Diego, 1989. Academic Press.
13. D. Austry and G. Boudol. Algebre de processus et synchronisation. TCS, 30:91-31, 1984.
14. J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge University Press, Cambridge, 1990.
15. E. Battiston, F. De Cindio, and G. Mauri. OBJSA nets: a class of high-level nets having objects as domains. In G. Rozemberg, editor, Advances in Petri Nets, number 340 in Lecture Notes in Computer Science, pages 20-43, Berlin, 1988. Springer Verlag.
16. L. Berardinello and F. De Cindio. A survey of basic net models and modular net classes. In G. Rozemberg, editor, Advances in Petri Nets, Lecture Notes in Computer Science, Berlin, 1992. Springer Verlag. To appear.
17. J.A. Bergstra, J. Heering, and P. Klint. ASF — an Algebraic Specification Formalism. Technical Report CS-R8705, Centre for Mathematics and Computer Science, Amsterdam, 1987.
18. J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information & Control, 60(1/3):109-137, 1984.
19. M. Bettaz. An association of algebraic term nets and abstract data types for specifying real communication protocols. In H. Ehrig, K.P. Jantke, F. Orejas, and H. Reichel, editors, Recent Trends in Data Type Specification, number 534 in Lecture Notes in Computer Science, pages 11-30, Berlin, 1991. Springer Verlag.
20. M. Bettaz. How to specify nondeterminism and true concurrency with algebraic term nets. Draft, 1992.
21. M. Bidoit. PLUSS, un langage pour le developpment de specifications algebriques modulaires. These d’Etat, Universite de Paris-Sud, 1989.
22. M. Broy. Specification and top down design of distributed systems. In H. Ehrig, C. Floyd, M. Nivat, and J. Thatcher, editors, Proc. TAPSOFT’85, Vol. 1, number 185 in Lecture Notes in Computer Science, pages 4-28, Berlin, 1985. Springer Verlag.
23. M. Broy. Predicative specifications for functional programs describing communicating networks. Information Processing Letters, 25:2, 1987.
24. M. Broy. An example for the design of distributed systems in a formal setting: The lift problem. Techinical Report MIP P 8802, University of Passau, 1988.
25. M. Broy and M. Wirsing. Partial abstract types. Acta Informatica, 18:47-64, 1982.
26. R.M. Burstall and J.A. Goguen. Introducing institutions. In E. Clarke and D. Kozen, editors, Logics of Programming Workshop, number 164 in Lecture Notes in Computer Science, pages 221-255, Berlin, 1984. Springer Verlag.
27. V. Carchiolo, A. Faro, F. Minassale, and G. Scollo. Some topics in the design of the specification language LOTOS. In M. Paul and B. Robinet, editors, Proc. 4th Int. Symp. on Programming, number 167 in Lecture Notes in Computer Science, Berlin, 1984. Springer Verlag.
28. A. Corradini, G.L. Ferrari, and U. Montanari. Transition systems with algebraic structure as models of computation. In I. Guessarian, editor, Proc. of 18-eme Ecole de Printemps en Informatique Theorique, Semantique du Parallelism, number 469 in Lecture Notes in Computer Science, pages 185-222, Berlin, 1990. Springer Verlag.
29. G. Costa and G. Reggio. Abstract dynamic data types: a temporal logic approach. In A. Tarlecki, editor, Proc. MFCS’91, number 520 in Lecture Notes in Computer Science, pages 103-112, Berlin, 1991. Springer Verlag.
30. J.W. de Bakker and J.I. Zucker. Processes and the denotational semantics of concurrency. Information & Control, 54:70-120, 1982.
31. R. de Simone. Higher-level synchronising devices in Meije — SCCS. TCS, 37:245-267, 1985.
32. B.T. Denvir, W.T. Hardwood, M.J. Jackson, and M.J. Wray, editors. The Analysis of Concurrent Systems. Number 207 in Lecture Notes in Computer Science. Springer Verlag, Berlin, 1985.
33. C. Dimitrovici and U. Hummert. Composition of algebraic high-level nets. In H. Ehrig, K.P. Jantke, F. Orejas, and H. Reichel, editors, Recent Trends in Data Type Specification, number 534 in Lecture Notes in Computer Science, pages 52-73, Berlin, 1991. Springer Verlag.
34. H. Ehrig, W. Fey, and H. Hansen. ACT ONE: An algebraic specification language with two levels of semantics. Technical Report 83-01, TUB, Berlin, 1983.
35. H. Ehrig, F. Parisi Presicce, P. Boehm, C. Rieckhoff, C. Dimitrovici, and M. Grosse-Rhode. Algebraic data type and process specifications based on projection spaces. In D. Sannella and A. Tarlecki, editors, Recent Trends in Data Type Specification, number 332 in Lecture Notes in Computer Science, pages 23-43, Berlin, 1988. Springer Verlag.
36. M. Grosse-Rhode and H. Ehrig. Transformation of combined data type and process specifications using projection algebras. In Stepwise refinenment of distributed systems, number 430 in Lecture Notes in Computer Science, pages 301-339, Berlin, 1990. Springer Verlag.
37. M. Hennessy. Algebraic theory of processes. The MIT Press, Cambridge, Massachusetts, 1988.
38. C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, London, 1985.
39. H. Hussmann. Rapid prototyping for algebraic specifications: RAP system user’s manual. Technical Report MIP P 8504, University of Passau, 1985.
40. I.S.O. LOTOS — A formal description technique based on the temporal ordering of observational behaviour. IS 8807, International Organization for Standardization, 1989.
41. G. Kahn. The semantics of a simple language for parallel programming. In J.L. Rosenfeld, editor, Information Processing 77, pages 471-475, Amsterdam, 1974. North-Holland.
42. S. Kaplan. Algebraic specification of concurrent systems. TCS, 9:90-115, 1989.
43. S. Kaplan and A. Pnueli. Specification and implementation of concurrently accessed data. In Proc. STACS ’87 (Symposium on Theoretical Aspects of Computer Science), number 247 in Lecture Notes in Computer Science, Berlin, 1987. Springer Verlag.
44. B. Kraemer. Concepts, Syntax and Semantics of SEGRAS — A specification Language for Distributed Systems. Oldenbourg Verlag, Munchen, Wien, 1989.
45. K. Lodaya and P. S. Thiagarajan. A modal logic for a subclass of event structures. In T. Ottmann, editor, Proceeding of ICALP’87, number 267 in Lecture Notes in Computer Science, pages 290-303, Berlin, 1987. Springer Verlag.
46. S. Mauw and G.J. Veltink. An introduction to PSFd. In J. Diaz and F. Orejas, editors, Proc. TAPSOFT’89, Vol. 2, number 352 in Lecture Notes in Computer Science, pages 272-285, Berlin, 1989. Springer Verlag.
47. S. Mauw and G.J. Veltink. A proof assistant for PSF. In K. Larsen and A. Skou, editors, Proc. Third Workshop on Computer Aided Verification, Vol. 1, pages 200-211, Aalborg, Denmark, 1991. The University of Aalborg.
48. J. Meseguer. A logical theory of concurrent objects. In ECOOP-OOPSLA’90 Conference on Object-Oriented Programming, Ottawa Canada, October 1990, pages 101-115. ACM, 1990.
49. J. Meseguer. Rewriting as a unified model of concurrency. TCS, 96, 1992.
50. R. Milner. A Calculus of Communicating Systems. Number 92 in Lecture Notes in Computer Science. Springer Verlag, Berlin, 1980.
51. R. Milner. Communication and concurrency. Prentice Hall, London, 1989.
52. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes — Part I. Information and Computation, 1992. To appear.
53. D. Park. Concurrency and automata on infinite sequences. In Proc. 5th GI Conference, number 104 in Lecture Notes in Computer Science, Berlin, 1981. Springer Verlag.
54. G. Plotkin. A structural approach to operational semantics. Lecture notes, Aarhus University, 1981.
55. G. Plotkin. An operational semantics for CSP. In D. Bjorner, editor, Proc. IFIP TC 2-Working conference: Formal description of programming concepts, pages 199-223, Amsterdam, 1983. North-Holland.
56. A. Pnueli. Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends. In Current Trends in Concurrency, number 224 in Lecture Notes in Computer Science, pages 510-584, Berlin, 1986. Springer Verlag.
57. G. Reggio. Entities: an istitution for dynamic systems. In H. Ehrig, K.P. Jantke, F. Orejas, and H. Reichel, editors, Recent Trends in Data Type Specification, number 534 in Lecture Notes in Computer Science, pages 244-265, Berlin, 1991. Springer Verlag.
58. G. Reggio. Event logic for specifying abstract dynamic data types. In the same volume, 1992.
59. W. Reisig. Petri nets: an introduction. Number 4 in EATCS Monographs on Theoretical Computer Science. Springer Verlag, Berlin, 1985.
60. W. Reisig. Petri nets and algebraic specifications. TCS, 80:1-34, 1991.
61. B. Thomsen. A calculus of higher-order communicating systems. In Proceeding of POPL Conference, pages 143-154, 1989.
62. P. van Eijk. Tools for LOTOS, a Lotosfere overview. Memoranda Informatica 91-25, Universiteit Twente — Faculteit der Informatica, Enscede, 1991.
63. J. Vautherin. Parallel system specifications with coloured Petri nets and algebraic data types. In G. Rozemberg, editor, Advances in Petri Nets, number 266 in Lecture Notes in Computer Science, Berlin, 1987. Springer Verlag.
64. G. Winskel. Event structure semantics for CCS and related languages. In M. Nielsen and E.M. Schmidt, editors, Proc. 9th ICALP, number 140 in Lecture Notes in Computer Science, pages 561-576, Berlin, 1982. Springer Verlag.
65. G. Winskel. An introduction to event structures. In J.W. de Bakker, W.-P. de Roever, and G. Rozemberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, number 354 in Lecture Notes in Computer Science, pages 364-397, Berlin, 1989. Springer Verlag.
66. M. Wirsing. Algebraic specifications. In van Leeuwen Jan, editor, Handbook of Theo-ret. Comput. Sci., volume B, pages 675-788. Elsevier, 1990.