Skip to main content
Log in

Approximating traces

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract.

In order to give a semantics to concurrent processes we need a model having some good mathematical properties. To this end we generalize (infinite) Mazurkiewicz traces by adding some alphabetical information concerning the possible continuations of a process. This allows to define an approximation order compatible with the composition. We obtain a prime algebraic and coherently complete domain where the compact elements are exactly the finite approximations of processes. The composition is shown to be monotone and \(\sqcup\)-continuous. We define a suitable metric which induces the Lawson topology and which yields a compact metric space being therefore complete. The finite approximations of processes form a dense and open subset and the composition is (uniformly) continuous. A preliminary version of this work appeared in [7].

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 2 July 1996 / 27 October 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Diekert, V., Gastin, P. Approximating traces. Acta Informatica 35, 567–593 (1998). https://doi.org/10.1007/s002360050132

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002360050132

Keywords

Navigation