Blar i Fakultet for informasjonsteknologi og elektroteknikk (IE) på tidsskrift "Leibniz International Proceedings in Informatics"
Viser treff 1-3 av 3
-
Computational Complexity of the Interleaving Distance
(Journal article; Peer reviewed, 2018)The interleaving distance is arguably the most prominent distance measure in topological data analysis. In this paper, we provide bounds on the computational complexity of determining the interleaving distance in several ... -
Diamonds for Security: A Non-Interleaving Operational Semantics for the Applied Pi-Calculus
(Journal article; Peer reviewed, 2022) -
A Kleene Theorem for Higher-Dimensional Automata
(Peer reviewed; Journal article, 2022)We prove a Kleene theorem for higher-dimensional automata (HDAs). It states that the languages they recognise are precisely the rational subsumption-closed sets of interval pomsets. The rational operations include a gluing ...