Specification languages , Denotational semantics , Sequential composition
Abstract:
This paper focuses on the issue of modelling sequential composition in denotational linear time semantics for (nondeterministic) languages which admit infinite computations. This operator deserves special attention as it causes problems to meet the requirements of a standard denotational semantics based on metric or cpo. We present a general framework for the treatment of sequential composition. It turns out that a program can be described by its maximal computations in the metric approach whereas the partial order approach is suitable to describe a program by all its partial computations.
Additional information:
Das Dokument wird vom Publikationsserver der Universitätsbibliothek Mannheim bereitgestellt.
![[img]](https://madoc.bib.uni-mannheim.de/style/images/fileicons/application_pdf.png)
Search Authors in