Senescent ground tree rewrite systems

DOI10.1145/2603088.2603112zbMath1401.68135arXiv1311.4915OpenAlexW2157976170MaRDI QIDQ4635633

Matthew Hague

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

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

zbMATH Keywords

reachabilityautomataPetri netsconcurrencyground term rewrite systemspushdown systemsunder-approximationground tree rewrite systemsreset Petri netsAckermann-hardbounded-context switchesscope-bounding

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Decidable models of integer-manipulating programs with recursive parallelism ⋮ The Parametric Complexity of Lossy Counter Machines ⋮ Complexity Hierarchies beyond Elementary

This page was built for publication: Senescent ground tree rewrite systems