On-line computations of the ideal lattice of posets

Claude Jard; Guy-Vincent Jourdan; Jean-Xavier Rampon

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1995)

  • Volume: 29, Issue: 3, page 227-244
  • ISSN: 0988-3754

How to cite


Jard, Claude, Jourdan, Guy-Vincent, and Rampon, Jean-Xavier. "On-line computations of the ideal lattice of posets." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 29.3 (1995): 227-244. <http://eudml.org/doc/92506>.

author = {Jard, Claude, Jourdan, Guy-Vincent, Rampon, Jean-Xavier},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {ideal lattice of posets},
language = {eng},
number = {3},
pages = {227-244},
publisher = {EDP-Sciences},
title = {On-line computations of the ideal lattice of posets},
url = {http://eudml.org/doc/92506},
volume = {29},
year = {1995},

AU - Jard, Claude
AU - Jourdan, Guy-Vincent
AU - Rampon, Jean-Xavier
TI - On-line computations of the ideal lattice of posets
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1995
PB - EDP-Sciences
VL - 29
IS - 3
SP - 227
EP - 244
LA - eng
KW - ideal lattice of posets
UR - http://eudml.org/doc/92506
ER -


  1. 1. A. V. AHO, J. E. HOPCROFT and J. D. ULLMAN, The design and Analysis of Computer Algorithms, Addison-Wesley Series in Computer Science and Information Processing, 1974. Zbl0326.68005MR413592
  2. 2. O. BABAOGLU and M. RAYNAL, Sequence-Based Global Predicates for Distributed Computations: Definitions and Detection Algorithms, IRISA research report No. 729, Mai 1993. 
  3. 3. G. BIRKHOFF, Rings of Sets, Duke Math., 1937, J-3, pp. 311-316. MR1545989
  4. 4. R. BONNET and M. POUZET, Extensions et stratifications d'ensembles dispersés, C. R. Acad. Sci. Paris, 1969, t. 268, Série A, pp. 1512-1515. Zbl0188.04203MR242726
  5. 5. J. P. BORDAT, Calcul des idéaux d'un ordoné fini, Recherche opérationnelle/Operations Research, 1991, 25, n° 4, pp. 265 à 275. Zbl0733.90038MR1128468
  6. 6. J. P. BORDAT, Sur l'algorithme combinatoire d'ordres finis, Doctorat d'État es Sciences USTL Montpellier, 1992. 
  7. 7. V. BOUCHITTÉ and M. HABIB, The Calculation of Invariants of Ordered Sets, I. Rival (ed.), Algorithms and Order, 231-279, NATO Series C, 255, Kluwer Academic Publishers, 1989. Zbl1261.06002MR1037785
  8. 8. G. CHATY and M. CHEIN, Ordered Matchings and Matchings without Alternating Cycles in Bipartite Graphs, Utilitas Mathematica, 1979, 16, pp. 183-187. Zbl0446.05037MR556990
  9. 9. R. COOPER and K. MARZULLO, Consistent Detection of Global Predicates, In Proc. ACM/ONR Workshop on Parallel and Distributed Debugging, pp. 163-173, Santa Cruz, California, May 1991. 
  10. 10. C. DIEHL, Analyse de la relation de causalité dans les exécutions réparties, Thèse, 14 Septembre 1992, Université de Rennes 1. 
  11. 11. C. DIEHL, C. JARD and J. X. RAMPON, Reachability Analysis on Distributed Executions, TAPSOFT'93: Theory and Practice of Software Development, in Lecture Notes in Computer Science, 1993, No. 668, Springer-Verlag, pp. 629-643. MR1236494
  12. 12. C. DIEHL, C. JARD and J. X. RAMPON, Computing On-Line the Covering Graph of the Ideal Lattice of Posets, IRISA research report No. 703, February 1993. 
  13. 13. C. FIDGE, Timestamps in Message Passing Systems that Preserve the Partial Ordering, In Proc. 11th Australian Computer Science Conference, 55-66, February 1988. 
  14. 14. M. HABIB and L. NOURINE, Linear Time Recognition Algorithm for Distributive Lattices, Order 11: pp. 197-210, 1994. 
  15. 15. R. JANICKI and M. KOUNTY, Structure of Concurrency, Theoretical Computer Science, 1993, 772, pp. 5-52. Zbl0814.68061MR1221149
  16. 16. G. V. JOURDAN, J. X. RAMPON and C. JARD, Computing On-Line the Maximal Antichain Lattice of Posets, Order 11: pp. 197-210, 1994. Zbl0814.06004MR1308475
  17. 17. Y. KODA and F. RUSKEY, A Gray Code for the Ideals of a Forest Poset, Journal of Algorithms, 1993, 15, pp. 324-340. Zbl0782.94014MR1231447
  18. 18. L. LAMPORT, Time, Clocks and the Ordering of Events in a Distributed System, Communications of the ACM, July 1978, 21 (7), pp. 558-565. Zbl0378.68027
  19. 19. F. MATTERN, Virtual Time and Global States of Distributed Systems, In Cosnard, Quinton, Raynal and Robert, editors, Proc. Int. Workshop on Parallel and Distributed Algorithms, Bonas France October 1988, North-Holland, 1989. Zbl0648.68036MR1053973
  20. 20. G. STEINER, An Algorithm to Generate the Ideals of a Partial Order, Operations Research Letters, 1986, No. 6, pp. 317-320. Zbl0608.90075MR875784

NotesEmbed ?


You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.


Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.