{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:48Z","timestamp":1725663648266},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540551799"},{"type":"electronic","value":"9783540467632"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55179-4_16","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T04:50:51Z","timestamp":1330231851000},"page":"158-168","source":"Crossref","is-referenced-by-count":5,"title":["A proof assistant for PSF"],"prefix":"10.1007","author":[{"given":"S.","family":"Mauw","sequence":"first","affiliation":[]},{"given":"G. J.","family":"Veltink","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"16_CR1","unstructured":"G.J. Akkerman & J.C.M. Baeten, Term rewriting analysis in process algebra, Report P9006, Programming Research Group, University of Amsterdam, 1990."},{"key":"16_CR2","unstructured":"J.C.M. Baeten (ed.), Applications of Process Algebra, Cambridge Tracts in Theoretical Computer Science 17, Cambridge University Press, 1990."},{"key":"16_CR3","unstructured":"J.C.M. Baeten, J.A. Bergstra & J.W. Klop, Conditional axioms and a\/b-calculus in process algebra, in: Proceedings IFIP Conference on Formal Description of Programming Concepts III, Ebberup, (M. Wirsing, ed.) pp. 77\u2013103, North-Holland, 1987."},{"key":"16_CR4","unstructured":"J.A. Bergstra, J. Heering & P. Klint, The algebraic specification formalism ASF, in: Algebraic specification, J.A. Bergstra, J. Heering & P. Klint (eds.), pp. 1\u201366, ACM Press Frontier Series, Addison-Wesley 1989."},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten & W.P. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"J.C. Fernandez, Ald\u00e9baran, A tool set for deciding bisimulation equivalences, in: Proceedings CONCUR '91, Amsterdam, (J.C.M. Beaten & J.A. Bergstra, eds.), 1991. (to appear in LNCS series).","DOI":"10.1007\/3-540-54430-5_78"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"J.F. Groote & F.W. Vaandrager, An efficient algorithm for branching bisimulation and stuttering equivalence, in: Proceedings 17th ICALP, Warwick, (M.S. Paterson, ed.) LNCS 443, pp. 626\u2013638, Springer Verlag, 1990.","DOI":"10.1007\/BFb0032063"},{"issue":"nr.1","key":"16_CR8","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy & R. Milner, Algebraic Laws for Nondeterminism and Concurrency, Journal of the Association for Computing Machinery, vol. 32, nr. 1, pp. 137\u2013161, 1985.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"16_CR9","unstructured":"B.W. Kernighan & D.M. Ritchie, The C programming language, Prentice-Hall, 1978."},{"key":"16_CR10","unstructured":"H. Lin, PAM: A Process Algebra Manipulator, this volume."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"S. Mauw & G.J. Veltink, An introduction to PSF d , in: Proc. International Joint Conference on Theory and Practice of Software Development, TAPSOFT '89, (J. D\u00edaz, F. Orejas, eds.) LNCS 352, pp. 272\u2013285, Springer Verlag, 1989.","DOI":"10.1007\/3-540-50940-2_41"},{"key":"16_CR12","unstructured":"S. Mauw & G.J. Veltink, A Tool Interface Language for PSF, Report P8912, Programming Research Group, University of Amsterdam, 1989."},{"key":"16_CR13","unstructured":"S. Mauw & G.J. Veltink, A process specification formalism, Fundamenta Informaticae XIII (1990), pp. 85\u2013139, IOS Press, 1990."},{"key":"16_CR14","unstructured":"B.C. Thompson & J.V. Tucker, Equational specification of Synchronous Concurrent Algorithms & Architectures, University College of Swansea, Technical Report, 1991. (in preparation)"},{"key":"16_CR15","unstructured":"G.J. Veltink, From PSF to TIL, Report P9009, Programming Research Group, University of Amsterdam, 1990."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55179-4_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:57:54Z","timestamp":1605628674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55179-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540551799","9783540467632"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-55179-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}