{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:33:18Z","timestamp":1725489198763},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540417910"},{"type":"electronic","value":"9783540452515"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45251-6_7","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T01:53:28Z","timestamp":1186883608000},"page":"119-134","source":"Crossref","is-referenced-by-count":2,"title":["Avoiding State Explosion for Distributed Systems with Timestamps"],"prefix":"10.1007","author":[{"given":"Fabrice","family":"Derepas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Gastin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Plainfoss\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,3,16]]},"reference":[{"issue":"5","key":"7_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"G. J. Holzmann","year":"1997","unstructured":"G. J. Holzmann. The Spin Model Checker. IEEE Trans. on Software Engineering, 23(5):279\u2013295, May 1997.","journal-title":"IEEE Trans. on Software Engineering"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"T. Bolognesi and E. Brinksma. Introduction to the ISO Speci_cation Language lotos. Computer Networks and ISDN Systems, pages 25\u201359, 1987.","DOI":"10.1016\/0169-7552(87)90085-7"},{"key":"7_CR3","unstructured":"M. Plath and M. Ryan. Plug and Play Features. Fifth International Workshop on Feature Interactions in Telecommunications and Software Systems, 1998. IOS Press."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"C. Pecheur. Advanced Modeling and Verification Techniques Applied to a Cluster File System. Proc. of the 14th IEEE International Conference on Automated Software Engineering ASE-99, October 1999.","DOI":"10.1109\/ASE.1999.802152"},{"issue":"1-2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0167-6423(96)00034-2","volume":"29","author":"H. Garavel","year":"1997","unstructured":"H. Garavel and L. Mounier. Specification and Verification of Various Distributed Leader Election Algorithms for Unidirectional Ring Networks. Science of Computer Programming, 29(1-2):171\u2013197, 1997.","journal-title":"Science of Computer Programming"},{"key":"7_CR6","unstructured":"M. Calder and A. Miller. Analyzing a Basic Call Protocol Using Promela\/Xspin. Fourth International Spin Workshop, Nov. 1998."},{"key":"7_CR7","series-title":"Lect Notes Comput Sci","isbn-type":"print","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60761-7","volume-title":"Partial-Order Methods for the Verification of Concurrent Systems-An Approach to the State-Explosion Problem","author":"P. Godefroid","year":"1996","unstructured":"P. Godefroid. \u201dPartial-Order Methods for the Verification of Concurrent Systems-An Approach to the State-Explosion Problem, volume 1032 of Lecture Notes in Computer Science. Springer-Verlag, January 1996. ISBN 3-540-60761-7.","ISBN":"http:\/\/id.crossref.org\/isbn\/3540607617"},{"key":"7_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/3-540-61550-4_141","volume-title":"Proc. of MFCS\u201996","author":"D. Peled","year":"1996","unstructured":"D. Peled. Partial-Order Reductions: Model Checking Using Representatives. In Proc. of MFCS\u201996, number 1113 in Lecture Notes in Computer Science, pages 93\u2013112. Springer-Verlag, 1996."},{"issue":"1\/2","key":"7_CR9","first-page":"41","volume":"9","author":"C. N. Ip","year":"1996","unstructured":"C. Norris Ip and D. L. Dill. Better Verification Through Symmetry. Formal Methods in System Design, 9(1\/2):41\u201375, August 1996.","journal-title":"Formal Methods in System Design"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"T. P. Petrov, A. Pogosyants, S. J. Garland, V. Luchangco, and N. A. Lynch. Computer-Assisted Verification of an Algorithm for Concurrent Timestamps. In Reinhard Gotzhein and Jan Bredereke, editors, Formal Description Techniques IX: Theory, Applications, and Tools, pages 29\u201344. Chapman & Hall, 1996.","DOI":"10.1007\/978-0-387-35079-0_2"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"R. Khazan, A. Fekete, and N. A. Lynch. Multicast Group Communication as a Base for a Load-Balancing Replicated Data Service. DISC\u2019 98(formerly WDAG) 12th International Symposium on DIStributed Computing, 1998.","DOI":"10.1007\/BFb0056488"},{"issue":"3","key":"7_CR12","first-page":"219","volume":"2","author":"N. A. Lynch","year":"1989","unstructured":"N. A. Lynch and M. R. Tuttle. An Introduction to Input\/Output Automata. CWI-Quaterly, 2(3):219\u2013246, September 1989.","journal-title":"CWI-Quaterly"},{"key":"7_CR13","unstructured":"S. Garland and J. Guttag. A Guide to lp, the Larch Prover. Technical Report 82, DEC Systems Research Center, 1991."},{"key":"7_CR14","series-title":"Lect Notes Comput Sci","volume-title":"Reliable Software Technologies-Ada Europe\u2019 96","author":"R. Guerraoui","year":"1996","unstructured":"R. Guerraoui and A. Schiper. Fault-Tolerance by Replication in Distributed Systems. Reliable Software Technologies-Ada Europe\u2019 96. Lecture Notes in Computer Science, 1088, 1996."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"D. R. Cheriton and D. Skeen. Understanding the Limitations of Causally and Totally Ordered Communication. Proc. of the 14th Symposium on Operating Systems Principles, December 1993.","DOI":"10.1145\/168619.168623"},{"issue":"6","key":"7_CR16","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0020-0190(91)90008-6","volume":"39","author":"M. Raynal","year":"1991","unstructured":"M. Raynal, A. Schiper, and S. Toueg. The Causal Ordering Abstraction and a Simple Way to Implement It. IPL, 39(6):343\u2013350, 1991.","journal-title":"IPL"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"K. Birman, A. Schiper, and P. Stephenson. Lightweight Causal and Atomic Group Multicast. ACM Trans. on Computer Systems, pages 272\u2013314, August 1991.","DOI":"10.1145\/128738.128742"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"A. Isra\u00e5li and M. Li. Bounded Time-Stamps. Proc 28th IEE Symposium on Foundations of Computer Science, pages 371\u2013382, 1987.","DOI":"10.1109\/SFCS.1987.10"},{"issue":"2","key":"7_CR19","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/S0097539790192647","volume":"26","author":"D. Dolev","year":"1997","unstructured":"D. Dolev and N. Shavit. Bounded Concurrent Time-Stamping. SIAM Journal on Computing, 26(2):418\u2013455, April 1997.","journal-title":"SIAM Journal on Computing"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"R. Cori and E. Sopena. Some Combinatorial Aspects of Time-Stamp Systems. European Journal of Combinatorics, pages 95\u2013102, 1993.","DOI":"10.1006\/eujc.1993.1013"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"A. Pnueli. The Temporal Logic of Programs. Proc 18th IEEE Symp. Foundations of Computer Science, pages 46\u201357, 1977.","DOI":"10.1109\/SFCS.1977.32"},{"key":"7_CR22","first-page":"995","volume-title":"Handbook of Theoretical Computer Science","author":"E.A. Emerson","year":"1990","unstructured":"E.A. Emerson. Temporal and Modal Logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 16, pages 995\u20131072. Elsevier Publ. Co., Amsterdam, 1990."},{"issue":"1","key":"7_CR23","first-page":"56","volume":"10","author":"C. J. Fidge","year":"1988","unstructured":"C. J. Fidge. Timestamps in Message-Passing Systems that Preserve the Partial Ordering. Australian Computer Science Communications, 10(1):56\u201366, February 1988.","journal-title":"Australian Computer Science Communications"},{"key":"7_CR24","unstructured":"F. Mattern. Virtual Time and Global States of Distributed Systems. In M. Cosnard et al., editor, Parallel and Distributed Algorithms, pages 215\u2013226. North-Holland, 1989."}],"container-title":["Lecture Notes in Computer Science","FME 2001: Formal Methods for Increasing Software Productivity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45251-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:48:46Z","timestamp":1556740126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45251-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540417910","9783540452515"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45251-6_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}