The asynchronous committee meeting problem

DOI10.1007/3-540-57899-4_59MaRDI QIDQ6143983zbMATH OpenOpenAlexFDO

Authors 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

committee meeting problemmaximal antichainsN-free posetsPetri net unfolding

Mathematics Subject Classification ID

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

Recommendations

• Efficiency of semisynchronous versus asynchronous networks
• New NP-Complete Problems in Performance Evaluation of Concurrent Systems Using Petri Nets
• The parallel complexity of two problems on concurrency
• scientific article; zbMATH DE number 4096792
• scientific article; zbMATH DE number 1500562

Cites work

• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 4073041 (Why is no real title available?)
• scientific article; zbMATH DE number 193318 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 194539 (Why is no real title available?)
• Maximal chains and antichains
• Model checking using net unfoldings
• Ordres "C.A.C."

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

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