Branch-well-structured transition systems and extensions

DOI10.46298/LMCS-20(2:12)2024MaRDI QIDQ6563059

Amrita Suresh, Benedikt Bollig, Alain Finkel

Publication date: 27 June 2024

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

zbMATH Keywords

verificationdecidabilityterminationcoverabilitywell-quasi ordering

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A classification of the expressive power of well-structured transition systems
• Reduction and covering of infinite reachability trees
• Finiteness of the odd perfect and primitive abundant numbers with \(n\) distinct prime factors.
• Handling infinitely branching well-structured transition systems
• A well-structured framework for analysing Petri net extensions
• Algorithmic analysis of programs with well quasi-ordered domains.
• Computable fixpoints in well-structured symbolic model checking
• Nonelementary Complexities for Branching VASS, MELL, and Extensions
• A partition calculus in set theory
• Well-Structured Model Checking of Multiagent Systems
• On Communicating Finite-State Machines
• Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
• Ordering by Divisibility in Abstract Algebras
• The Well Structured Problem for Presburger Counter Machines
• Well-structured transition systems everywhere!

This page was built for publication: Branch-well-structured transition systems and extensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563059)