{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:23Z","timestamp":1725664523919},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616047"},{"type":"electronic","value":"9783540706250"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61604-7_79","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:04:00Z","timestamp":1330293840000},"page":"611-626","source":"Crossref","is-referenced-by-count":2,"title":["Towards automata for branching time and partial order"],"prefix":"10.1007","author":[{"given":"Michaela","family":"Huhn","sequence":"first","affiliation":[]},{"given":"Peter","family":"Niebert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"36_CR1","first-page":"142","volume":"818","author":"O. Bernholtz","year":"1994","unstructured":"Orna Bernholtz, Moshe Y. Vardi, and Pierre Wolper. An automata-theoretic approach to branching-time model checking. In CAV 94, LNCS 818, pp 142\u2013153, 1994.","journal-title":"LNCS"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"J\u00f6rg Desel and Javier Esparza. Free choice Petri nets. Cambridge tracts in theoretical computer science 40, Cambridge University Press, 1995","DOI":"10.1017\/CBO9780511526558"},{"key":"36_CR3","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability. Freeman, NY 1979."},{"key":"36_CR4","first-page":"21","volume":"84","author":"H.J. Genrich","year":"1979","unstructured":"H.J. Genrich and K. Lautenbach and P.S. Thiagarajan. Elements of general net theory. In Net Theory and Applications, LNCS 84, pages 21\u2013159, 1979.","journal-title":"LNCS"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"R. Gerth, R. Kuiper, D. Peled, and W. Penczek. A partial order approach to branching time logic model checking. In Israeli Symp. on Theoretical Comp. Sci., 1995.","DOI":"10.1109\/ISTCS.1995.377038"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Michaela Huhn and Peter Niebert. Towards automata for branching time and partial order. Report HIB 16\/96. Institute for Informatics, Univ. Hildesheim. 1996.","DOI":"10.1007\/3-540-61604-7_79"},{"key":"36_CR7","first-page":"307","volume-title":"The Book of Traces","author":"R. Kuiper","year":"1995","unstructured":"Ruurd Kuiper and Wojciech Penczek. Traces and Logic. In V. Diekert and G. Rozenberg (eds.): The Book of Traces, World Scientific, Singapore, 1995, 307\u2013390"},{"key":"36_CR8","first-page":"285","volume":"354","author":"A. Mazurkiewicz","year":"1988","unstructured":"Antoni Mazurkiewicz. Basic notions of trace theory. LNCS 354, pp 285\u2013363, 1988","journal-title":"LNCS"},{"key":"36_CR9","volume-title":"Internal Report TCS-90-2","author":"M. Mukund","year":"1990","unstructured":"Madhavan Mukund and P. S. Thiagarajan. An axiomatisation of well branching prime event structures. Internal Report TCS-90-2, Inst. of Mathematical Sciences, SPIC Science Foundation, Madras 600 113, India, September 1990."},{"key":"36_CR10","unstructured":"Peter Niebert and Wojciech Penczek. On the connection of partial order logics and partial order reduction methods. Report 95-15, TU Eindhoven, CS Dept, 1995."},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"M. Nielsen and G. Winskel. Models for concurrency. in S. Abramsky, D.M Gabbay, T.S.E. Maibaum (eds.): Handbook of Logic in Computer Science, Volume 4 Semantic Modelling, pages 1\u2013148, Oxford University Press 1995.","DOI":"10.1093\/oso\/9780198537809.003.0001"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Doron Peled. All from one, one for all: on model checking using representatives. In Computer Aided Verification, LNCS 697, 1993.","DOI":"10.1007\/3-540-56922-7_34"},{"key":"36_CR13","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(92)90007-I","volume":"43","author":"W. Penczek","year":"1992","unstructured":"Wojciech Penczek. On undecidability of propositional temporal logics on trace systems. Information Processing Letters 43, 147\u2013153, 1992","journal-title":"Information Processing Letters"},{"key":"36_CR14","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0304-3975(91)90087-I","volume":"91","author":"B. Rozoy","year":"1991","unstructured":"B. Rozoy and P.S. Thiagarajan. Event structures and trace monoids, Theoretical Computer Science 91, 285\u2013313, 1991.","journal-title":"Theoretical Computer Science"},{"key":"36_CR15","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(89)90050-9","volume":"64","author":"E.W. Stark","year":"1989","unstructured":"E.W. Stark. Concurrent transition systems. In Theoretical Computer Science 64: 221\u2013269,1989.","journal-title":"Theoretical Computer Science"},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"P.S. Thiagarajan. A trace based extension of Linear Time Temporal Logic. In Proc. of the 9th annual IEEE Symposium on Logic in Computer Science (LICS), 1994.","DOI":"10.1109\/LICS.1994.316047"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"P.S. Thiagarajan. A trace consistent subset of PTL. In CONCUR '95, LNCS 962, 1995.","DOI":"10.1007\/3-540-60218-6_33"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"Wolfgang Thomas. Automata on infinite objects. In J. v. Leeuwen (ed.), Handbook of Theoretical Computer Science, vol. B, ch. 4, pages 133\u2013191. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"36_CR19","unstructured":"Moshe Y. Vardi and Pierre Wolper. An automata-theoretic approach to automatic program verification. In 1st IEEE Symp. Logic in Comp. Sci. (LICS), p. 332\u2013344, 1986."},{"key":"36_CR20","doi-asserted-by":"crossref","unstructured":"Glynn Winskel. Event structures. In Advances in Petri Nets, LNCS 255, 1987.","DOI":"10.1007\/3-540-17906-2_31"},{"key":"36_CR21","first-page":"278","volume":"363","author":"W. Zielonka","year":"1989","unstructured":"Wieslaw Zielonka. Safe executions of recognisable trace languages by asynchronous automata. In Logic at Botik, LNCS 363, pages 278\u2013289, 1989.","journal-title":"LNCS"}],"container-title":["Lecture Notes in Computer Science","CONCUR '96: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61604-7_79.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T17:37:02Z","timestamp":1713634622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61604-7_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616047","9783540706250"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-61604-7_79","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}