首页 | 本学科首页   官方微博 | 高级检索  
     


Approximating traces
Authors:Volker Diekert  Paul Gastin
Affiliation:Institut für Informatik, Universit?t Stuttgart, Breitwiesenstra?e 20-22, D-70565 Stuttgart, Germany (e-mail: diekert@informatik.uni-stuttgart.de), DE
LIAFA, Université Paris VII, 2, place Jussieu, F-75251 Paris Cedex 05, France (e-mail: Paul.Gastin@liafa.jussieu.fr), FR
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 -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]. Received: 2 July 1996 / 27 October 1997
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号