{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:17Z","timestamp":1760202617625},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253884"},{"type":"electronic","value":"9783540319825"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31982-5_21","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T07:29:02Z","timestamp":1294990142000},"page":"333-347","source":"Crossref","is-referenced-by-count":6,"title":["Composition and Decomposition in True-Concurrency"],"prefix":"10.1007","author":[{"given":"Sibylle","family":"Fr\u00f6schle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1142\/9789814261456_0010","volume-title":"The Book of Traces","author":"W. Penczek","year":"1995","unstructured":"Penczek, W., Kuiper, R.: Traces and logic. In: The Book of Traces, pp. 307\u2013381. World Scientific, Singapore (1995)"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/BFb0055613","volume-title":"CONCUR \u201998 Concurrency Theory","author":"P. Madhusudan","year":"1998","unstructured":"Madhusudan, P., Thiagarajan, P.S.: Controllers for discrete event systems via morphisms. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 18\u201333. Springer, Heidelberg (1998)"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0890-5401(03)00064-6","volume":"184","author":"M. Jurdzi\u0144ski","year":"2003","unstructured":"Jurdzi\u0144ski, M., Nielsen, M., Srba, J.: Domino hereditary history preserving bisimilarity is undecidable. Inform. and Comput.\u00a0184, 343\u2013368 (2003)","journal-title":"Inform. and Comput."},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-54233-7_158","volume-title":"Automata, Languages and Programming","author":"W. Vogler","year":"1991","unstructured":"Vogler, W.: Deciding history preserving bisimilarity. In: Leach Albert, J., Monien, B., Rodr\u00edguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol.\u00a0510, pp. 495\u2013505. Springer, Heidelberg (1991)"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0304-3975(95)00132-8","volume":"154","author":"L. Jategaonkar","year":"1996","unstructured":"Jategaonkar, L., Meyer, A.R.: Deciding true concurrency equivalences on safe, finite nets. TCS\u00a0154, 107\u2013143 (1996)","journal-title":"TCS"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BFb0023477","volume-title":"STACS 97","author":"U. Montanari","year":"1997","unstructured":"Montanari, U., Pistore, M.: Minimal transition systems for history-preserving bisimulation. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol.\u00a01200, pp. 413\u2013425. Springer, Heidelberg (1997)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/3-540-60045-0_62","volume-title":"Computer Aided Verification","author":"J. Esparza","year":"1995","unstructured":"Esparza, J., Kiehn, A.: On the model checking problem for branching time logics and basic parallel processes. In: Wolper, P. (ed.) CAV 1995. LNCS, vol.\u00a0939, pp. 353\u2013366. Springer, Heidelberg (1995)"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/3-540-61363-3_25","volume-title":"Application and Theory of Petri Nets 1996","author":"K. Sunesen","year":"1996","unstructured":"Sunesen, K., Nielsen, M.: Behavioural equivalence for infinite systems\u2014partially decidable? In: Billington, J., Reisig, W. (eds.) ICATPN 1996. LNCS, vol.\u00a01091, pp. 460\u2013479. Springer, Heidelberg (1996)"},{"key":"21_CR9","volume-title":"LICS 2003","author":"P. Jan\u010dar","year":"2003","unstructured":"Jan\u010dar, P.: Strong bisimilarity on basic parallel processes is PSPACE-complete. In: LICS 2003. IEEE, Los Alamitos (2003)"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/3-540-45841-7_44","volume-title":"STACS 2002","author":"J. Srba","year":"2002","unstructured":"Srba, J.: Strong bisimilarity and regularity of basic parallel processes is PSPACE-hard. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 535\u2013546. Springer, Heidelberg (2002)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/978-3-540-45138-9_46","volume-title":"Mathematical Foundations of Computer Science 2003","author":"S. Lasota","year":"2003","unstructured":"Lasota, S.: A polynomial-time algorithm for deciding true concurrency equivalences of basic parallel processes. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 521\u2013530. Springer, Heidelberg (2003)"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Fr\u00f6schle, S.: Decidability of plain and hereditary history-preserving bisimulation for BPP. In: EXPRESS 1999. ENTCS, vol.\u00a027 (1999)","DOI":"10.1016\/S1571-0661(05)80297-X"},{"key":"21_CR13","unstructured":"Fr\u00f6schle, S.: Decidability and Coincidence of Equivalences for Concurrency. PhD thesis, University of Edinburgh (2004)"},{"key":"21_CR14","first-page":"1","volume-title":"Handbook of logic in computer science","author":"G. Winskel","year":"1995","unstructured":"Winskel, G., Nielsen, M.: Models for concurrency. In: Handbook of logic in computer science, vol.\u00a04, pp. 1\u2013148. Oxford Univ. Press, Oxford (1995)"},{"key":"21_CR15","unstructured":"Fr\u00f6schle, S.: The decidability border of hereditary history preserving bisimilarity. Information Processing Letters (to appear)"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1017\/S0960129500000992","volume":"6","author":"Y. Hirshfeld","year":"1996","unstructured":"Hirshfeld, Y., Jerrum, M., Moller, F.: A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes. Mathematical Structures in Computer Science\u00a06, 251\u2013259 (1996)","journal-title":"Mathematical Structures in Computer Science"},{"key":"21_CR17","unstructured":"Jan\u010dar, P., Kot, M.: Bisimilarity on normed basic parallel processes can be decided in time o(n 3). In: AVIS 2004. ENTCS (2004)"},{"key":"21_CR18","first-page":"386","volume-title":"LICS 1993","author":"S. Christensen","year":"1993","unstructured":"Christensen, S., Hirshfeld, Y., Moller, F.: Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes. In: LICS 1993, pp. 386\u2013396. IEEE, Los Alamitos (1993)"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/0304-3975(93)90176-T","volume":"107","author":"R. Milner","year":"1993","unstructured":"Milner, R., Moller, F.: Unique decomposition of processes. TCS\u00a0107, 357\u2013363 (1993)","journal-title":"TCS"},{"key":"21_CR20","unstructured":"Fr\u00f6schle, S.: Composition and decomposition in true-concurrency. Technical Report 276, Institute of Informatics, University of Warsaw (2004)"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-48340-3_32","volume-title":"Mathematical Foundations of Computer Science 1999","author":"S. Fr\u00f6schle","year":"1999","unstructured":"Fr\u00f6schle, S., Hildebrandt, T.: On plain and hereditary history-preserving bisimulation. In: Kuty\u0142owski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol.\u00a01672, pp. 354\u2013365. Springer, Heidelberg (1999)"},{"key":"21_CR22","first-page":"680","volume-title":"Handbook of formal languages","author":"J.E. Pin","year":"1997","unstructured":"Pin, J.E.: Syntactic semigroups. In: Handbook of formal languages, vol.\u00a01, pp. 680\u2013746. Springer, Heidelberg (1997)"},{"key":"21_CR23","unstructured":"Norman, C.W.: Undergraduate Algebra. Oxford Science Publications (1986)"},{"key":"21_CR24","volume-title":"Discrete Mathematics for Computer Scientists","author":"J.K. Truss","year":"1991","unstructured":"Truss, J.K.: Discrete Mathematics for Computer Scientists. Addison-Wesley, Reading (1991)"},{"key":"21_CR25","unstructured":"Christensen, S.: Decidability and Decomposition in Process Algebras. PhD thesis, University of Edinburgh (1993)"},{"key":"21_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-36206-1_26","volume-title":"FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science","author":"M. Mukund","year":"2002","unstructured":"Mukund, M.: Hereditary history preserving bisimulation is decidable for trace-labelled systems. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol.\u00a02556, pp. 289\u2013300. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31982-5_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:32:55Z","timestamp":1605760375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31982-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253884","9783540319825"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31982-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}