Temporal hyperproperties for population protocols

DOI10.1007/978-3-031-90897-2_11MaRDI QIDQ6889885zbMATH OpenFDO

Authors Nicolas Waldburger, Chana Weil-Kennedy, Pierre Ganty, César Sánchez

Publication date 4 December 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-90897-2_11

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• A note on a question of Peled and Wilke regarding stutter-invariant LTL
• A per model of secure information flow in sequential programs
• Automated hypersafety verification
• Computation in networks of passively mobile finite-state sensors
• Constraint-based relational verification
• Finiteness of the odd perfect and primitive abundant numbers with \(n\) distinct prime factors.
• Model checking population protocols
• Model-checking linear-time properties of parametrized asynchronous shared-memory pushdown systems
• On the complexity of parameterized reachability in reconfigurable broadcast networks
• On the length of strongly monotone descending chains over \(\mathbb{N}^d\)
• Parameterized Analysis of Immediate Observation Petri Nets
• Population protocols with unordered data
• Population protocols: beyond runtime analysis
• Propositional Dynamic Logic for Hyperproperties
• Propositional dynamic logic of regular programs
• Reachability in vector addition systems is Ackermann-complete
• Recent results in population protocols for exact majority and leader election
• Software Verification of Hyperproperties Beyond k-Safety
• Structural Liveness of Immediate Observation Petri Nets
• Stutter-invariant temporal properties are expressible without the next-time operator
• The complementation problem for Büchi automata with applications to temporal logic
• The computational power of population protocols
• The equality problem for vector addition systems is undecidable
• The hierarchy of hyperlogics
• The ideal view on Rackoff's coverability technique
• The reachability problem for Petri nets is not primitive recursive
• Verification of population protocols
• Verification of population protocols with unordered data

This page was built for publication: Temporal hyperproperties for population protocols

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