Weak equivalence of higher-dimensional automata
From MaRDI portal
(Redirected from Publication:5038191)
Abstract: This paper introduces a notion of equivalence for higher-dimensional automata, called weak equivalence. Weak equivalence focuses mainly on a traditional trace language and a new homology language, which captures the overall independence structure of an HDA. It is shown that weak equivalence is compatible with both the tensor product and the coproduct of HDAs and that, under certain conditions, HDAs may be reduced to weakly equivalent smaller ones by merging and collapsing cubes.
Recommendations
- Weak morphisms of higher dimensional automata
- scientific article; zbMATH DE number 4203741
- Unifying Equivalences for Higher Dimensional Automata
- scientific article; zbMATH DE number 3874623
- Hierarchies of weak automata and weak monadic formulas
- On the expressiveness of higher dimensional automata
- Partial higher-dimensional automata
- Higher dimensional automata revisited
- On the Way to Alternating Weak Automata
- On the expressiveness of higher dimensional automata (extended abstract)
Cites work
- A convenient category of topological spaces
- Bisimulation from open maps
- Characterizations of the decidability of some problems for regular trace languages
- Combinatorics on traces
- Computing path categories of finite directed cubical complexes
- Directed algebraic topology. Models of non-reversible worlds
- Formal relationships between geometrical and classical models for concurrency
- Forward and backward simulations. I. Untimed Systems
- Higher-dimensional automata modeling shared-variable systems
- scientific article; zbMATH DE number 4030996 (Why is no real title available?)
- scientific article; zbMATH DE number 3676806 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3440338 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 3278860 (Why is no real title available?)
- Labeled homology of higher-dimensional automata
- Morse theory for cell complexes
- Myths about the mutual exclusion problem
- On the expressiveness of higher dimensional automata
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- The coarsest precongruences respecting safety and liveness properties
- The homology graph of a precubical set
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- Theory of traces
- Topological abstraction of higher-dimensional automata
- Towards a homotopy theory of process algebra
- Weak morphisms of higher dimensional automata
Cited in
(9)- Weak morphisms of higher dimensional automata
- scientific article; zbMATH DE number 1670757 (Why is no real title available?)
- Quasi-weak cost automata: a new variant of weakness
- Unifying Equivalences for Higher Dimensional Automata
- On the homology language of HDA models of transition systems
- On the topology of concurrent systems
- Logic and languages of higher-dimensional automata
- Hierarchies of weak automata and weak monadic formulas
- T-homotopy and refinement of observation. IV. Invariance of the underlying homotopy type
This page was built for publication: Weak equivalence of higher-dimensional automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5038191)
