The asynchronous committee meeting problem

  • Javier Esparza
  • Bernhard von Stengel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 790)


The committee meeting problem consists in finding the earliest meeting time acceptable to every member of a committee. We consider an asynchronous version of the problem that does not presuppose the existence of a global clock, where meeting times are maximal antichains in a poset of ‘local times’, and propose an efficient algorithm to solve it. A generalization, the private meeting problem, where the earliest time for a meeting without some committee members is sought, turns out to be NP-complete. However, it can be solved in polynomial time if the poset is N-free, that is, representing a precedence of the arcs (and not the nodes) of an acyclic directed graph. This special case is relevant, because it allows to improve the key algorithm of the model checking technique developed in [4] for Petri nets.

Key words

Committee meeting problem maximal antichains N-free posets Petri net unfolding 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G. Behrendt: Maximal antichains in partially ordered sets. Ars Combinatoria 25 C (1988), 149–157.Google Scholar
  2. [2]
    E. Best and C. Fernández: Nonsequential Processes — A Petri Net View. EATCS Monographs on Theoretical Computer Science Vol. 13, Springer Verlag (1988).Google Scholar
  3. [3]
    K. M. Chandy and J. Misra: Parallel Program Design — A Foundation. Addison-Wesley (1988). (The meeting problem is considered on pages 14–18.)Google Scholar
  4. [4]
    J. Esparza: Model Checking Using Net Unfoldings. TAPSOFT'93: Theory and Practice of Software Development, M. C. Gaudel and J. P. Jouannaud (eds.), Lecture Notes in Computer Science 668 (1993), 613–628.Google Scholar
  5. [5]
    M. R. Garey and D. S. Johnson: Computers and Intractability — A Guide to the Theory of NP-Completeness. Freeman (1979).Google Scholar
  6. [6]
    P. A. Grillet: Maximal chains and antichains. Fundamenta Mathematicae 65 (1969), 157–167.Google Scholar
  7. [7]
    B. Leclerc and B. Monjardet: Ordres “C.A.C.”. Fundamenta Mathematicae 79 (1973), 11–22.Google Scholar
  8. [8]
    W. Reisig: Petri Nets — An Introduction. EATCS Monographs on Theoretical Computer Science Vol. 4, Springer Verlag (1985).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Javier Esparza
    • 1
  • Bernhard von Stengel
    • 2
  1. 1.Institut für InformatikUniversität HildesheimHildesheimGermany
  2. 2.Informatik 5Universität der Bundeswehr MünchenNeubibergGermany

Personalised recommendations