{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T20:59:58Z","timestamp":1770411598949,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540538325","type":"print"},{"value":"9783540463108","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-53832-1_45","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:13:34Z","timestamp":1330208014000},"page":"221-238","source":"Crossref","is-referenced-by-count":4,"title":["Remarks on some concurrency measures"],"prefix":"10.1007","author":[{"given":"M.","family":"Habib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Morvan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. X.","family":"Rampon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"M. Aigner, \"Combinatorial Theory\", Springer-Verlag, 1979.","DOI":"10.1007\/978-1-4615-6666-3"},{"key":"19_CR2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-94-009-2639-4_5","volume-title":"Algorithms and Order","author":"M.D. Atkinson","year":"1989","unstructured":"M.D. Atkinson, \"The complexity of Orders\", in Algorithms and Order, (I. Rival, ed.) Kluwer Acad. Publ., Dordrecht (1989) 195\u2013230."},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/978-94-009-2639-4_6","volume-title":"Algorithms and Order","author":"V. Bouchitt\u00e9","year":"1989","unstructured":"V. Bouchitt\u00e9, M. Habib, \"The calculation of invariants for ordered sets\", in Algorithms and Order, (I. Rival, ed.) Kluwer Acad. Publ., Dordrecht (1989) 231\u2013279."},{"issue":"1","key":"19_CR4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","volume":"3","author":"K.M. Chandy","year":"1985","unstructured":"K.M. Chandy, L. Lamport, \"Distributed snapshots: determining global states of distributed systems\", in ACM Trans on Computer Systems, vol. 3, No1 (1985) 63\u201375.","journal-title":"ACM Trans on Computer Systems"},{"key":"19_CR5","unstructured":"B. Charron-Bost, \"Combinatorics and geometry of consistent cuts: application to concurrency theory\", Rapport de Recherche de l'Ecole Normale Sup\u00e9rieure, Paris, Liens No89-3, avril 89."},{"key":"19_CR6","unstructured":"B. Charron-Bost, \"Mesures de la concurrence et du parall\u00e9lisme des calculs r\u00e9partis\", Th\u00e8se de Doctorat, Universit\u00e9 Paris VII, 1989."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"D.G. Corneil, Y. Perl, \"Clustering and domination in perfect graphs\", Discrete Applied Math. (1984).","DOI":"10.1016\/0166-218X(84)90088-X"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"S.A. Cook, \"The complexity of theorem proving procedures\", Proc. 3rd Ann. ACM Symp. on Theory of Computing (1971) 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"19_CR9","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1090\/psapm\/010\/0115940","volume":"10","author":"R.P. Dilworth","year":"1960","unstructured":"R.P. Dilworth, \"Some combinatorial problems on partially ordered sets\", in R. Bellman, M. Hall (ed.), Combinatorial Analysis, Proc. Symp. Appl. Math., vol. 10, AMS, Providence (1960) 85\u201390.","journal-title":"Proc. Symp. Appl. Math."},{"key":"19_CR10","unstructured":"J. Fidge, \"Timestamps in message-passing systems that preserve the partial ordering\", Proc. 11th Australian Computer Science Conference (1988) p. 56\u201366."},{"key":"19_CR11","unstructured":"J. Fidge, \"A simple run-time concurrency measure\", preprint 1989."},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"P.C. Fishburn, \"Interval orders and interval graphs\", Wiley, 1985.","DOI":"10.1016\/0012-365X(85)90042-1"},{"key":"19_CR13","unstructured":"M.R. Garey, D.S. Johnson, \"Computers and intractability: a guide to the theory of NP-completeness\", Freeman, 1979."},{"key":"19_CR14","volume-title":"Algorithmic graph theory and perfect graphs","author":"M.C. Golumbic","year":"1980","unstructured":"M.C. Golumbic, \"Algorithmic graph theory and perfect graphs\", Academic Press, New-York, 1980."},{"key":"19_CR15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0012-365X(85)90039-1","volume":"55","author":"M.C. Golumbic","year":"1985","unstructured":"M.C. Golumbic, \"Interval graphs and related topics\", Discrete Mathematics 55 (1985) 113\u2013121.","journal-title":"Discrete Mathematics"},{"key":"19_CR16","doi-asserted-by":"crossref","first-page":"157","DOI":"10.4064\/fm-65-2-157-167","volume":"65","author":"P. Grillet","year":"1969","unstructured":"P. Grillet, \"Maximal chains and antichains\", Fund. Math. 65 (1969), 157\u2013167.","journal-title":"Fund. Math."},{"issue":"3","key":"19_CR17","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0166-218X(85)90030-7","volume":"12","author":"M. Habib","year":"1985","unstructured":"M. Habib, R. Jegou, \"N-free posets as generalizations of series-parallel posets\", Discret Appl. Math. 12(3) (1985), 279\u2013291.","journal-title":"Discret Appl. Math."},{"key":"19_CR18","unstructured":"M. Habib, M. Morvan, J.X. Rampon, \"About minimal interval order extensions\", Research Report CRIM, No84, juin 90."},{"key":"19_CR19","unstructured":"J.M. Helary, N. Plouzeau, M. Raynal, \"A characterization of a particular class of distributed snapshots\", in Proc. of Int. Conf. on Computing and Information (ICCC'89), Toronto, North-Holland (1989) 23\u201327."},{"key":"19_CR20","first-page":"77","volume":"4","author":"T. Hiraguchi","year":"1955","unstructured":"T. Hiraguchi, \"On the dimension of partially ordered sets\", Sci. Rep. Kanazawa Univ. 4 (1955) 77\u201394.","journal-title":"Sci. Rep. Kanazawa Univ."},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"D. Kelly, W.T. Trotter, \"Dimension theory for ordered sets\", in \"Ordered sets\", I. Rival ed., D. Reidel Publishing Company (1982) 171\u2013211.","DOI":"10.1007\/978-94-009-7798-3_5"},{"key":"19_CR22","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1137\/0218005","volume":"18","author":"N. Korte","year":"1989","unstructured":"N. Korte, R.H. M\u00f6hring, \"An incremental linear-time algorithm to recognize intervals graphs\", SIAM Journal of Computing 18 (1989) 68\u201381.","journal-title":"SIAM Journal of Computing"},{"issue":"7","key":"19_CR23","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"L. Lamport, \"Time, clock and the ordering of the events in a distributed system\", Comm. of the ACM 21:7 (1978) 551\u2013565.","journal-title":"Comm. of the ACM"},{"key":"19_CR24","doi-asserted-by":"crossref","first-page":"11","DOI":"10.4064\/fm-79-1-11-22","volume":"79","author":"B. Leclerc","year":"1973","unstructured":"B. Leclerc, B. Monjardet, \"Orders \u2018C.A.C.'\", Fund. Math. 79 (1973), 11\u201322.","journal-title":"Fund. Math."},{"key":"19_CR25","unstructured":"Ma, J. Spinrad, \"Avoiding matrix multiplication\" same issue."},{"key":"19_CR26","unstructured":"F. Mattern, \"Virtual time and global states of distributed systems\", in Parallel and Distributed Algorithms, M. Cosnard et al. (Ed.), Elsevier Science Publications (North-Holland), (1989) 215\u2013226."},{"key":"19_CR27","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01840392","volume":"5","author":"F. Mattern","year":"1990","unstructured":"F. Mattern, \"Asynchronous distributed termination \u2014 parallel and symmetric solutions with echo algorithms\", Algorithmica (1990) 5: 325\u2013340.","journal-title":"Algorithmica"},{"key":"19_CR28","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-94-009-5315-4_2","volume-title":"Graphs and Order","author":"R.H. M\u00f6hring","year":"1985","unstructured":"R.H. M\u00f6hring, \"Algorithmic aspects of comparability graphs and interval graphs\", in Graphs and Order (I. Rival, ed.) D. REIDEL, Dordrecht (1985) 41\u2013102."},{"key":"19_CR29","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-94-009-2639-4_4","volume-title":"Algorithms and Order","author":"R.H. M\u00f6hring","year":"1989","unstructured":"R.H. M\u00f6hring, \"Computationally tractable classes of ordered sets\", in Algorithms and Order, (I. Rival, ed.), Kluwer Acad. Publ., Dordrecht, (1989) 105\u2013193."},{"issue":"3","key":"19_CR30","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1109\/TSE.1983.236733","volume":"SE-9","author":"D.S. Parker","year":"1983","unstructured":"D.S. Parker, et al., \"Detection of mutual inconsistency in distributed systems\", IEEE Transactions on Software Engineering, vol. SE-9, No3, May (1983) 240\u2013246.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"19_CR31","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"J.S. Provan","year":"1983","unstructured":"J.S. Provan and M.O. Ball, \"The complexity of counting cuts and of computing the probability that a graph is connected\", SIAM J. Comput. 12, 777\u2013788 (1983).","journal-title":"SIAM J. Comput."},{"key":"19_CR32","unstructured":"K. Reuter, \"The jump number and the lattice of maximal antichains\", preprint Darmstadt, 1989, to appear in Discrete mathematics."},{"key":"19_CR33","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1090\/S0002-9939-1983-0715851-3","volume":"89","author":"I. Rival","year":"1982","unstructured":"I. Rival, \"Optimal linear extensions by interchanging chains\", Proc. Amer. Math. Soc. 89 (1982), 387\u2013394.","journal-title":"Proc. Amer. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53832-1_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:51:00Z","timestamp":1605646260000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53832-1_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540538325","9783540463108"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-53832-1_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}