Ordinal recursive complexity of unordered data nets
type: Item
instance of: scholarly article
title: Ordinal recursive complexity of unordered data nets
zbMATH Open document ID: 1370.68219
author: Fernando Rosa-Velardo
published in: Information and Computation
publication date: 2017-05-18T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03D55
Mathematics Subject Classification ID: 03D60
zbMATH DE Number: 6720009
zbMATH Keywords: data nets
zbMATH Keywords: ordinal recursive complexity
zbMATH Keywords: hyper-Ackermannian problems
zbMATH Keywords: fast-growing complexity hierarchy
zbMATH Keywords: multisets over \(\mathbb{N}^k\)
MaRDI profile type: Publication
full work available at URL: j.ic.2017.02.002
OpenAlex ID: W2591668504
cites work: Verifying programs with unreliable channels
cites work: Algorithmic analysis of programs with well quasi-ordered domains.
cites work: A classification of the expressive power of well-structured transition systems
cites work: Unreliable channels are easier to verify than perfect channels
cites work: Mixing Lossy and Perfect Fifo Channels
cites work: Analysis of Asynchronous Programs with Event-Based Synchronization
cites work: Well-structured transition systems everywhere!
cites work: A well-structured framework for analysing Petri net extensions
cites work: The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
cites work: Ordering by Divisibility in Abstract Algebras
cites work: Coverability Trees for Petri Nets with Unordered Data
cites work: Q3874266
cites work: Q3601861
cites work: The Complexity of Coverability in ν-Petri Nets
cites work: On the expressiveness of mobile synchronizing Petri nets
cites work: Decidability and complexity of Petri nets with unordered data
cites work: Multiset rewriting for the verification of depth-bounded processes with name binding
cites work: Multiply-Recursive Upper Bounds with Higman’s Lemma
cites work: Complexity hierarchies beyond elementary
cites work: Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
cites work: A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets
DOI: 10.1016/J.IC.2017.02.002
description: scientific article; zbMATH DE number 6720009