{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:40Z","timestamp":1759063780799,"version":"3.40.3"},"publisher-location":"London","reference-count":22,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540199823"},{"type":"electronic","value":"9781447130789"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/978-1-4471-3078-9_12","type":"book-chapter","created":{"date-parts":[[2011,12,12]],"date-time":"2011-12-12T02:47:45Z","timestamp":1323658065000},"page":"175-189","source":"Crossref","is-referenced-by-count":17,"title":["Linear Space Algorithm for On-line Detection of Global Predicates"],"prefix":"10.1007","author":[{"given":"Roland","family":"J\u00e9gou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raoul","family":"Medina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lhouari","family":"Nourine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","first-page":"412","volume-title":"Proc. IEEE International Conference on Parallel and Distributed Systems","author":"S Alagar","year":"1994","unstructured":"S. Alagar and S. Venkatesan. Techniques to tackle state explosion in global predicate detection. In Proc. IEEE International Conference on Parallel and Distributed Systems, pp 412\u2013417, Taiwan, December 1994."},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/net.3230130210","volume":"13","author":"MO Ball","year":"1983","unstructured":"M.O. Ball and J.S. Provan. Calculating bounds on reachability and connectedness in stochastic networks. Networks, 13 (1), 253\u2013278, 1983.","journal-title":"Networks"},{"key":"12_CR3","volume-title":"Lattice Theory","author":"G Birkoff","year":"1967","unstructured":"G. Birkhoff. Lattice Theory, volume 25 of Coll. Publ. XXV. American Mathematical Society, Providence, 3rd edition, 1967."},{"key":"12_CR4","unstructured":"R. Bonnet and M. Pouzet. Extensions et stratifications d\u2019ensembles dispers\u00e9s. C.R. Acad. Sci., t. 268-S\u00e9rie A: 1512\u20131515, 1969."},{"issue":"3","key":"12_CR5","first-page":"265","volume":"25","author":"JP Bordat","year":"1991","unstructured":"J.P. Bordat. Calcul des id\u00e9aux d\u2019un ordonn\u00e9 fini. Recherche Op\u00e9rationnelle\/Operations Research, 25 (3): 265\u2013275, 1991.","journal-title":"Recherche Op\u00e9rationnelle\/Operations Research"},{"key":"12_CR6","volume-title":"Universit\u00e9 Paris","author":"B Charron-Bost","year":"1992","unstructured":"B. Charron-Bost, C. Delporte-Gallet, and H. Fauconnier. Local and temporal predicates in distributed systems. Technical Report LITP 92.36, Institut Blaise Pascal, Universit\u00e9 Paris 7, France, April 1992."},{"key":"12_CR7","first-page":"163","volume-title":"Proc. ACM\/ONR Workshop on Parallel and Distributed Debugging","author":"R Cooper","year":"1991","unstructured":"R. Cooper and K. Marzullo. Consistent detection of global predicates. In Proc. ACM\/ONR Workshop on Parallel and Distributed Debugging, pp 163\u2013173, Santa Cruz, California, May 1991."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"C. Diehl, C. Jard, and J.-X. Rampon. Reachability analysis on distributed executions. In Jouannaud Gaudel (ed), TAPS OFT, Springer-Verlag, Orsay (France), 1993, pp 629\u2013643 (LNCS 688).","DOI":"10.1007\/3-540-56610-4_94"},{"key":"12_CR9","first-page":"55","volume-title":"Proc. 11th Australian Computer Science Conference","author":"CJ Fidge","year":"1988","unstructured":"C.J. Fidge. Timestamps in message-passing systems that preserve the partial ordering. In Proc. 11th Australian Computer Science Conference, pp 55\u201366, University of Queensland, Australia, February 1988."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"V.K. Garg and B. Waldecker. Detection of unstable predicates in distributed programs. In Proc. of 12th Conference on the Foundations of Software Technology & Theoretical Computer Science, 1992, Springer Verlag, pp 253\u2013264, (LNCS 652).","DOI":"10.1007\/3-540-56287-7_110"},{"key":"12_CR11","unstructured":"V.K. Garg and B. Waldecker. Detection of weak unstable predicates in distributed programs. IEEE Transactions on Parallel and Distributed Systems, To appear."},{"key":"12_CR12","volume-title":"Tree structures for distributive lattice and its application. Research report, LIRMM","author":"M Habib","year":"1993","unstructured":"M. Habib and L. Nourine. Tree structures for distributive lattice and its application. Research report, LIRMM, Montpellier, France, October 1993."},{"key":"12_CR13","first-page":"1991","volume-title":"INRIA, Rennes","author":"J-M Helary","year":"1460","unstructured":"J.-M. Helary and M. Raynal. Towards the construction of distributed detection programs with an application to distributed termination. Research Report 1460, INRIA, Rennes, France, Juin 1991."},{"key":"12_CR14","volume-title":"Some on-line computations of the ideal lattice of posets. Internal Publication PI-773, IRISA","author":"C Jard","year":"1993","unstructured":"C. Jard, G.-V. Jourdan, and J.-X. Rampon. Some \u2018on-line\u2019 computations of the ideal lattice of posets. Internal Publication PI-773, IRISA, Rennes, France, October 1993."},{"issue":"7","key":"12_CR15","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21 (7): 558\u2013565, July 1978.","journal-title":"Communications of the ACM"},{"key":"12_CR16","volume-title":"Parallel and Distributed Algorithms","author":"F Mattern","year":"1989","unstructured":"F. Mattern. Virtual time and global states of distributed systems. In M. Cosnard et al. (ed), Parallel and Distributed Algorithms, pp 215\u2013226. Elsevier\/North- Holland, 1989."},{"key":"12_CR17","volume-title":"Proc. 5th IEEE Symposium on Parallel and Distributed Processing, pp 650\u2013655, Dallas (Texas)","author":"R Medina","year":"1993","unstructured":"R. Medina. Incremental Garbage Collection for Causal Relationship Computation in Distributed Systems. In Proc. 5th IEEE Symposium on Parallel and Distributed Processing, pp 650\u2013655, Dallas (Texas), 1993."},{"key":"12_CR18","volume-title":"Research Report","author":"R Medina","year":"1993","unstructured":"R. Medina and L. Nourine. Growing and pruning the consistent cuts tree. Research Report 93\u2013074, LIRMM, Montpellier, France, December 1993."},{"key":"12_CR19","first-page":"1115","volume":"1","author":"R Medina","year":"1994","unstructured":"R. Medina and L. Nourine. Algorithme efficace de g\u00e9n\u00e9ration des id\u00e9aux d\u2019un ensemble ordonn\u00e9. C.R. Acad. Sci., t. 319-S\u00e9rie 1: 1115\u20131120, 1994.","journal-title":"319-S\u00e9rie"},{"key":"12_CR20","volume-title":"Universit\u00e9 Montpellier","author":"L Nourine","year":"1993","unstructured":"L. Nourine. Quelques propri\u00e9t\u00e9s algorithmiques des treillis. PhD thesis, Universit\u00e9 Montpellier II, Montpellier, France, June 1993."},{"issue":"3","key":"12_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF02277859","volume":"7","author":"R Schwarz","year":"1994","unstructured":"R. Schwarz and F. Mattern. Detecting causal relationships in distributed computations - in search of the holy grail. Distributed Computing, 7 (3): 149\u2013174, 1994.","journal-title":"Distributed Computing"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0167-6377(86)90071-4","volume":"5","author":"G Steiner","year":"1986","unstructured":"G. Steiner. An algorithm for generating the ideals of a partial order. Operations Res. Lett., 5: 317\u2013320, 1986.","journal-title":"Operations Res Lett"}],"container-title":["Workshops in Computing","Structures in Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3078-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T06:57:45Z","timestamp":1675925865000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4471-3078-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540199823","9781447130789"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3078-9_12","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1995]]}}}