Parameterized broadcast networks with registers: from NP to the frontiers of decidability

DOI10.1007/978-3-031-57231-9_12MaRDI QIDQ6629529

Corto N. Mascle, Lucie Guillou, Nicolas Waldburger

Publication date: 30 October 2024

zbMATH Keywords

distributed systemsparameterized verificationwell quasi-orders

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

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?)
• Ordinal recursive complexity of unordered data nets
• Verifying lossy channel systems has nonprimitive recursive complexity.
• Verifying programs with unreliable channels
• Parameterized verification of synchronization in constrained reconfigurable broadcast networks
• Liveness in broadcast networks
• Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
• Complexity hierarchies beyond elementary
• The Power of Well-Structured Systems
• Verification of Dynamic Register Automata
• The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
• Multiply-Recursive Upper Bounds with Higman’s Lemma
• Parameterized Verification of Ad Hoc Networks
• On Communicating Finite-State Machines
• Parameterized Verification of Broadcast Networks of Register Automata
• Ordering by Divisibility in Abstract Algebras
• Parameterized analysis of reconfigurable broadcast networks

This page was built for publication: Parameterized broadcast networks with registers: from NP to the frontiers of decidability

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