{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T07:08:02Z","timestamp":1750489682463},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540283096"},{"type":"electronic","value":"9783540319344"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11539452_21","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:54:50Z","timestamp":1127829290000},"page":"248-262","source":"Crossref","is-referenced-by-count":8,"title":["A Ground-Complete Axiomatization of Finite State Processes in Process Algebra"],"prefix":"10.1007","author":[{"given":"Jos C. M.","family":"Baeten","sequence":"first","affiliation":[]},{"given":"Mario","family":"Bravetti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"21_CR1","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1017\/S0960129503004006","volume":"13","author":"J.C.M. Baeten","year":"2003","unstructured":"Baeten, J.C.M.: Embedding untimed into timed process algebra: The case for explicit termination. Mathematical Structures in Computer Science\u00a013(4), 589\u2013618 (2003)","journal-title":"Mathematical Structures in Computer Science"},{"key":"21_CR2","volume-title":"Algebra of Communicating Processes. Cambridge Tracts in Theoretical Computer Science","author":"J.C.M. Baeten","year":"2005","unstructured":"Baeten, J.C.M., Basten, T., Reniers, M.A.: Algebra of Communicating Processes. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2005)"},{"issue":"2","key":"21_CR3","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/S0304-3975(96)00253-8","volume":"177","author":"J.C.M. Baeten","year":"1997","unstructured":"Baeten, J.C.M., Bergstra, J.A.: Process algebra with propositional signals. Theoretical Computer Science\u00a0177(2), 381\u2013406 (1997)","journal-title":"Theoretical Computer Science"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Baeten, J.C.M., Bergstra, J.A., Hoare, C.A.R., Milner, R., Parrow, J., de Simone, R.: The variety of process algebra. Deliverable ESPRIT Basic Research Action 3006, CONCUR (1991)","DOI":"10.1007\/3-540-54430-5_83"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Baeten, J.C.M., Bravetti, M.: A ground-complete axiomatization of finite state processes in process algebra. Technical Report CS Report 05-18, Technische Universiteit Eindhoven, Department of Mathematics and Computer Science (2005)","DOI":"10.1007\/11539452_21"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/3-540-16444-8_1","volume-title":"Mathematical Methods of Specification and Synthesis of Software Systems \u201985","author":"J.A. Bergstra","year":"1986","unstructured":"Bergstra, J.A., Klop, J.W.: Verification of an alternating bit protocol by means of process algebra. In: Bibel, W., Jantke, K.P. (eds.) Mathematical Methods of Specification and Synthesis of Software Systems 1985. LNCS, vol.\u00a0215, pp. 9\u201323. Springer, Heidelberg (1986)"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J.A. Bergstra","year":"1985","unstructured":"Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. Theoretical Computer Science\u00a037(1), 77\u2013121 (1985)","journal-title":"Theoretical Computer Science"},{"key":"21_CR8","first-page":"21","volume-title":"Proc. Logic Colloquium 1986","author":"J.A. Bergstra","year":"1988","unstructured":"Bergstra, J.A., Klop, J.W.: A complete inference system for regular processes with silent moves. In: Drake, F.R., Truss, J.K. (eds.) Proc. Logic Colloquium 1986, pp. 21\u201381. North-Holland, Amsterdam (1988)"},{"issue":"4","key":"21_CR9","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/566385.566386","volume":"3","author":"M. Bravetti","year":"2002","unstructured":"Bravetti, M., Gorrieri, R.: Deciding and axiomatizing weak st bisimulation for a process algebra with recursion and action refinement. ACM Transactions on Computational Logic\u00a03(4), 465\u2013520 (2002)","journal-title":"ACM Transactions on Computational Logic"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BFb0036899","volume-title":"Automata, Languages and Programming","author":"S.D. Brookes","year":"1983","unstructured":"Brookes, S.D.: On the relationship of CCS and CSP. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol.\u00a0154, pp. 83\u201396. Springer, Heidelberg (1983)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/BFb0039617","volume-title":"STACS 87","author":"R.J. van Glabbeek","year":"1987","unstructured":"van Glabbeek, R.J.: Bounded nondeterminism and the approximation induction principle in process algebra. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds.) STACS 1987. LNCS, vol.\u00a0247, pp. 336\u2013347. Springer, Heidelberg (1987)"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/3-540-57182-5_39","volume-title":"Mathematical Foundations of Computer Science 1993","author":"R.J. van Glabbeek","year":"1993","unstructured":"van Glabbeek, R.J.: A complete axiomatization for branching bisimulation congruence of finite-state behaviours. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 473\u2013484. Springer, Heidelberg (1993)"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.J.: On the expressiveness of ACP (extended abstract). In: Ponse, A., Verhoef, C., van Vlijmen, S.F.M. (eds.) Proceedings First Workshop on the Algebra of Communicating Processes, ACP 1994, Utrecht, The Netherlands, May 1994, Workshops in Computing, pp. 188\u2013217 (1994), available at http:\/\/boole.stanford.edu\/pub\/acp.ps.gz","DOI":"10.1007\/978-1-4471-2120-6_8"},{"issue":"6","key":"21_CR14","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0304-3975(96)00251-4","volume":"177","author":"R.J. van Glabbeek","year":"1997","unstructured":"van Glabbeek, R.J.: Notes on the methodology of CCS and CSP. Theoretical Computer Science\u00a0177(6), 329\u2013349 (1997)","journal-title":"Theoretical Computer Science"},{"key":"21_CR15","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, Englewood Cliffs (1985)"},{"issue":"3","key":"21_CR16","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","volume":"28","author":"R. Milner","year":"1984","unstructured":"Milner, R.: A complete inference system for a class of regular behaviours. Journal of Comput. System Sci.\u00a028(3), 439\u2013466 (1984)","journal-title":"Journal of Comput. System Sci."},{"key":"21_CR17","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"key":"21_CR18","unstructured":"Vaandrager, F.W.: Verification of two communication protocols by means of process algebra. Technical Report report CS-R8608, CWI Amsterdam (1986)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2005 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11539452_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T22:42:57Z","timestamp":1586472177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11539452_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283096","9783540319344"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11539452_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}