{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:22:46Z","timestamp":1778296966966,"version":"3.51.4"},"reference-count":31,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":6407,"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":[[1996,1]]},"DOI":"10.1016\/0304-3975(95)00132-8","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"107-143","source":"Crossref","is-referenced-by-count":33,"title":["Deciding true concurrency equivalences on safe, finite nets"],"prefix":"10.1016","volume":"154","author":[{"given":"Lalita","family":"Jategaonkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert R.","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00132-8_BIB1","series-title":"Proc. PARLE","first-page":"288","article-title":"Parallel complexity in the design and analysis of concurrent systems","volume":"Vol. 505","author":"Alvarez","year":"1991"},{"key":"10.1016\/0304-3975(95)00132-8_BIB2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01178506","article-title":"Concurrent bisimulations in Petri nets","volume":"28","author":"Best","year":"1991","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(95)00132-8_BIB3","series-title":"Proc. Internat. Joint Conf. on the Theory and Practice of Software Development","first-page":"123","article-title":"On the semantics of concurrency: partial orders and transition systems","volume":"Vol. 249","author":"Boudol","year":"1987"},{"key":"10.1016\/0304-3975(95)00132-8_BIB4","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","article-title":"A theory of communicating sequential processes","volume":"31","author":"Brookes","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00132-8_BIB5","series-title":"Seminar on Concurrency","first-page":"281","article-title":"An improved failures model for communicating processes","volume":"Vol. 197","author":"Brookes","year":"1984"},{"key":"10.1016\/0304-3975(95)00132-8_BIB6","series-title":"Proc. 17th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"98","article-title":"Alternation","author":"Chandra","year":"1976"},{"key":"10.1016\/0304-3975(95)00132-8_BIB7","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0304-3975(92)90298-T","article-title":"Maximality preserving bisimulation","volume":"102","author":"Devillers","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00132-8_BIB8","series-title":"Proc. Internat. Conf. on Automata, Languages and Programming","article-title":"An efficient algorithm for branching bisimulation and stuttering equivalence","author":"Groote","year":"1990"},{"key":"10.1016\/0304-3975(95)00132-8_BIB9","first-page":"272","article-title":"Algebraic Theory of Processes","author":"Hennessy","year":"1988"},{"key":"10.1016\/0304-3975(95)00132-8_BIB10","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(95)00132-8_BIB11","series-title":"Proc. Internat. Conf. on Concurrency Theory","first-page":"17","article-title":"Testing equivalence for Petri nets with action refinement","volume":"Vol. 630","author":"Jategaonkar","year":"1992"},{"key":"10.1016\/0304-3975(95)00132-8_BIB12","series-title":"Proc. Symp. on Logic in Computer Science","first-page":"409","article-title":"Self-synchronization of concurrent processes","author":"Jategaonkar","year":"1993"},{"key":"10.1016\/0304-3975(95)00132-8_BIB13","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","article-title":"CCS expressions, finite state processes and three problems of equivalence","volume":"86","author":"Kannelakis","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(95)00132-8_BIB14","series-title":"Proc. 17th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"89","article-title":"On parallelism in Turing machines","author":"Kozen","year":"1976"},{"key":"10.1016\/0304-3975(95)00132-8_BIB15","doi-asserted-by":"crossref","DOI":"10.1006\/inco.1994.1098","article-title":"The complexity of word problems \u2014 this time with interleaving","author":"Mayer","year":"1992"},{"key":"10.1016\/0304-3975(95)00132-8_BIB16","article-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/0304-3975(95)00132-8_BIB17","series-title":"Advances in Petri Nets","first-page":"381","article-title":"Some equivalence notions for concurrent systems: an overview","volume":"Vol. 222","author":"Pomello","year":"1985"},{"key":"10.1016\/0304-3975(95)00132-8_BIB18","series-title":"Proc. Internat. Conf. on Automata, Languages and Programming","first-page":"696","article-title":"Checking equivalences between concurrent systems of finite agents","volume":"Vol. 379","author":"Rabinovich","year":"1992"},{"key":"10.1016\/0304-3975(95)00132-8_BIB19","doi-asserted-by":"crossref","first-page":"357","DOI":"10.3233\/FI-1988-11404","article-title":"Behavior structures and nets of processes","volume":"11","author":"Rabinovich","year":"1988","journal-title":"Fundam. Inform."},{"key":"10.1016\/0304-3975(95)00132-8_BIB20","unstructured":"L.J. Stockmeyer, unpublished notes, 1992."},{"key":"10.1016\/0304-3975(95)00132-8_BIB21","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF00265151","article-title":"Step failures semantics and a complete proof system","volume":"27","author":"Taubner","year":"1989","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(95)00132-8_BIB22","series-title":"Proc. IFIP Working Conf. on Programming Concepts and Methods","article-title":"The refinement theorem for st-bisimulation semantics","author":"van Glabbeek","year":"1990"},{"key":"10.1016\/0304-3975(95)00132-8_BIB23","series-title":"Proc. Symp. on Mathematical Foundations of Computer Science","first-page":"237","article-title":"Equivalence notions for concurrent systems and refinement of actions","volume":"Vol. 379","author":"van Glabbeek","year":"1989"},{"key":"10.1016\/0304-3975(95)00132-8_BIB24","series-title":"Proc. PARLE","first-page":"224","article-title":"Petri net models for algebraic theories of concurrency","volume":"Vol. 259","author":"van Glabbeek","year":"1987"},{"key":"10.1016\/0304-3975(95)00132-8_BIB25","first-page":"613","article-title":"Branching time and abstraction in bisimulation semantics","volume":"89","author":"van Glabbeek","year":"1989","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/0304-3975(95)00132-8_BIB26","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0020808","article-title":"Bisimulation and action refinement","author":"Vogler","year":"1991"},{"key":"10.1016\/0304-3975(95)00132-8_BIB27","series-title":"Proc. Internat. Conf. on Automata, Languages and Programming","first-page":"495","article-title":"Deciding history preserving bisimulation","volume":"Vol. 510","author":"Vogler","year":"1991"},{"key":"10.1016\/0304-3975(95)00132-8_BIB28","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01798961","article-title":"Failures semantics based on interval semiwords is a congruence for refinement","volume":"4","author":"Vogler","year":"1991","journal-title":"Distributed Comput."},{"key":"10.1016\/0304-3975(95)00132-8_BIB29","doi-asserted-by":"crossref","DOI":"10.1006\/inco.1995.1050","article-title":"Generalized om-bisimulation","author":"Vogler","year":"1991"},{"key":"10.1016\/0304-3975(95)00132-8_BIB30","article-title":"Is partial order semantics necessary for action refinement?","author":"Vogler","year":"1991"},{"key":"10.1016\/0304-3975(95)00132-8_BIB31","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0304-3975(93)90157-O","article-title":"Bisimulation and action refinement","volume":"114","author":"Vogler","year":"1993","journal-title":"Theoret. Comput. Sci"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001328?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001328?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,16]],"date-time":"2023-04-16T01:51:50Z","timestamp":1681609910000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001328"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["0304397595001328"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00132-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}