Transition graphs semantics and languages
This paper is organised in two parts. In the first part, transition graphs, labelled at nodes, are considered as a general and nevertheless operational semantical setting for analysing some program properties that do not require the definition of the program constructs. Bisimulation, the known behaviour equivalence, is formulated for such transition graphs.
In the second part, a family of formalized languages is considered and its expressiveness with respect to transition graphs is analysed. It is shown that Milner's semantical characterization of logical equivalence can be stated.
KeywordsInductive Hypothesis Transition System Boolean Algebra Transition Graph Boolean Formula
Unable to display preview. Download preview PDF.
- S.D. Brooks and W.C. Rounds, "Behavioural equivalence relations induced by programming logics," LNCS vl.54,pp.97–108 (1983).Google Scholar
- M. Hennessy and C. Stirling, "The Power of the future perfect in program logics", Internal report, CSR-156-83, Department of Computer Science, University of Edinburgh.Google Scholar
- G.F. Mascari and M. Venturini Zilli, "While programs with nondeterministic assignments and the logic ALNA," to appear in TCS.Google Scholar
- G. Mirkowska, L. Stapp, " Algorithmic Logic can express progressive behaviour of programs", preprint.Google Scholar
- G. Mirkowska, "Algorithmic Logic with nondeterministic programs", Fundamenta Informaticae 3,pp.45–64 (1980).Google Scholar
- V. Pratt, "Process Logic", in Proceedings 6-th POPL, Jan. 1979, pp.93–100.Google Scholar
- H. Rasiowa, "Many-valued Algorithmic Logic as a tool to investigate programs", in "Modern uses of multiple-valued logic", eds. J.M. Dunn and G. Epstein (1977), Reidel Pn. Co., pp. 77–102.Google Scholar
- J. Sifakis, "A Unified approach for studying the properties of transition systems", TCS, pp.227–258 (1982).Google Scholar