{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T10:57:37Z","timestamp":1772881057158,"version":"3.50.1"},"reference-count":32,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"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":7259,"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":[[1993,9]]},"DOI":"10.1016\/0304-3975(93)90111-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"263-299","source":"Crossref","is-referenced-by-count":133,"title":["Transition system specifications with negative premises"],"prefix":"10.1016","volume":"118","author":[{"given":"Jan Friso","family":"Groote","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90111-6_BIB1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(87)90065-X","article-title":"Observation equivalence as a testing equivalence","volume":"53","author":"Abramsky","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90111-6_BIB2","series-title":"Handbook of Theoretical Computer Science","first-page":"495","article-title":"Logic programming","volume":"Vol. B","author":"Apt","year":"1990"},{"key":"10.1016\/0304-3975(93)90111-6_BIB3","series-title":"The Trial Definition of Ada, Deliverable 7 of the CEC MAP Project: The Draft Formal Definition of ANSI\/MIL-STD 1815 Ada","author":"Astesiano","year":"1986"},{"key":"10.1016\/0304-3975(93)90111-6_BIB4","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."},{"key":"10.1016\/0304-3975(93)90111-6_BIB5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0890-5401(88)90027-2","article-title":"Global renaming operators in concrete process algebra","volume":"78","author":"Baeten","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(93)90111-6_BIB6","first-page":"177","article-title":"Processen en procesexpressies","volume":"30","author":"Baeten","year":"1988","journal-title":"Informatie"},{"issue":"2","key":"10.1016\/0304-3975(93)90111-6_BIB7","first-page":"127","article-title":"Syntax and defining equations for an interrupt mechanism in process algebra","volume":"IX","author":"Baeten","year":"1986","journal-title":"Fund. Inform."},{"key":"10.1016\/0304-3975(93)90111-6_BIB8","series-title":"Logic Group Preprint Series No. 3, CIF","article-title":"Put and get, primitives for synchronous unreliable message passing","author":"Bergstra","year":"1985"},{"key":"10.1016\/0304-3975(93)90111-6_BIB9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0167-6423(92)90005-V","article-title":"The synchronous programming language ESTEREL: design, semantics, implementation","volume":"19","author":"Berry","year":"1992","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0304-3975(93)90111-6_BIB10","series-title":"Proc. 15th ACM Symp. on Principles of Programming Languages","first-page":"229","article-title":"Bisimulation can't be traced: preliminary report","author":"Bloom","year":"1988"},{"key":"10.1016\/0304-3975(93)90111-6_BIB11","series-title":"Tech. Report 90-1150","article-title":"Bisimulation can't be traced","author":"Bloom","year":"1990"},{"key":"10.1016\/0304-3975(93)90111-6_BIB12_1","series-title":"Report CS-R9054","article-title":"The meaning of negative premises in transition system specifications","author":"Bol","year":"1990"},{"key":"10.1016\/0304-3975(93)90111-6_BIB12_2","series-title":"Proc. 18th ICALP","first-page":"481","year":"1991"},{"key":"10.1016\/0304-3975(93)90111-6_BIB13","series-title":"Proc. 3rd Ann. Symp. on Logic in Computer Science","first-page":"193","article-title":"Priorities in process algebra","author":"Cleaveland","year":"1988"},{"key":"10.1016\/0304-3975(93)90111-6_BIB14","series-title":"Proc. STACS '87","first-page":"336","article-title":"Bounded nondeterminism and the approximation induction principle in process algebra","volume":"Vol. 247","author":"van Glabbeek","year":"1987"},{"key":"10.1016\/0304-3975(93)90111-6_BIB15_1","series-title":"Proc. 16th ICALP","article-title":"Structured operational semantics and bisimulation as a congruence (extended abstract)","volume":"Vol. 372","author":"Groote","year":"1989"},{"key":"10.1016\/0304-3975(93)90111-6_BIB15_2","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","volume":"100","year":"1992","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(93)90111-6_BIB16","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(93)90111-6_BIB17","unstructured":"ISO, Information processing systems\u2014open systems interconnection\u2014LOTOS\u2014formal description technique based on the temporal ordering of observational behaviour ISO\/TC97\/SC21\/N DIS8807, 1987."},{"key":"10.1016\/0304-3975(93)90111-6_BIB18","series-title":"Tech. Report R 89-09","article-title":"Modal specifications","author":"Larsen","year":"1989"},{"key":"10.1016\/0304-3975(93)90111-6_BIB19","series-title":"Proc. 16th ACM Symp. on Principles of Programming Languages","first-page":"344","article-title":"Bisimulation through probabilistic testing","author":"Larsen","year":"1989"},{"key":"10.1016\/0304-3975(93)90111-6_BIB20","article-title":"A Calculus of Communicating Systems","volume":"Vol. 92","author":"Milner","year":"1980"},{"key":"10.1016\/0304-3975(93)90111-6_BIB21","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(93)90111-6_BIB22","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/0304-3975(93)90111-6_BIB23","series-title":"Ph.D. Thesis","article-title":"Axioms for concurrency","author":"Moller","year":"1989"},{"key":"10.1016\/0304-3975(93)90111-6_BIB24","series-title":"Proc. 5th GI Conf.","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"Vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/0304-3975(93)90111-6_BIB25","unstructured":"I.C.C. Phillips, CCS with broadcast stability, unpublished manuscript."},{"key":"10.1016\/0304-3975(93)90111-6_BIB26","series-title":"Report DAIMI FN-19","article-title":"A structural approach to operational semantics","author":"Plotkin","year":"1981"},{"key":"10.1016\/0304-3975(93)90111-6_BIB27","series-title":"Proc. IFIP TC2 Working Conf. on Formal Description of Programming Concepts \u2014 II","first-page":"199","article-title":"An operational semantics for CSP","author":"Plotkin","year":"1983"},{"key":"10.1016\/0304-3975(93)90111-6_BIB28","series-title":"Proc. 12th ICALP","first-page":"15","article-title":"Linear and branching structures in the semantics and logics of reactive systems","volume":"Vol. 194","author":"Pnueli","year":"1985"},{"key":"10.1016\/0304-3975(93)90111-6_BIB29","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"193","article-title":"On the declarative semantics of deductive databases and logic programs","author":"Przymusinski","year":"1987"},{"key":"10.1016\/0304-3975(93)90111-6_BIB30","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."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593901116?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593901116?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:24:26Z","timestamp":1555115066000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397593901116"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["0304397593901116"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90111-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}