Enhanced operational semantics: A tool for describing and analyzing concurrent systems

ACM Computing Surveys

Volumn 33, Issue 2, 2001, Pages 135-176

  Degano, Pierpaolo ^a   Priami, Corrado ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF VERONA   (Italy)

Author keywords

Design; Languages; Parametric Models; Process Algebra; Theory

Indexed keywords

CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES; CONCURRENT ENGINEERING; DATA STRUCTURES; ENCODING (SYMBOLS); LARGE SCALE SYSTEMS; SOFTWARE ENGINEERING;

OPERATIONAL SEMANTICS; PARAMETRIC MODELS; PROCESS ALGEBRA;

SEMANTICS;

EID: 0011122770     PISSN: 03600300     EISSN: None     Source Type: Journal    
DOI: 10.1145/384192.384194     Document Type: Article

References (95)

1. ACETO, L. AND MURPHY, D. 1993. Timing and causality in process algebra. Tech. Rep. 9/93. University of Sussex, Sussex, England.
2. AMADIO, R., CASTELLANI, I., AND SANGIORGI, D. 1998. On bisimulations for the asynchronous picalculus. Theoret. Comput. Sei. 195, 2, 291-324.
3. BAUSE,F.,BUCHHOL ZP.,ANDKEMPER,P. 1995. QPNtool for the specification and analysis of hierarchically combined queueing Petri nets. In Proceedings of Quantitative Evaluation of Computing and Communication Systems. Lecture Notes in Computer Science, vol. 977. Springer-Verlag. New York, pp. 224-238.
4. BERNARDO, M., DONATIELLO, L., AND GORRIERI, R. 1998a. A formal approach to the integration of performance aspects in the modelling and analysis of concurrent systems. Inf. Comput. 144, 83154.
5. BERNARDO, M., CLEAVELAND, W. R., SIMS, S. T, AND STEWART, W. J. 1998b. TwoTowers: A tool integrating functional and performance analysis of concurrent systems. In S. Budkowski, A. Cavalli, and E. Najm Eds., Proceedings of the IFIP Joint Int. Conf. on Formal Description Techniques for Distributed Systems and Communication Protocols and Protocol Specification, Testing, and Verification (FORTE/PSTV '98), Kluwer, 457467.
6. BLOOM, B. 1995. Structural operational semantics as a specification language. In Proceedings of POPL '95 (San Francisco), ACM, New York, pp. 107-117.
7. BODEI, C., DEGANO, P., AND PRIAMI, C. 1996. Mobile processes with a distributed environment. In Proceedings of ICALP '96. Lecture Notes in Computer Science, vol. 1099. Springer-Verlag, New York, pp. 490-501. Extended version in TCS, 253 (2001), pp. 155-184.
8. BODEI, C., DEGANO, P., FOCARDI, R., AND PRIAMI, C. 1999. Authentication via localized names. In Proceedings of CSFW12. IEEE Computer Society Press, Los Alamitos, Calif., pp. 98-110.
9. BODEI, C., DEGANO, P., AND PRIAMI, C. 1998. Constructing specific SOS semantics for concurrency via abstract interpretation. In Proceedings of SAS '98. Lecture Notes in Computer Science, vol. 1503. Springer-Verlag, New York, pp. 168-183.
10. BOREALE, M. AND SANGIORGI, D. 1995. A fully abstract semantics of causality in the JT-calculus. In Proceedings of STAGS '95. Lecture Notes in Computer Science, Springer-Verlag, New York.
11. BORGIA, R., DEGANO, P., PRIAMI, C., LETH, L., AND THOMSEN, B. 1996. Understanding mobile agents via a non-interleaving semantics for Facile. In R. Cousot and D. A. Schmidt Eds., Proceedings of SAS '96. Lecture Notes in Computer Science, vol. 1145, Springer-Verlag, New York, pp. 98-112.
12. BOUDOL, G. AND CASTELLANI, I. 1988. A noninterleaving semantics for CCS based on proved transitions. Fund. Inf. XI, 4,433-152.
13. BOUDOL, G., CASTELLANI, I., HENNESSY, M., AND KIEHN, A. 1993. A theory of processes with localities. Theoret. Comput. Sei. 114.
14. BOWEN, J. P. AND HINCHEY, M. G. 1995. Ten commandments of formal methods. IEEE Comput. 28, 4, 56-63.
15. BRAVETTI, M. AND GORRIERI, R. 1999. Interactive generalized semi-Markov processes. In Proceedings ofPAPM '99. Carleton Scientific.
16. BRAVETTI, M., BERNARDO, M., AND GORRIERI, R. 1998. Towards performance evaluation with general distributions in process algebra. In Proceedings of CONCUR '98. Lecture Notes in Computer Science, vol, 1466, Springer-Verlag, New York, pp. 405-422.
17. BRINKSMA, E., KATOEN, J.-R, LANGERAK, R., AND LATELLA, D. 1995. A stochastic causality based process algebra. Comput. J. 38, 6, 552-565.
18. BRODO, L., DEGANO, P., AND PRIAMI, C. 2000. A tool for quantitative analysis of TT-calculus processes. In Proceedings ofPAPM '00, Carleton Scientific.
19. BUCHHOLZ, P. 1994. On a Markovian process algebra. Tech. Rep. 500, Informatik IV, University of Dortmund.
20. BUSI, N. AND GORRIERI, R. 1995. A Petri net semantics for 7T-calculus. In Proceedings of CONCUR '95,1. Lee and S. A. Smolka Eds., Lecture Notes in Computer Science, vol. 962, Springer-Verlag, New York, pp. 145-159.
21. CARDELLI, L. AND GORDON, A. 1998. Mobile ambients. In Proceedings of FoSSaCS '98. Lecture Notes in Computer Science, vol. 1378. SpringerVerlag, New York, pp. 140-155.
22. CHIOLA, G., FRANCESCHINIS, G., GAETA, R., AND RIBAUDO, M. 1995. GreatSPNl.7: Graphical editor and analyzer for timed and stochastic petri nets. Perf. Eval. 24. Special Issue on Performance Modelling Tools.
23. D'ARGENIO, P. R. 1999. Algebras and automata for timed and stochastic systems. Ph.D. University ofTwente.
24. D'ARGENIO, P. R., KATOEN, J.-R, AND BRINKSMA, E. 1998. An algebraic approach to the specification of stochastic systems. In Proceedings of PROCOMET '98. IFIP Series. Chapman-Hall, London, England, pp. 126-147.
25. DARONDEAU, P. AND DEGANO, P. 1989. Causal trees. In Proceedings of ICALP '89. Lecture Notes in Computer Science, vol. 372, Springer-Verlag, New York, pp. 234-248.
26. DE BARKER, J. W. AND DE ROEVER, W. P. 1972. A calculus for recursive program schemes. In Proceedings of ICALP '72. North-Holland, Amsterdom, The Netherlands, pp. 167-196.
27. DEGANO, P. AND GORRIERI, R. 1995. A causal semantics of action refinement. Inf.Comput. 122,1,97121.
28. DEGANO, P. AND PRIAMI, C. 1992. Proved trees. In Proceedings of ICALP '92. Lecture Notes in Computer Science, vol. 623, Springer-Verlag, New York, pp. 629-640.
29. DEGANO, P. AND PRIAMI, C. 1996. Enhanced operational semantics. ACMComput. Surv. 28,2,352354.
30. DEGANO, P. AMD PRIAMI, C. 1999. Non interleaving semantics for mobile processes. Theoret. Comput. Sei. 216, 237-270.
31. DEGANO, P., DE NICOLA, R., AND MONTANARI, U. 1985. Partial ordering derivations for CCS. In Proceedings ofFCT '85. Lecture Notes in Computer Science, vol. 199, Springer-Verlag, New York, pp. 520-533.
32. DEGANO, P., DE NICOLA, R., AND MONTANARI, U. 1990. A partial ordering semantics for CCS. Theoret. Comput. Sei. 75, 223-262.
33. DEGANO, P., PRIAMI, C., LETH, L., AND THOMSEN, B. 1996. Analysis of Facile programs: A case study. In Proceedings of Workshop on Analysis and Verification of Multiple-Agent Languages. (Stockholm, Sweden). Lecture Notes in Computer Science, vol. 1192, Springer-Verlag, New York, pp. 345-369.
34. DEGANO, P., PRIAMI, C., LETH, L., AND TIIOMSEN, B. 1999. Causality for debugging mobile agents. Acta Inf. 36, 335-374.
35. FINNEY, K. 1996. Mathematical notation in formal specification: Too difficult for the masses? IEEE Trans. Softw. Eng. 22, 2,158-159.
36. FOURNET, C., GONTHIER, G., LEVY, J.-J., MARANGET, L., AND REMY, D. 1996. A calculus of mobile agents. In Proceedings of CONCUR '96. Lecture Notes in Computer Science, vol. 1119, SpringerVerlag, New York, pp. 406-421.
37. GIACALONE,A.,MISIIRA,P.,ANDPRASAD,S. 1990. Operational and algebraic semantics for Facile: A symmetric integration of concurrent and functional programming. In Proceedings ICALP '90. Lecture Notes in Computer Science, vol. 443, Springer-Verlag, New York, pp. 765-780.
38. GILMORE, S. AND HILLSTON, J. 1994. The PEPA workbench: A tool to support a process algebrabased approach to performance modelling. In Proceedings of International Conference on Modelling Techniques and Tools for Computer Performance Evaluation. G. Hawing, Ed.
39. GORRIERI, R. AND ROCCETTI, M. 1993. Towards performance evaluation in process algebras. In Proceedings of AMAST '93. Lecture Notes in Computer Science, Springer-Verlag, New York.
40. GöTZ, N., HERZOG, U., AND RETTELBACH, M. 1992. TIPP-A language for timed processes and performance evaluation. Tech. Rep. 4/92. IMMD VII, University of Erlangen-Nurnberg.
41. HARRISON, P. G AND STRULO, B. 1995. Stochastic process algebra for discrete event simulation. In Quantitative Methods in Parallel Systems, Springer Verlag Esprit Badie Research Series, pp. 18-37.
42. HENNESSY, M. 1988. Algebraic Theory of Processes. MIT Press, Cambridge, Mass.
43. HILLSTON, J. 1996. A Compositional Approach to Performance Modelling. Cambridge University Press, New York.
44. HOARE, C. 1985. Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs, N.J.
45. INVERARDI, P. AND PRIAMI, C. 1996. Automatic verification of distributed systems: The process algebras approach. Form. Meth. Syst. Des. 8, l, 1-37.
46. JATEGAONKAR, L. 1993. Observing "true" concurrency. Ph.D. dissertation. MIT, Cambridge, Mass.
47. JATEGAONKAR JAGADEESAN, L. AND JAGADEESAN, R. 1995. Causality and true concurrency: A dataflow analysis pf the n -calculus. In Proceedings ofAMAST '95. Lecture Notes in Computer Science, vol. 936. Springer-Verlag, New York, pp. 277-291.
48. JONES, C. B. 1990. Systematic Software Development Using VDM. Prentice-Hall, Englewood Cliffs, N.J.
49. KATOEN, J.-P. 1996. Quantitative and qualitative extensions of event structures. Ph.D. dissertation. Center for Telematics and Information Technology, University of Twente. Available as CTIT No. 96-09.
50. KIEHN, A. 1994. Comparing causality and locality based equivalences. Acta Inf. 31, 8, 697-718.
51. LANDIN, P. 1964. The mechanical evaluation of expressions. Comput. J. 6, 4.
52. LARSEN, K. G. AND SKOU, A. 1992. Compositional verification of probabilistic processes. In Proceedings of CONCUR '92. Lecture Notes in Computer Science, vol. 630. Springer-Verlag, New York.
53. LUCAS, P. 1971. Formal definition of programming languages and systems. In Proceedings of IFIP '71.
54. MAGGIOLO-SCHETTINI, A. AND TINI, S. 1999. Applying techniques of asynchronous concurrency to synchronous languages. Fund. Inf. 40, 221250.
55. MCCARTHY, J. 1963. Towards a mathematical science of computation. In Information Processing 1962, 21-28.
56. MILKER, R. 1989. Communication and Concurrency. Prentice-Hall, London, England.
57. MILNER, R. 1991. The polyadic ;r-calculus: A tutorial. Tech. Rep. ECS-LFCS-91-180. University of Edinburgh, Edinburgh, Scotland.
58. MILNER, R. 1992a. Action structures. Tech. Rep. ECS-LFCS-92-249. University of Edinburgh, Edinburgh, Scotland.
59. MILKER, R. 1992b. Functions as processes. Math. Struct. Comput. Sei. 2, 2,119-141.
60. MILKER, R., BERRY, D., AND TURNER, D. 1992. A semantics for ML concurrency primitives. In Proceedings of the ACM Annual Symposium on Principals of Programming Languages, ACM, New York.
61. MILKER, R., FARROW, J., AND WALKER, D. 1992. A calculus of mobile processes (I and II). Inf. Comput. 100, 1,1-77.
62. MILKER, R., PARROW, J., AND WALKER, D. 1993. Modal logics for mobile processes. Theoret. Comput.'Sci. 114,149-m.
63. MONTANARI, U. AND PiSTORE, M. 1995. Concurrent semantics for the jr-calculus. Electron. Notes Comput. Sei. l.
64. MONTANARI, U. AND YANKELEVICH, D. 1992. A parametric approach to localities. In Proceedings of ICALP '92. Lecture Notes in Computer Science, vol. 623. Springer-Verlag, New York, pp. 617628.
65. MOSSES, P. D. 1998. Semantics, modularity and rewriting logics. ENTCS 15.
66. NICOLLIN, X. AND SIFAKIS, J. 1991. An overview and synthesis on timed process algebras. In Real Time: Theory in Practice. Lecture Notes in Computer Science, vol. 600. Springer-Verlag, New York, pp. 526-548.
67. NIELSEN, M., PLOTKIN, G., AND WIKSKEL, G. 1981. Petri nets, event structures and domains, part 1. Theoret. Comput. Sei.
68. NOTTEGAR, C., PRIAMI, C., AND DEGANO, P. 1999. Semantic-driven performance evaluation. In Proceedings of FASE '99. Lecture Notes in Computer Science, vol. 1577. Springer-Verlag, New York, pp. 204-218.
69. NOTTEGAR, C., PRIAMI, C., AND DEGANO, P. Performance evaluation of mobile processes via abstract machines. IEEE TSE. To appear.
70. ORAVA, R 1994. On the formal analysis of telecommunications protocols. Ph.D. dissertation Dept. of Computer Systems, Uppsala University and SICS.
71. ORAVA, F. AND PARROW, J. 1992. An algebraic verification of a mobile network. Forma. Asp. Comput. 497-543.
72. PARK, D. 1981. Concurrency and automata on infinite sequences. In Proceedings of GI. Lecture Notes in Computer Science, vol. 104. SpringerVerlag, New York, pp. 167-183.
73. PIERCE, B.D. AND TURNER, D.N. 1999. PICT: A programming language based on the pi-calculus. In Proof, Language and Interaction: Essays in Honour of Robin Milner, MIT Press, Cambridge, Mass.
74. PLOTKIN, G. 1981. A structural approach to operational semantics. Tech. Rep. DAIMI FN-19. Aarhus University, Aarhus, Denmark.
75. PRATT, V. 1986. Modelling concurrency with partial orders. Int. J. Paral. Prog. 15, 33-71.
76. PRATT, V. 1991. Modelling concurrency with geometry. In Proceedings of the ACM Annual Symposium on Principles of Programming Languages, ACM, New York.
77. PRATT, V. Higher dimensional automata revisited. MFCS. To appear.
78. PRIAMI, C. 1995. Stochastic ;r-calculus. Comput. J. 38, 6, 578-589.
79. PRIAMI, C. 1996a. Enhanced operational semantics for concurrency. Ph.D. dissertation. Dipartimento di Informatica, Università di Pisa, Pisa, Italy. (Available as Tech. Rep. TD-08/96).
80. PRIAMI, C. 1996b. Integrating behavioural and performance analysis with topology information. In Proceedings of 29th Hawaian International Conference on System Sciences, Vol. 1 (Maui, Hawaii). IEEE Computer Society Press, Los Alamitos, Calif., pp. 508-516.
81. PRIAMI, C. 1996c. Interleaving-based partial ordering semantics. In Proceedings of the Italian Conference on Theoretical Computer Science (Ravello, Italy, Nov.), World Scientific, River Edge, NJ, pp. 264-278.
82. PRIAMI, C. AND YANKELEVICH, D. 1994. Read-write causality. In Proceedings of MFCS '94. Lecture Notes in Computer Science, vol. 841. SpringerVerlag, New York, pp. 567-576.
83. RABINOVICH, A. AND TRAKHTENBROT, B. 1988. Nets of processes. Fund. Inf. XI, 4, 357-404.
84. REISIG, W. 1985. Pétri nets: An introduction. In EATCS Monographs. Springer-Verlag, New York.
85. REPPY, J. 1992. Higher order concurrency. Ph.D. dissertation. Tech. Rep. 92-1285 Cornell University, Ithaca, N.Y.
86. SANGIORGI, D. 1992. Expressing mobility in process algebras: First-order and higher-order paradigms. Ph.D. dissertation. University of Edinburgh, Edinburgh, Scotland.
87. SANGIORGI, D. 1994. Locality and non-interleaving semantics in calculi for mobile processes. In Proceedings of TACS '94. Lecture Notes in Computer Science, vol. 789. Springer-Verlag, New York.
88. STORRLE, H. 1998. An evaluation of high-end tools for Petri nets. Tech. Rep. Ludwig-MaximiliansUniversitat München, Munich, Germany.
89. THOMSEN, B. 1993. Plain CHOCS: A second generation calculus for higher order processes. Acta Inf. 30, 1,1-59.
90. THOMSEN, B., LETH, L., PRASAD, S., Kuo, T.-M., KRAMER, A., KNABE, F., AND GIACALONE, A. 1993. Facile Antigua release programming guide. Tech. Rep. ECRC-93-20. European Computer-Industry Research Centre.
91. VAN GLABBEEK, R. J. AND GOLTZ, U. 1989. Equivalence notions for concurrent systems and refinement of actions. In Proceedings of MFCS '89. Lecture Notes in Computer Science, vol. 379. Springer-Verlag, New York.
92. VAN GLABBEEK, R. J., S.MOLKA, S. A., AND STEFFEN, B. 1995. Reactive, generative and stratified models of probabilistic processes. Inf. Comput. 121, pp. 59-80.
93. WALKER, D. 1994. Objects in the jr-calculus. Inf. Comput.
94. WINSKEL, G. 1982. Event structures for CCS and related languages. In Proceedings oflCALP '82. Lecture Notes in Computer Science, vol. 140. Springer-Verlag, New York, pp. 561-576.
95. WINSKEL, G. 1987. Petri nets, algebras, morphisms and compositionality. Inf. Comput. 72, 197-238.