{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:05Z","timestamp":1725663665401},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544302"},{"type":"electronic","value":"9783540383574"}],"license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54430-5_103","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:48:45Z","timestamp":1330192125000},"page":"408-423","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":40,"title":["Time-constrained automata"],"prefix":"10.1007","author":[{"given":"Michael","family":"Merritt","sequence":"first","affiliation":[]},{"given":"Francesmary","family":"Modugno","sequence":"additional","affiliation":[]},{"given":"Mark R.","family":"Tuttle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"29_CR1","unstructured":"Rajeev Alur, Costas Courcoubetis, and David Dill. Model-checking for real-time systems. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science, pages 414\u2013425. IEEE, June 1990."},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Rajeev Alur and Thomas A. Henzinger. Real-time logics: Complexity and expressiveness. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science, pages 390\u2013401. IEEE, June 1990.","DOI":"10.21236\/ADA323441"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Hagit Attiya and Nancy Lynch. Time bounds for real-time process control in the presence of timing uncertainty. Technical Memo MIT\/LCS\/TM-403, MIT Laboratory for Computer Science, July 1989.","DOI":"10.21236\/ADA213791"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Bard Bloom. Constructing two-writer atomic registers. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, pages 249\u2013259. ACM, August 1987.","DOI":"10.1145\/41840.41861"},{"issue":"4","key":"29_CR5","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/1780.1804","volume":"6","author":"K. M. Chandy","year":"1984","unstructured":"K. Mani Chandy and Jayadev Misra. The drinking philosophers problem. ACM Transactions on Programming Languages and Systems, 6(4):632\u2013646, 1984.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"David L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits. PhD thesis, Department of Computer Science, Carnegie Mellon University, February 1988. Available as Technical Report CMU-CS-88-119.","DOI":"10.7551\/mitpress\/6874.001.0001"},{"key":"29_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4886-6","volume-title":"Fairness","author":"N. Francez","year":"1986","unstructured":"Nissim Francez. Fairness. Springer-Verlag, Berlin, 1986."},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Richard Gerber and Insup Lee. CCSR: A calculus for communicating shared resources. In J. C. M. Baeten and J. W. Klop, editors, Lecture Notes in Computer Science, volume 458, Proceedings of Concur '90, pages 263\u2013277. Springer-Verlag, August 1990.","DOI":"10.1007\/BFb0039065"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Maurice Herlihy. Impossibility and universality results for wait-free synchronization. In Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, pages 276\u2013290. ACM, August 1988.","DOI":"10.1145\/62546.62593"},{"key":"29_CR10","unstructured":"Eyal Harel, Orna Lichtenstein, and Amir Pnueli. Explicit clock temporal logic. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science, pages 401\u2013413. IEEE, June 1990."},{"key":"29_CR11","volume-title":"Communicating Sequential Processes","author":"C. A. R. Hoare","year":"1985","unstructured":"C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs, New Jersey, 1985."},{"key":"29_CR12","volume-title":"Compositional Verification of Distributed Systems","author":"B. Jonsson","year":"1987","unstructured":"Bengt Jonsson. Compositional Verification of Distributed Systems. PhD thesis, Uppsala University, Uppsala, Sweden, 1987. Published by Direkt Offset, Nystr\u00f6m & Co AB, Uppsala."},{"key":"29_CR13","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/0890-5401(88)90020-X","volume":"79","author":"R. Koymans","year":"1988","unstructured":"[KSdR+88] R. Koymans, R. K. Shyamasundar, W. P. de Roever, R. Gerth, and S. Arun-Kumar. Compositional semantics for real-time distributed computing. Information and Computation, 79:210\u2013256, 1988.","journal-title":"Information and Computation"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Nancy A. Lynch and Hagit Attiya. Using mappings to prove timing properties. In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, pages 265\u2013280. ACM, August 1990.","DOI":"10.1145\/93385.93428"},{"key":"29_CR15","unstructured":"Leslie Lamport. A temporal logic of actions. Research Report 57, DEC Systems Research Center, January 1991."},{"key":"29_CR16","unstructured":"Harry R. Lewis. A logic of concrete time intervals. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science, pages 380\u2013389. IEEE, June 1990. Also available at Harvard Technical Report TR-07-90."},{"issue":"1","key":"29_CR17","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(81)90109-2","volume":"13","author":"N. A. Lynch","year":"1981","unstructured":"Nancy A. Lynch and Michael J. Fischer. On describing the behavior and implementation of distributed systems. Theoretical Computer Science, 13(1):17\u201343, January 1981.","journal-title":"Theoretical Computer Science"},{"key":"29_CR18","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0304-3975(86)90014-9","volume":"62","author":"N. A. Lynch","year":"1988","unstructured":"Nancy A. Lynch and Michael Merritt. Introduction to the theory of nested transactions. Theoretical Computer Science, 62:123\u2013185, 1988. Earlier versions appeared in Proceedings of the International Conference on Database Theory, 1986, and as MIT Technical Report MIT\/LCS\/TR-367.","journal-title":"Theoretical Computer Science"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Nancy A. Lynch, Yishay Mansour, and Alan Fekete. Data link layer: Two impossibility results. In Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, pages 149\u2013170. ACM, August 1988. Also available as MIT Technical Report MIT\/LCS\/TM-355.","DOI":"10.1145\/62546.62572"},{"key":"29_CR20","unstructured":"Nancy A. Lynch, Michael Merritt, William E. Weihl, and Alan Fekete. A theory of atomic transactions. In Proceedings of the International Conference on Database Theory, 1988. Also available as MIT Technical Memo MIT\/LCS\/TM-362."},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Nancy A. Lynch and Mark R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, pages 137\u2013151. ACM, August 1987. A full version is available as MIT Technical Report MIT\/LCS\/TR-387.","DOI":"10.1145\/41840.41852"},{"key":"29_CR22","unstructured":"Nancy A. Lynch and Mark R. Tuttle. An introduction to input\/output automata. CWI-Quarterly, 2(3), 1989. Also available as MIT Technical Memo MIT\/LCS\/TM-373."},{"key":"29_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R. Milner","year":"1980","unstructured":"Robin Milner. A Calculus of Communicating Systems. Lecture Notes in Computer Science 92. Springer-Verlag, Berlin, 1980."},{"key":"29_CR24","doi-asserted-by":"crossref","unstructured":"Faron Moller and Chris Tofts. A temporal calculus of communicating systems. In J. C. M. Baeten and J. W. Klop, editors, Lecture Notes in Computer Science, volume 458, Proceedings of Concur '90, pages 401\u2013415. Springer-Verlag, August 1990.","DOI":"10.1007\/BFb0039073"},{"key":"29_CR25","doi-asserted-by":"crossref","unstructured":"A. Udaya Shankar and Simon S. Lam. Time-dependent distributed systems: Proving safety, liveness and real-time properties. Distributed Computing, pages 61\u201379, 1987.","DOI":"10.1007\/BF01667079"},{"key":"29_CR26","unstructured":"Mark R. Tuttle. Hierarchical correctness proofs for distributed algorithms. Master's thesis, Massachusetts Institute of Technology, Laboratory for Computer Science, April 1987. Available as MIT Technical Report MIT\/LCS\/TR-387."},{"key":"29_CR27","unstructured":"Jennifer L. Welch, Leslie Lamport, and Nancy A. Lynch. A lattice-structured proof of a minimum spanning tree algorithm. In Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, pages 28\u201343. ACM, August 1988."},{"key":"29_CR28","doi-asserted-by":"crossref","unstructured":"Wang Yi. Real-time behaviour of asynchronous agents. In J. C. M. Baeten and J. W. Klop, editors, Lecture Notes in Computer Science, volume 458, Proceedings of Concur '90, pages 502\u2013520. Springer-Verlag, August 1990.","DOI":"10.1007\/BFb0039080"}],"container-title":["Lecture Notes in Computer Science","CONCUR '91"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54430-5_103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:36:16Z","timestamp":1558254976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54430-5_103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544302","9783540383574"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-54430-5_103","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]},"assertion":[{"value":"4 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}