{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:20Z","timestamp":1725663380136},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540542339"},{"type":"electronic","value":"9783540475163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54233-7_157","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:38:15Z","timestamp":1330209495000},"page":"481-494","source":"Crossref","is-referenced-by-count":5,"title":["The meaning of negative premises in transition system specifications"],"prefix":"10.1007","author":[{"given":"Roland","family":"Bol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan Friso","family":"Groote","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"2","key":"37_CR1","first-page":"127","volume":"XI","author":"J.C.M. Baeten","year":"1986","unstructured":"J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Syntax and defining equations for an interrupt mechanism in process algebra. Fund. Inf., XI(2):127\u2013168, 1986.","journal-title":"Fund. Inf."},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can't be traced: preliminary report. In Conference Record of the 15th ACM Symposium on Principles of Programming Languages, San Diego, California, pages 229\u2013239, 1988.","DOI":"10.1145\/73560.73580"},{"key":"37_CR3","volume-title":"The meaning of negative premises in transition system specifications","author":"R.N. Bol","year":"1990","unstructured":"R.N. Bol and J.F. Groote. The meaning of negative premises in transition system specifications. Report CS-R9054, CWI, Amsterdam, 1990."},{"key":"37_CR4","unstructured":"T. Bolognesi, F. Lucidi, and S. Trigila. From timed Petri nets to timed LOTOS. In L. Logrippo, R.L. Probert, and H. Ural, editors, Proceedings of the Tenth International IFIP WG6.1 Symposium on Protocol Specification, Testing and Verification, Ottawa, 1990."},{"issue":"5","key":"37_CR5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF01379186","volume":"18","author":"J. Camilleri","year":"1989","unstructured":"J. Camilleri. An operational semantics for OCCAM. International Journal of Parallel Programming, 18(5):149\u2013167, October 1989.","journal-title":"International Journal of Parallel Programming"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"R. Cleaveland and M. Hennessy. Priorities in process algebra. In Proceedings third Annual Symposium on Logic in Computer Science (LICS), Edinburgh, pages 193\u2013202, 1988.","DOI":"10.1109\/LICS.1988.5118"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"A. van Gelder, K. Ross, and J.S. Schlipf. Unfounded sets and well-founded semantics for general logic programs. In Proceedings of the Seventh Symposium on Principles of Database Systems, pages 221\u2013230. ACM SIGACT-SIGMOD, 1988.","DOI":"10.1145\/308386.308444"},{"key":"37_CR8","unstructured":"M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth Logic Programming Symposium, pages 1070\u20131080. MIT press, 1988."},{"key":"37_CR9","first-page":"336","volume":"247","author":"R.J. Glabbeek van","year":"1987","unstructured":"R.J. van Glabbeek. Bounded nondeterminism and the approximation induction principle in process algebra. In F.J. Brandenburg, G. Vidal-Naquet, and M. Wirsing, editors, Proceedings STACS 87, LNCS 247, pages 336\u2013347. Springer-Verlag, 1987.","journal-title":"LNCS"},{"key":"37_CR10","series-title":"Technical Report","volume-title":"Transition system specifications with negative premises","author":"J.F. Groote","year":"1989","unstructured":"J.F. Groote. Transition system specifications with negative premises. Technical Report CS-R8950, CWI, Amsterdam, 1989. An extended abstract appeared in J.C.M. Baeten and J.W. Klop, editors, Proceedings of Concur90, Amsterdam, LNCS 458, pages 332\u2013341. Springer-Verlag, 1990."},{"key":"37_CR11","series-title":"Technical Report","volume-title":"Structured operational semantics and bisimulation as a congruence","author":"J.F. Groote","year":"1988","unstructured":"J.F. Groote and F.W. Vaandrager. Structured operational semantics and bisimulation as a congruence. Technical Report CS-R8845, CWI, Amsterdam, 1988. An extended abstract appeared in G. Ausiello, M. Dezani-Ciancaglini and, S. Ronchi Della Rocca, editors, Proceedings ICALP 89, Stresa, LNCS 372, pages 423\u2013438. Springer-Verlag, 1989."},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"R. Milner. A Calculus of Communicating Systems. LNCS 92. Springer-Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"37_CR13","first-page":"167","volume":"104","author":"D.M.R. Park","year":"1981","unstructured":"D.M.R. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Proceedings Fifth GI Conference, LNCS 104, pages 167\u2013183. Springer-Verlag, 1981.","journal-title":"LNCS"},{"key":"37_CR14","unstructured":"G.D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981."},{"key":"37_CR15","first-page":"15","volume":"194","author":"A. Pnueli","year":"1985","unstructured":"A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. In W. Brauer, editor, Proceedings ICALP 85, Nafplion, LNCS 194, pages 15\u201332. Springer-Verlag, 1985.","journal-title":"LNCS"},{"key":"37_CR16","first-page":"193","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"T.C. Przymusinski","year":"1987","unstructured":"T.C. Przymusinski. On the declarative semantics of deductive databases and logic programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 193\u2013216. Morgan Kaufmann Publishers Inc., Los Altos, California, 1987."},{"key":"37_CR17","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81\u2013132, 1980.","journal-title":"Artificial Intelligence"},{"key":"37_CR18","unstructured":"F.W. Vaandrager. Algebraic Techniques for Concurrency and their Application. PhD thesis, Centrum voor Wiskunde en Informatica, February 1990."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54233-7_157.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:53:18Z","timestamp":1605646398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54233-7_157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540542339","9783540475163"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-54233-7_157","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}