{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T22:35:45Z","timestamp":1784241345984,"version":"3.55.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,4,29]],"date-time":"2017-04-29T00:00:00Z","timestamp":1493424000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s00236-017-0300-y","type":"journal-article","created":{"date-parts":[[2017,4,29]],"date-time":"2017-04-29T01:25:30Z","timestamp":1493429130000},"page":"339-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Factorisation of transition systems"],"prefix":"10.1007","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4339-2708","authenticated-orcid":false,"given":"Raymond","family":"Devillers","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,4,29]]},"reference":[{"key":"300_CR1","unstructured":"Arnold, A.: Finite Transition Systems\u2014Semantics of Communicating Systems. Prentice Hall international series in computer science, Prentice Hall, UK (1994)"},{"key":"300_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-47967-4","volume-title":"Petri Net Synthesis","author":"E Badouel","year":"2015","unstructured":"Badouel, E., Bernardinello, L., Darondeau, P.: Petri Net Synthesis. Springer, Berlin (2015)"},{"key":"300_CR3","unstructured":"Bednarczyk, M. A.: Categories of asynchronous systems. PhD thesis, University of Sussex, UK (1987)"},{"key":"300_CR4","unstructured":"Best, E., Devillers, R.: Synthesis of bounded choice-free Petri nets. In: Aceto, L., Frutos Escrig D. (eds.) Proceedings of 26th International Conference on Concurrency Theory (CONCUR 2015), pp. 128\u2013141 (2015)"},{"key":"300_CR5","doi-asserted-by":"crossref","unstructured":"Best, E., Devillers, R., Koutny, M.: Petri net algebra. Monographs in Theoretical Computer Science. Springer, Berlin (2001)","DOI":"10.1007\/978-3-662-04457-5"},{"key":"300_CR6","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: The 1960 Congress on Logic. Methdology and Philosophy of Science, pp. 1\u201311. Univeristy Press, Stanford (1962)"},{"key":"300_CR7","doi-asserted-by":"crossref","unstructured":"Devillers, R.: Products of transition systems and additions of Petri nets. In: Desel, J., Yakovlev, A. (eds.) Proceedings 16th International Conference on Application of Concurrency to System Design (ACSD 2016), pp. 65\u201373 (2016)","DOI":"10.1109\/ACSD.2016.10"},{"key":"300_CR8","doi-asserted-by":"crossref","unstructured":"Hildebrandt, T.T., Sassone, V.: Comparing transition systems with independence and asynchronous transition systems. In: Proceedings of CONCUR \u201996, Concurrency Theory, 7th International Conference, Pisa, Italy, pp. 84\u201397 (1996)","DOI":"10.1007\/3-540-61604-7_49"},{"key":"300_CR9","doi-asserted-by":"crossref","unstructured":"Keller, R.M.: A fundamental theorem of asynchronous parallel computation. In: Sagamore Computer Conference, August 20\u201323, 1974, LNCS Vol. 24, pp. 102\u2013112 (1975)","DOI":"10.1007\/3-540-07135-0_113"},{"issue":"1","key":"300_CR10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/3468.553226","volume":"27","author":"E Teruel","year":"1997","unstructured":"Teruel, E., Colom, J.M., Silva, M.: Choice-free Petri nets: a model for deterministic concurrent systems with bulk services and arrivals. IEEE Transactions on Systems, Man, and Cybernetics, Part A 27(1), 73\u201383 (1997)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part A"},{"key":"300_CR11","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: Abramsky, S., Gabbay Dov, M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 4, pp. 1\u2013148. Oxford University Press, Oxford (1995)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-017-0300-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-017-0300-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-017-0300-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,23]],"date-time":"2018-05-23T02:19:26Z","timestamp":1527041966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-017-0300-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,29]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["300"],"URL":"https:\/\/doi.org\/10.1007\/s00236-017-0300-y","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,29]]}}}