The asynchronous committee meeting problem

DOI10.1007/3-540-57899-4_59zbMath1528.68251OpenAlexW1536602633MaRDI QIDQ6143983

Javier Esparza, Bernhard von Stengel

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57899-4_59

zbMATH Keywords

N-free posetsmaximal antichainsPetri net unfoldingcommittee meeting problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Combinatorics of partially ordered sets (06A07) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Ordres "C.A.C."
• Model checking using net unfoldings
• Maximal chains and antichains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The asynchronous committee meeting problem