{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:45:23Z","timestamp":1725493523555},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_5","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"61-63","source":"Crossref","is-referenced-by-count":0,"title":["Modelling with Partial Orders \u2014 Why and Why Not?"],"prefix":"10.1007","author":[{"given":"Mogens","family":"Nielsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"5_CR1","unstructured":"ACM Strategic Directions in Computing Research, Concurrency Group Report, http:\/\/www.acm.org\/surveys\/sdcr , 1997."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0020-0190(99)00005-8","volume":"69","author":"R. Alur","year":"1999","unstructured":"R. Alur, D. Peled. Undecidability of Partial Order Logics. Information Processing Letters 69, 137\u2013143, 1999.","journal-title":"Information Processing Letters"},{"key":"5_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-48320-9_10","volume-title":"Proceedings of CONCUR\u201999","author":"R. Alur","year":"1999","unstructured":"R. Alur, M. Yannakakis. Model checking of message sequence charts. In Proceedings of CONCUR\u201999, Lecture Notes in Computer Science 1664, Springer-Verlag, 114\u2013129, 1999."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"I. Cervesato, N. A. Durgin, P. D. Lincoln, J. C. Mitchell, and A. Scedrov. A meta-notation for protocol analysis. In proceedings of 12-th IEEE Computer Security Foundations Workshop, 55\u201369, 1999.","DOI":"10.1109\/CSFW.1999.779762"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"F. J. T. Fabrega, J. C. Herzog, J. D. Guttman. Strand Spaces: Why is a security protocol correct? In Proceedings of 1998 IEEE Symposium on Security and Privacy, 160\u2013171, 1998.","DOI":"10.21236\/ADA459060"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"F. Crazzolara, G. Winskel. Events in security protocols. BRICS Report Series RS-01-13, University of Aarhus, Denmark, 2001.","DOI":"10.7146\/brics.v8i13.20470"},{"key":"5_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/3-540-45022-X_57","volume-title":"Proceedings of ICALP\u201900","author":"J. G. Henriksen","year":"2000","unstructured":"J. G. Henriksen, M. Mukund, K. Narayan Kumar, and P. S. Thiagarajan. On Message Sequence Graphs and finitely generated regular MSC languages. In Proceedings of ICALP\u201900, Lecture Notes in Computer Science 1853, Springer-Verlag, 675\u2013686, 2000."},{"key":"5_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/3-540-46541-3_30","volume-title":"Proceedings of STACS\u201900","author":"M. Jurdcinski","year":"2000","unstructured":"M. Jurdcinski, M. Nielsen. Hereditary history preserving bisimulation is undecidable. In Proceedings of STACS\u201900, Lecture Notes in Computer Science 1770, Springer-Verlag, 358\u2013369, 2000."},{"key":"5_CR9","unstructured":"T. Meincke, A. Hemani, S. Kumar, P. Ellervee, J. Berg, D. Lindqvist, H. Tenhunen, A. Postula. Evaluating benefits of globally asynchronous locally synchronous VLSI architecture. In Proc. 16th Norchip, 50\u201357, 1998."},{"key":"5_CR10","unstructured":"ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITU-TS, Geneva, 1997."},{"key":"5_CR11","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of International Conference on Application and Theory of Petri Nets 2001","author":"M. Nielsen","year":"2001","unstructured":"M. Nielsen, V. Sassone, J. Srba. Towards a notion of distributed time in Petri nets. To appear in Proceedings of International Conference on Application and Theory of Petri Nets 2001, Lecture Notes in Computer Science, Springer-Verlag, 2001."},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V. R. Pratt","year":"1986","unstructured":"V. R. Pratt. Modelling concurrency with partial orders. International Journal of Parallel programming, 15(1), 33\u201371, 1986","journal-title":"International Journal of Parallel programming"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"G. Winskel, M. Nielsen Models for Concurrency In Handbook of Logic in Computer Science, vol 4, eds. S. Abramsky, D. M. Gabbay, T. S. E. Maibaum, Oxford University Press, 1\u2013148, 1995.","DOI":"10.1093\/oso\/9780198537809.003.0001"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T18:55:06Z","timestamp":1708282506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}