DeepAI AI Chat
Log In Sign Up

Weak equivalence of higher-dimensional automata

10/28/2019
by   Thomas Kahl, et al.
0

This paper introduces a notion of weak equivalence for higher-dimensional automata. 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/28/2017

A Uniform Framework for Timed Automata and Beyond

Timed automata, and machines alike, currently lack a general mathematica...
02/24/2023

Weak equivalence of local independence graphs

Classical graphical modeling of multivariate random vectors uses graphs ...
07/07/2020

A Myhill-Nerode Theorem for Register Automata and Symbolic Trace Languages

We propose a new symbolic trace semantics for register automata (extende...
02/21/2018

Proper Semirings and Proper Convex Functors

Esik and Maletti introduced the notion of a proper semiring and proved t...
01/27/2019

Subsumption of Weakly Well-Designed SPARQL Patterns is Undecidable

Weakly well-designed SPARQL patterns is a recent generalisation of well-...
08/03/2021

Featured Team Automata

We propose featured team automata to support variability in the developm...
01/23/2018

Higher-dimensional automata modeling shared-variable systems

The purpose of this paper is to provide a construction to model shared-v...