{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T20:09:38Z","timestamp":1694635778414},"reference-count":48,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Systems and Software"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0164-1212(97)00169-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:21:35Z","timestamp":1027610495000},"page":"227-248","source":"Crossref","is-referenced-by-count":3,"title":["Application of formal verification and behaviour abstraction to the service interaction problem in intelligent networks"],"prefix":"10.1016","volume":"40","author":[{"given":"Ulrich","family":"Nitsche","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0164-1212(97)00169-6_BIB1","doi-asserted-by":"crossref","DOI":"10.1109\/LICS.1988.5115","article-title":"The existence of refinement mappings","author":"Abadi","year":"1988"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB2","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-52559-9_59","article-title":"Composing specifications","author":"Abadi","year":"1990"},{"issue":"4","key":"10.1016\/S0164-1212(97)00169-6_BIB3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","article-title":"Defining liveness","volume":"21","author":"Alpern","year":"1985","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB4","series-title":"Computer Aided Verification (CAV) '95","first-page":"166","article-title":"Local liveness for compositional modeling of fair reactive systems","volume":"volume 939","author":"Alur","year":"1995"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB5","series-title":"Proceedings of the International Congress on Logic, Methodology and Philosophy of Science 1960","first-page":"1","article-title":"On a decision method in restricted second order arithmetic","author":"B\u00fcchi","year":"1962"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB6","article-title":"Product nets\u2014a formal description technique for cooperating systems","author":"Burkhardt","year":"1989"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB7","series-title":"Computer Aided Verification (CAV) '96","first-page":"466","article-title":"Verification by behavior abstraction: A case study of service interaction detection in intelligent telephone networks","volume":"volume 1102","author":"Capellmann","year":"1996"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB8","series-title":"Proceedings of International Workshop on Advanced Intelligent Networks '96","first-page":"71","article-title":"Case study: Service interaction detection by formal verification under behavior abstraction","author":"Capellmann","year":"1996"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB9","series-title":"Proceedings of IEEE IN Workshop 94","article-title":"A user-view of services and network: Formal specification and interaction detection","author":"Combes","year":"1994"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB10","series-title":"Abschlu\u03b2bericht des GMD-\/Telekom-Projekts Formale Spezifikations- und Verifikations-methoden zur Behandlung der Service-Interaction-Problematik-SERVINTII","author":"Demant","year":"1996"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB11","series-title":"Abschlu\u03b2bericht des GMD-\/Telekom-Projekts Formale Spezifikations-und Verifikationsmethoden zur Behandlung der Service-Interaction-Problematik-SERVINT","author":"Demant","year":"1995"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB12","series-title":"Zwischenbericht des GMD-\/Telekom-Projekts Formale Spezifikations-und Verifikationsmethoden zur Behandlung der Service-Interaction-Problematik-SERVINT2","author":"Demant","year":"1996"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB13","volume":"volume A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB14","doi-asserted-by":"crossref","unstructured":"Emerson, E. A. Temporal and modal logic. In van Leeuwen [46], Pages 995\u20131072.","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB15","author":"Francez","year":"1986"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB16","article-title":"Decidability questions for petri nets","author":"Hack","year":"1976"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB17","author":"Harrison","year":"1978"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB18","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0020-0190(92)90005-G","article-title":"Sooner is safer than later","volume":"43","author":"Henzinger","year":"1992","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB19","series-title":"Current Trends in Concurrency","first-page":"266","article-title":"Infinitary languages: Basic theory and applications to concurrent systems","volume":"volume 224","author":"Hoogeboom","year":"1986"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB20","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB21","author":"Kelley","year":"1955"},{"issue":"2","key":"10.1016\/S0164-1212(97)00169-6_BIB22","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/TSE.1977.229904","article-title":"Proving the correctness of multiprocess programs","volume":"SE-3","author":"Lamport","year":"1977","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB23","series-title":"12th Annual ACM Symposium on Principles of Programming Languages '85","first-page":"97","article-title":"Checking that finite state concurrent programs satisfy their linear specification","author":"Lichtenstein","year":"1985"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB24","author":"Manna","year":"1992"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB25","article-title":"Verification of Co-Operating Systems and Behaviour Abstraction","author":"Nitsche","year":"1996"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB26","series-title":"Logical Foundations of Computer Science '94, St. Petersburg","first-page":"265","article-title":"Propositional linear temporal logic and language homomorphisms","volume":"volume 813","author":"Nitsche","year":"1994"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB27","series-title":"Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing","first-page":"393","article-title":"A verification method based on homomorphic model abstraction","author":"Nitsche","year":"1994"},{"issue":"3","key":"10.1016\/S0164-1212(97)00169-6_BIB28","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0164-1212(96)00026-X","article-title":"Verification and behavior abstraction-towards a tractable verification technique for large distributed systems","volume":"33","author":"Nitsche","year":"1996","journal-title":"Journal of Systems and Software"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB29","series-title":"Zwischenbericht des GMD-\/Telekom-Projekts Formale Spezifikations- und Verifikationsmethoden zur Behandlung der Service-Interaction-Problematik-SERVINT","author":"Nitsche","year":"1995"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB30","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0020-0190(96)00162-7","article-title":"Approximately satisfied properties of systems and simple language homomorphisms","volume":"60","author":"Nitsche","year":"1996","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB31","article-title":"The SH-Verification Tool","author":"Nitsche","year":"1996"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB32","series-title":"Proceedings of the 16th ACM Symposium on Principles of Distributed Computing (PODC'97)","article-title":"Relative liveness and behavior abstraction (extended abstract)","author":"Nitsche","year":"1997"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB33_1","first-page":"11","article-title":"Die Produktnetzmaschine","volume":"39","author":"Ochsenschl\u00e4ger","year":"1991","journal-title":"Petri Net Newsletter"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB33_2","author":"Ochsenschl\u00e4ger","year":"1991","journal-title":"GMD Arbeitspapier Nr. 505"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB34","article-title":"Verifikation kooperierender Systeme mittels schlichter Homomorphismen","author":"Ochsenschl\u00e4ger","year":"1992"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB35","series-title":"Workshop: Algorithmen und Werkzeuge f\u00fcr Petrinetze","first-page":"48","article-title":"Verification of cooperating systems by simple homomorphisms using the product net machine","author":"Ochsenschl\u00e4ger","year":"1994"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB36","series-title":"Workshop: Algorithmen und Werkzeuge f\u00fcr Petrinetze","first-page":"8","article-title":"Compositional verification of cooperating systems using simple homomorphisms","author":"Ochsenschl\u00e4ger","year":"1995"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB37","author":"Ochsenschl\u00e4ger","year":"1995"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB38","series-title":"Deliverable 1. Annex B: State of the Art in Interaction Handling","article-title":"Handling Service Interaction in the Service Life Cycle","year":"1995"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB39","author":"Peterson","year":"1981"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB40","series-title":"Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science","first-page":"46","article-title":"The temporal logic of programs","author":"Pnueli","year":"1977"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB41","year":"1995","journal-title":"Distributed Functional Plane for Intelligent Network CS-1"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB42","year":"1992","journal-title":"ITU-T Recommendations Q.12xx-Q series"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB43","article-title":"Petri Nets\u2014An Introduction","volume":"volume 4","author":"Reisig","year":"1985"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB44","volume":"Volume I","year":"1994","journal-title":"Service Interaction Analysis"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB45","doi-asserted-by":"crossref","unstructured":"Thomas, W. Automata on infinite objects. van Leeuwen [46], pages 133\u2013191.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB46","series-title":"Proceedings of the 26th IEEE Symposium on Foundations of Computer Science","first-page":"327","article-title":"Automatic verification of probabilistic concurrent finite-state programs","author":"Vardi","year":"1985"},{"key":"10.1016\/S0164-1212(97)00169-6_BIB47","series-title":"Proceedings of the 1st Symposium on Logic in Computer Science","article-title":"An automata-theoretic approach to automatic program verification","author":"Vardi","year":"1986"}],"container-title":["Journal of Systems and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0164121297001696?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0164121297001696?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T08:15:58Z","timestamp":1578644158000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0164121297001696"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0164121297001696"],"URL":"https:\/\/doi.org\/10.1016\/s0164-1212(97)00169-6","relation":{},"ISSN":["0164-1212"],"issn-type":[{"value":"0164-1212","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}