Weak morphisms of higher dimensional automata
نویسنده
چکیده
We introduce weak morphisms of higher dimensional automata and use them to define preorder relations for HDAs, among which homeomor-phic abstraction and trace equivalent abstraction. It is shown that homeomor-phic abstraction is essentially always stronger than trace equivalent abstraction. We also define the trace language of an HDA and show that, for a large class of HDAs, it is invariant under trace equivalent abstraction.
منابع مشابه
The homology graph of a higher dimensional automaton
Higher dimensional automata, i.e. labelled precubical sets, model concurrent systems. We introduce the homology graph of an HDA, which is a directed graph whose nodes are the homology classes of the HDA. We show that the homology graph is invariant under homeomorphic abstraction, i.e. under weak morphisms that are homeomorphisms.
متن کاملAbout the globular homology of higher dimensional automata
We introduce a new simplicial nerve of higher dimensional automata whose homology groups yield a new definition of the globular homology. With this new definition, the drawbacks noticed with the construction of [Gau99] disappear. Moreover the important morphisms which associate to every globe its corresponding branching area and merging area of execution paths become morphisms of simplicial sets.
متن کاملCubical Sets and Trace Monoid Actions
This paper is devoted to connections between trace monoids and cubical sets. We prove that the category of trace monoids is isomorphic to the category of generalized tori and it is a reflective subcategory of the category of cubical sets. Adjoint functors between the categories of cubical sets and trace monoid actions are constructed. These functors carry independence preserving morphisms in th...
متن کاملUnifying Equivalences for Higher Dimensional Automata
The intention of the paper is to show how several categorical (open morphisms, path morphisms and coalgebraic morphisms based) approaches to an abstract characterization of bisimulation relate to each other and to behavioral bisimulations, in the setting of higher dimensional automata. Such a relating makes it possible to develop a metatheory designed for unified definition and study of equival...
متن کاملHomotopy Bisimilarity for Higher-Dimensional Automata
We introduce a new category of higher-dimensional automata in which the morphisms are functional homotopy simulations, i.e. functional simulations up to concurrency of independent events. For this, we use unfoldings of higher-dimensional automata into higher-dimensional trees. Using a notion of open maps in this category, we define homotopy bisimilarity. We show that homotopy bisimilarity is eq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 536 شماره
صفحات -
تاریخ انتشار 2014