The Power of Well-Structured Systems

DOI10.1007/978-3-642-40184-8_2zbMath1390.68488arXiv1402.2908OpenAlexW1494684396MaRDI QIDQ2842095

Sylvain Schmitz, Philippe Schnoebelen

Publication date: 12 August 2013

Published in: CONCUR 2013 – Concurrency Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (12)

Parameterized model checking of rendezvous systems ⋮ Handling infinitely branching well-structured transition systems ⋮ Attributed transition systems with hidden transitions ⋮ SMT-based verification of data-aware processes: a model-theoretic approach ⋮ The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings ⋮ Expressive Power of Broadcast Consensus Protocols ⋮ Running time analysis of broadcast consensus protocols ⋮ Analysis of the structure of attributed transition systems without hidden transitions ⋮ Well-structured graph transformation systems ⋮ Coverability Trees for Petri Nets with Unordered Data ⋮ The Parametric Complexity of Lossy Counter Machines ⋮ Complexity Hierarchies beyond Elementary

This page was built for publication: The Power of Well-Structured Systems