Weak equivalence of higher-dimensional automata

DOI10.46298/dmtcs.5884zbMath1496.68175arXiv1910.12787OpenAlexW3162858668MaRDI QIDQ5038191

Thomas Kahl

Publication date: 30 September 2022

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.12787

zbMATH Keywords

weak equivalencehigher-dimensional automatatrace languagehomology language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topological abstraction of higher-dimensional automata
• Theory of traces
• Myths about the mutual exclusion problem
• Combinatorics on traces
• Morse theory for cell complexes
• Forward and backward simulations. I. Untimed Systems
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Bisimulation from open maps
• Labeled homology of higher-dimensional automata
• Computing path categories of finite directed cubical complexes
• Towards a homotopy theory of process algebra
• The homology graph of a precubical set
• Weak morphisms of higher dimensional automata
• On the expressiveness of higher dimensional automata
• A convenient category of topological spaces
• The Coarsest Precongruences Respecting Safety and Liveness Properties
• Characterizations of the decidability of some problems for regular trace languages
• Formal Relationships Between Geometrical and Classical Models for Concurrency

This page was built for publication: Weak equivalence of higher-dimensional automata