The Power of Priority Channel Systems

DOI10.2168/LMCS-10(4:4)2014zbMath1448.68341MaRDI QIDQ5892062

Sylvain Schmitz, Christoph Haase, Philippe Schnoebelen

Publication date: 15 January 2015

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

zbMATH Keywords

well-quasi-orderwell-structured transition systemsfast-growing complexity

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (13)

Reachability problems on reliable and lossy queue automata ⋮ Unnamed Item ⋮ The inclusion structure of partially lossy queue monoids and their trace submonoids ⋮ Well quasi-orders arising from finite ordered semigroups ⋮ The transformation monoid of a partially lossy queue ⋮ On the state complexity of closures and interiors of regular languages with subwords and superwords ⋮ The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings ⋮ Unnamed Item ⋮ The ideal view on Rackoff's coverability technique ⋮ Perfect failure detection with very few bits ⋮ On Freeze LTL with Ordered Attributes ⋮ The Parametric Complexity of Lossy Counter Machines ⋮ Complexity Hierarchies beyond Elementary

This page was built for publication: The Power of Priority Channel Systems