Parameterized Structured Operational Semantics

Fundamenta Informaticae

Volumn 34, Issue 1, 1998, Pages 1-31

  Ferrari, Gian Luigi ^a   Montanari, Ugo ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Bisimulation Equivalence; Complete Axiomatizations; Interleaving and Truly Concurrent Semantics; Process Calculi; SOS Formats; Structured Operational Semantics (SOS)

Indexed keywords

EID: 0345723430     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1998-341201     Document Type: Article

References (45)

1. Aceto L.: "GSOS and Finite Labelled Transition Systems", Theoretical Computer Science, 131, 1994, 181-195
2. Aceto, L.: "Deriving Complete Inference Systems for A Class of GSOS Languages Generating Regular Behaviours", Proceedings CONCUR'94, Lecture Notes in Computer Science, Vol. 836, Springer, 1994.
3. Aceto, L., Bloom B. and Vaandrager, F.: "Turning SOS Rules into Equations", Information and Computation 111, 1994, 1-52.
4. Aceto, L. and Hennessy, M.: "Termination, Deadlock and Divergence", Journal of the ACM 39(1), 1992 147-187.
5. Aceto, L. and Ingolfsdottir, A.: "CPO models for Compact GSOS Languages", Information and Computation, 129(2), 1996, 107-141.
6. Aceto, L. and Murphy, D.: "Timing and Causality in Process Algebra" Acta Informatica 33(4), 1996.
7. J. Baeten, and J. Bergstra, Global Renaming Operators in Concrete Process Algebra, Information and Computation 78 (3), pp 205-245, 1988.
8. Baeten, J. and Verhoef, C.: "A Congruence Theorem for Structured Operational Semantics with Predicates", Proceedings CONCUR'93, Lecture Notes in Computer Science, Vol. 715, Springer, 1993.
9. Baeten, J. and Weiland, P.: Process Algebra Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.
10. Bednarczyk, M.: "Categories of Asynchronous Systems", PhD Thesis, University of Sussex, 1988.
11. Bergstra, J. and Klop, J.W.: "A Complete Inference System for Regular Processes with Silent Moves", Proceedings Logic Colloquium 1986, North Holland, 1988.
12. Bernstein, K. and Stark, E.: "Operational Semantics of a Focussing Debugger", Mathematical Foundation of Program Semantics (MFPS'95), ENTCS (1), 1995.
13. Bloom, B.: "Structured Operational Semantics for Weak Bisimulations", Theoretical Computer Science 146, 1995, 25-68.
14. Bloom, B., Istrail, S. and Meyer, A.R.: "Bisimulation Can't Be Traced" Journal of the ACM 42, 1995, 232-268.
15. Boudol, G. and Castellani, I.: "Permutations of Transitions: An Event Structure Semantics for CCS", Proceedings REX School, Workshop on Linear Time Branching Time and Partial Orders in Logics and Models for Concurrency, Lecture Notes in Computer Science, Vol. 354, Springer, 1989.
16. Boudol, G., Castellani, I., Hennessy, M. and Kiehn, A.: "Observing Localities" Theoretical Computer Science 114, 1993, 31-61.
17. Darondeau, P. and Degano, P.: Causal Trees, Proceedings ICALP 89, Lecture Notes in Computer Science, Vol. 372, Springer, 1989.
18. Degano, P. and Priami, C.: "Proved Trees", Proceedings ICALP'92 Lecture Notes in Computer Science, Vol. 623, Springer, 1992.
19. Degano, P. and Priami, C.: "Causality for Mobile Processes (Extended Abstract)", Proceedings ICALP'95 Lecture Notes in Computer Science, Vol 944, Springer, 1995.
20. De Simone, R.: "Higher Level Synchronising Devices in MEIJE-SCCS", Theoretical Computer Science 37 (3), 1985, 245-267.
21. Ferrari, G. and Montanari, U.: "The Observation Algebra of Spatial Pomsets", Proceedings CONCUR'91 Lecture Notes in Computer Science, Vol. 527, Springer, 1991.
22. Ferrari, G., Gorrieri, R., and Montanari, U.: "An Extended Expansion Theorem", Proceedings TAPSOFT 91, Lecture Notes in Computer Science, Vol. 494, Springer, 1991.
23. Ferrari, G., Montanari, U. and Quaglia, P.: "The Weak Late π-calculus Semantics as Observation Equivalence", Proceedings CONCUR'95, Lecture Notes in Computer Science, Vol. 962, Springer, 1995.
24. Ferrari, G., Montanari, U. and Quaglia, P.: "A π-calculus with Explicit Substitutions", Theoretical Computer Science 168, 1996, 341-368.
25. van Glabbeek, R.: "Full Abstraction in Structured Operational Semantics", Proceedings AMAST'93, Workshops in Computing, Springer-Verlag, 1993.
26. Groote, J.F.: "Transition System Specifications with Negative Premises", Proceedings CONCUR'90, Lecture Notes in Computer Science, Vol. 458, Springer, 1990.
27. Groote, J.F. and Vandraager, F.: "Structured Operational Semantics and Bisimulation as a Congruence", Information and Computation 100, 1992, 202-260.
28. Hennessy, M and Milner, R.: "Algebraic Laws for Nondeterminism and Concurrency", Journal of ACM 32(1), 1985, 137-141.
29. Larsen, K. and Xinxin, L.: "Compositionality Through an Operational Semantics of Contexts", Proceedings ICALP'90 Lecture Notes in Computer Science, Vol. 443, Springer, 1990.
30. Milner, R.: "A Complete Inference System for a Class of Regular Behaviours", Journal of Computer and System Science 28, 1994.
31. Milner, R.: Communication and Concurrency, Prentice Hall, 1989.
32. Milner, R.: "A Complete Axiomatization for Observational Congruence of Finite-State Behaviours", Information and Computation 81, 1989.
33. Milner, R. Parrow, J. and Walker, D.: "A Calculus of Mobile Processes" (Parts I and II) Information and Computation 100, 1992, 1-77.
34. Meseguer, J.: "General Logics", Logic Colloquium'87, North Holland 1989.
35. Montanari, U. and Yankelevich, D.: "Location Equivalence in a Parametric Setting", Theoretical Computer Science 149(2), 1995, 299-332.
36. Park, D.: "Concurrency and Automata on Infinite Sequences", Lecture Notes in Computer Science, Vol. 104, Springer, 1981.
37. Plotkin, G.: "A Structured Approach to Operational Semantics", DAIMI FN-19, Computer Science Dept., University of Aarhus, 1981
38. Priami, C.: "Enhanced Operational Semantics", PhD Thesis, Dipartimento di Informatica, Univ. Pisa, 1996.
39. Quaglia, P.: "A π-calculus with Explicit Substitution", PhD Thesis, Dipartimento di Informatica, Univ. Pisa, 1996.
40. Rutten, J.: "Processes as Terms: Non Well-founded Models for Bisimulations" Mathematical Structures in Computer Science 2, 1992.
41. Sangiorgi, D.: "A Theory of Bisimulation for the π-calculus", Acta Informatica 33, 1996, 69-97.
42. Thomsen, B.: "Plain Chocs", Acta Informatica 30, 1993, 1-59.
43. Ulidowski, I.: "Axiomatizations of Weak Equivalences for De Simone Languages", Proceedings CONCUR'95, Lecture Notes in Computer Science, Vol. 962, Springer, 1995.
44. Vaandrager, F.: "Expressiveness Results for Process Algebras", Semantics: Foundations and Applications, Lecture Notes in Computer Science, Vol. 666, Springer, 1993.
45. Winskel, G.: "Synchronization Trees", Theoretical Computer Science, 34(1), 1984, 33-82.