APPROXIMATING TRACES

Citation
V. Diekert et P. Gastin, APPROXIMATING TRACES, Acta informatica, 35(7), 1998, pp. 567-593
Citations number
25
Categorie Soggetti
Computer Science Information Systems","Computer Science Information Systems
Journal title
ISSN journal
00015903
Volume
35
Issue
7
Year of publication
1998
Pages
567 - 593
Database
ISI
SICI code
0001-5903(1998)35:7<567:>2.0.ZU;2-Y
Abstract
In order to give a semantics to concurrent processes we need a model h aving some good mathematical properties. To this end we generalize (in finite) Mazurkiewicz traces by adding some alphabetical information co ncerning the possible continuations of a process. This allows to defin e an approximation order compatible with the composition. We obtain a prime algebraic and coherently complete domain where the compact eleme nts are exactly the finite approximations of processes. The compositio n is shown to be monotone and U-continuous. We define a suitable metri c 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) conti nuous. A preliminary version of this work appeared in [7].