{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:25:16Z","timestamp":1761596716918},"reference-count":33,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6925,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0304-3975(94)90094-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"181-195","source":"Crossref","is-referenced-by-count":9,"title":["GSOS and finite labelled transition systems"],"prefix":"10.1016","volume":"131","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90094-9_bib1","series-title":"Abstract Interpretation of Declarative Languages","author":"Abramsky","year":"1987"},{"key":"10.1016\/0304-3975(94)90094-9_bib2","series-title":"Report CS-R9218","article-title":"Turning SOS rules into equations","author":"Aceto","year":"1992"},{"issue":"1","key":"10.1016\/0304-3975(94)90094-9_bib3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0304-3975(84)90067-7","article-title":"Alg\u00e8bre de processus et synchronisations","volume":"30","author":"Austry","year":"1984","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/0304-3975(94)90094-9_bib4","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0304-3975(91)90231-P","article-title":"On guarded recursion","volume":"82","author":"Badouel","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90094-9_bib5","series-title":"Publication interne 629","article-title":"Structural operational specifications and trace automata","author":"Badouel","year":"1992"},{"issue":"2","key":"10.1016\/0304-3975(94)90094-9_bib6","first-page":"127","article-title":"Syntax and defining equations for an interupt mechanism in process algebra","volume":"IX","author":"Baeten","year":"1986","journal-title":"Fund. Inform."},{"key":"10.1016\/0304-3975(94)90094-9_bib7","article-title":"Process Algebra","volume":"Vol. 18","author":"Baeten","year":"1990"},{"key":"10.1016\/0304-3975(94)90094-9_bib8","series-title":"Ph.D. Thesis","article-title":"Ready simulation, bisimulation, and the semantics of CCS-like languages","author":"Bloom","year":"1989"},{"key":"10.1016\/0304-3975(94)90094-9_bib9","series-title":"Conference Record of 15th Ann. Acm Symp. on Principles of Programming Laguages","first-page":"229","article-title":"Bisimulation can't be traced: preliminary report","author":"Bloom","year":"1988"},{"key":"10.1016\/0304-3975(94)90094-9_bib10","series-title":"Proc. 18th ICALP","first-page":"481","article-title":"The meaning of negative premises in transition system specifications (extended abstract)","volume":"Vol. 510","author":"Bol","year":"1991"},{"key":"10.1016\/0304-3975(94)90094-9_bib11","series-title":"Report ECS-LFCS-89-83","article-title":"The concurrency workbench: a semantics-based verification tool for finite-state systems","author":"Cleaveland","year":"1989"},{"key":"10.1016\/0304-3975(94)90094-9_bib12","series-title":"Semantics of Systems of Concurrent Processes, Proceedings LITP Spring School on Theoretical Computer Science","first-page":"223","article-title":"Concurrency and computability","volume":"Vol. 469","author":"Darondeau","year":"1990"},{"key":"10.1016\/0304-3975(94)90094-9_bib13","article-title":"Proving finiteness of CCS processes by non-standard semantics","author":"De Francesco","year":"1992","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(94)90094-9_bib14","series-title":"Technical report SPECTRE c14","article-title":"Ald\u00e9baran: a tool for verification of communicating processes","author":"Fernandez","year":"1989"},{"key":"10.1016\/0304-3975(94)90094-9_bib15","author":"Godskesen","year":"1988","journal-title":"TAV (Tools for Automatic Verification): users manual"},{"issue":"2","key":"10.1016\/0304-3975(94)90094-9_bib16","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","article-title":"Structured operational semantics and bisimulation as a congruence","volume":"100","author":"Groote","year":"1992","journal-title":"Inform. and Comput."},{"issue":"1","key":"10.1016\/0304-3975(94)90094-9_bib17","first-page":"58","article-title":"A term model for synchronous processes","volume":"51","author":"Hennessy","year":"1981","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(94)90094-9_bib18","series-title":"Algebraic Theory of Processes","author":"Hennessy","year":"1988"},{"issue":"1","key":"10.1016\/0304-3975(94)90094-9_bib19","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","article-title":"Algebraic laws for nondeterminism and concurrency","volume":"32","author":"Hennessy","year":"1985","journal-title":"J. Acm"},{"key":"10.1016\/0304-3975(94)90094-9_bib20","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"issue":"7","key":"10.1016\/0304-3975(94)90094-9_bib21","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/360248.360251","article-title":"Formal verification of parallel programs","volume":"19","author":"Keller","year":"1976","journal-title":"Comm. Acm"},{"key":"10.1016\/0304-3975(94)90094-9_bib22","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/dimacs\/003\/19","article-title":"Finiteness conditions and structural construction of automata for all process algebras","volume":"3","author":"Madelaine","year":"1991","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"10.1016\/0304-3975(94)90094-9_bib23","series-title":"Technical Report CSR-75-80","article-title":"On relating synchrony and asynchrony","author":"Milner","year":"1981"},{"key":"10.1016\/0304-3975(94)90094-9_bib24","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","article-title":"Calculi for synchrony and asynchrony","volume":"25","author":"Milner","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90094-9_bib25","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"issue":"1","key":"10.1016\/0304-3975(94)90094-9_bib26","first-page":"1","article-title":"A calculus of mobile processes","volume":"100","author":"Milner","year":"1992","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(94)90094-9_bib27","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0167-739X(90)90024-8","article-title":"The expressive power of parallelism","volume":"6","author":"Parrow","year":"1990","journal-title":"Future Generations Computer Systems"},{"key":"10.1016\/0304-3975(94)90094-9_bib28","series-title":"Report DAIMI FN-19","article-title":"A structural approach to operational semantics","author":"Plotkin","year":"1981"},{"key":"10.1016\/0304-3975(94)90094-9_bib29","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","article-title":"Higher-level synchronising devices in MEIJE-SCCS","volume":"37","author":"de Simone","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90094-9_bib30","series-title":"Technical Report 111","article-title":"Aborad AUTO","author":"de Simone","year":"1989"},{"key":"10.1016\/0304-3975(94)90094-9_bib31","series-title":"Proc. 6th Ann. Symp. on Logic in Computer Science","first-page":"387","article-title":"On the relationship between process algebra and input\/output automata (extended abstract)","author":"Vaandrager","year":"1991"},{"key":"10.1016\/0304-3975(94)90094-9_bib32","article-title":"Expressiveness results for process algebras","author":"Vaandrager","year":"1992","journal-title":"Proc. REX '92"},{"key":"10.1016\/0304-3975(94)90094-9_bib33","series-title":"Technical Report ECS-LFCS-88-45","article-title":"Analysing natural exclusion algorithms using CCS","author":"Walker","year":"1988"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900949?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900949?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:28:14Z","timestamp":1555129694000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594900949"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0304397594900949"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90094-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}