{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:58Z","timestamp":1761611158207,"version":"build-2065373602"},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5323,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1999]]},"DOI":"10.1016\/s1571-0661(05)80298-1","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"107-126","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement (Extended Abstract)"],"prefix":"10.1016","volume":"27","author":[{"given":"Mario","family":"Bravetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Gorrieri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S1571-0661(05)80298-1_bib1","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1137\/S0097539793243600","article-title":"\u201cOn \u201cAxiomatising Finite Concurrent Processes\u201d\u201d","volume":"23","author":"Aceto","year":"1994","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S1571-0661(05)80298-1_bib2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF01221099","article-title":"\u201cA Static View of Localities\u201d","volume":"6","author":"Aceto","year":"1994","journal-title":"Formal Aspects of Computing"},{"key":"10.1016\/S1571-0661(05)80298-1_bib3","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1006\/inco.1994.1096","article-title":"\u201cAdding Action Refinement to a Finite Process Algebra\u201d","volume":"115","author":"Aceto","year":"1994","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80298-1_bib4","doi-asserted-by":"crossref","unstructured":"M. Bravetti, M. Bernardo, R. Gorrieri, \u201cTowards Performance Evaluation with General Distributions in Process Algebras\u201d, in Proc. of the 9th Int. Conf. on Concurrency Theory (CONCUR '98), LNCS 1466:405-422, Nice (France), 1998","DOI":"10.1007\/BFb0055638"},{"issue":"2","key":"10.1016\/S1571-0661(05)80298-1_bib5","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01221098","article-title":"\u201cA theory of processes with localities\u201d","volume":"6","author":"Boudol","year":"1994","journal-title":"Formal Aspects of Computing"},{"key":"10.1016\/S1571-0661(05)80298-1_bib6","doi-asserted-by":"crossref","unstructured":"M. Bravetti, R. Gorrieri, \u201cDeciding and Asiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement\u201d, Technical Report UBLCS-99-1, University of Bologna (Italy), 1999","DOI":"10.1016\/S1571-0661(05)80298-1"},{"key":"10.1016\/S1571-0661(05)80298-1_bib7","unstructured":"M. Bravetti, R. Gorrieri, \u201cInteractive Generalized Semi-Markov Processes\u201d, to appear in Proc. of the 7th Int. Workshop on Process Algebras and Performance Modeling (PAPM '99), Zaragoza (Spain), September 1999"},{"key":"10.1016\/S1571-0661(05)80298-1_bib8","unstructured":"N. Busi, R.J. van Glabbeek, R. Gorrieri, \u201cAxiomatising ST-Bisimulation Equivalence\u201d, in Proc. of the IFIP Working Conf. on Programming Concepts, Methods and Calculi (PROCOMET '94), pp. 169-188, S. Miniato (Italy), 1994"},{"key":"10.1016\/S1571-0661(05)80298-1_bib9","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1142\/S0129054195000196","article-title":"\u201cObserving Distribution In Processes: Static and Dynamic Localities\u201d","volume":"6","author":"Castellani","year":"1995","journal-title":"Int. Journal of Foundations of Computer Science"},{"key":"10.1016\/S1571-0661(05)80298-1_bib10","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/BFb0035764","article-title":"\u201cCausal Trees\u201d","volume":"372","author":"Darondeau","year":"1989","journal-title":"Automata, Languages and Programming, LNCS"},{"key":"10.1016\/S1571-0661(05)80298-1_bib11","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1006\/inco.1995.1142","article-title":"\u201cA causal operational semantics of action refinement\u201d","volume":"122","author":"Degano","year":"1995","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80298-1_bib12","unstructured":"R.J. van Glabbeek, \u201cThe refinement theorem for ST-bisimulation semantics\u201d, in Proc. of the IFIP Working Conf. on Programming Concepts, Methods and Calculi (PROCOMET '90), pp. 27-52, Sea of Gallilea (Israel), 1990"},{"key":"10.1016\/S1571-0661(05)80298-1_bib13","doi-asserted-by":"crossref","unstructured":"R.J. van Glabbeek, U. Goltz, \u201cEquivalence Notions f o r Concurrent Systems and Refinement of Actions\u201d, Arbeitspapiere der GMD 366, Gesellschaft fur Mathematik und Datenverarbeitung MBH, 1989","DOI":"10.1007\/3-540-51486-4_71"},{"key":"10.1016\/S1571-0661(05)80298-1_bib14","series-title":"Handbook of Process Algebra","article-title":"\u201cAction Refinement\u201d","author":"Gorrieri","year":"2000"},{"key":"10.1016\/S1571-0661(05)80298-1_bib15","doi-asserted-by":"crossref","unstructured":"R.J. van Glabbeek, F.W. Vaandrager, \u201cPetri Net Models for Algebraic Theories of Concurrency\u201d, in Proc. of the Conf. on Parallel Architectures and Languages Europe (PARLE '87), LNCS 259:224-242, Eindhoven (The Netherlands), 1987","DOI":"10.1007\/3-540-17945-3_13"},{"key":"10.1016\/S1571-0661(05)80298-1_bib16","first-page":"170","article-title":"\u201cThe limit of split, bisimulations for CCS agents\u201d, in Proc. of the Symp. on Mathematical Foundations of Computer Science (MFCS '91)","volume":"520","author":"Gorrieri","year":"1991","journal-title":"LNCS"},{"key":"10.1016\/S1571-0661(05)80298-1_bib17","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1006\/inco.1995.1066","article-title":"\u201cSplit and ST Bisimulation Semantics\u201d","volume":"118","author":"Gorrieri","year":"1995","journal-title":"Information and Computation"},{"issue":"1","key":"10.1016\/S1571-0661(05)80298-1_bib18","doi-asserted-by":"crossref","first-page":"18","DOI":"10.3233\/FI-1997-30102","article-title":"\u201cOn the decidability of non-interleaving process equivalences\u201d","volume":"30","author":"Kiehn","year":"1997","journal-title":"Fundamenta Informaticae"},{"year":"1989","series-title":"\u201cCommunication and Concurrency\u201d","author":"Milner","key":"10.1016\/S1571-0661(05)80298-1_bib19"},{"key":"10.1016\/S1571-0661(05)80298-1_bib20","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0890-5401(89)90070-9","article-title":"\u201cA complete axiomatization for observational congruence of finite-state behaviours\u201d","volume":"81","author":"Milner","year":"1989","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80298-1_bib21","doi-asserted-by":"crossref","unstructured":"U. Montanari, M. Pistore, \u201cMinimal Transition Systems for History-Preserving Bisimulation\u201d, in Proc. of the 14th Symp. on Theoretical Aspects of Computer Science (STACS'97), LNCS 1200, 1997","DOI":"10.1007\/BFb0023477"},{"issue":"2","key":"10.1016\/S1571-0661(05)80298-1_bib22","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0304-3975(94)00219-9","article-title":"\u201cLocation Equivalence in Parametric Setting\u201d","volume":"149","author":"Montanari","year":"1995","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80298-1_bib23","unstructured":"G. Plotkin, \u201cA Structural Approach to Operational Semantics\u201d, Technical Report DAIMI FN-19, Aarhus University, Department of Computer Science, Aarhus, 1981."},{"key":"10.1016\/S1571-0661(05)80298-1_bib24","doi-asserted-by":"crossref","first-page":"357","DOI":"10.3233\/FI-1988-11404","article-title":"\u201cBehaviour Structures and Nets\u201d","volume":"11","author":"Rabinovich","year":"1988","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/S1571-0661(05)80298-1_bib25","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0304-3975(93)90157-O","article-title":"\u201cBisimulation and action refinement\u201d","volume":"114","author":"Vogler","year":"1993","journal-title":"Theoretical Computer Science"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802981?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802981?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:34Z","timestamp":1761610054000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105802981"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":25,"alternative-id":["S1571066105802981"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80298-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement (Extended Abstract)","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80298-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}