On the homology language of HDA models of transition systems

DOI10.1007/S41468-023-00120-1MaRDI QIDQ6645910zbMATH OpenWikidataFDO

Authors Thomas Kahl

Publication date 29 November 2024

Published in Journal of Applied and Computational Topology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S41468-023-00120-1

zbMATH Keywords

higher-dimensional automatahomology languagetransition system

Mathematics Subject Classification ID

Other homology theories in algebraic topology (55N35) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Review text

Higher-Dimensional Automata (HDA) are combinatorial-topological models used to represent concurrent systems. The homological language is a homological tool used to describe the global independence structure of an HDA. The independence relation is a relation on the alphabet of labels that indicates which transitions can occur independently of each other. The paper shows that by choosing an acyclic relation whose symmetric closure is the given independence relation, one can construct a much smaller nonsymmetric HDA with the same homology language.

Recommendations

• Weak equivalence of higher-dimensional automata
• Higher-dimensional automata modeling shared-variable systems
• The homology graph of a precubical set
• Simplicial models for trace spaces. II: General higher dimensional automata
• Homology groups of asynchronous systems, Petri nets, and trace languages

Cites work

• Combinatorics of labelling in higher-dimensional automata
• Crossed Simplicial Groups and their Associated Homology
• Formal relationships between geometrical and classical models for concurrency
• Higher-dimensional automata modeling shared-variable systems
• scientific article; zbMATH DE number 4030996 (Why is no real title available?)
• scientific article; zbMATH DE number 1924514 (Why is no real title available?)
• scientific article; zbMATH DE number 821282 (Why is no real title available?)
• Labeled homology of higher-dimensional automata
• On symmetric higher-dimensional automata and bisimilarity
• On the algebra of cubes
• On the expressiveness of higher dimensional automata
• Skew-simplicial groups
• Weak equivalence of higher-dimensional automata

This page was built for publication: On the homology language of HDA models of transition systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645910)