{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:19Z","timestamp":1761610099016,"version":"build-2065373602"},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"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":3893,"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":[[2002,12]]},"DOI":"10.1016\/s1571-0661(04)80412-2","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"194-210","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Context-Sensitive Visibility"],"prefix":"10.1016","volume":"66","author":[{"given":"Antti","family":"Valmari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heikki","family":"Virtanen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antti","family":"Puhakka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80412-2_NEWBIB1","series-title":"Compilers \u2014 Principles, Techniques, and Tools","first-page":"796","author":"Aho","year":"1986"},{"key":"10.1016\/S1571-0661(04)80412-2_NEWBIB2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0169-7552(87)90085-7","article-title":"\u201cIntroduction to the ISO Specification Language LOTOS\u201d","volume":"14","author":"Bolognesi","year":"1987","journal-title":"Computer Networks and ISDN Systems"},{"key":"10.1016\/S1571-0661(04)80412-2_NEWBIB3","series-title":"Services and Visualization: Towards User-Friendly Design","first-page":"190","article-title":"\u201cAutomatic Error Location for IN Service Definition\u201d","volume":"1385","author":"Braun","year":"1998"},{"issue":"5","key":"10.1016\/S1571-0661(04)80412-2_NEWBIB4","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1145\/362946.362970","article-title":"\u201cA Note on Reliable FullDuplex Transmission over Half-Duplex Links\u201d","volume":"12","author":"Bartlett","year":"1969","journal-title":"Communications of the ACM"},{"key":"10.1016\/S1571-0661(04)80412-2_NEWBIB5","series-title":"Communicating Sequential Processes","first-page":"256","author":"Hoare","year":"1985"},{"key":"10.1016\/S1571-0661(04)80412-2_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Kaivola R. & Valmari A.: \u201cThe Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear Temporal Logic\u201d. Proceedings of CONCUR '92, Third International Conference on Concurrency Theory, Lecture Notes in Computer Science 630, Springer-Verlag 1992, pp. 207\u2013221.","DOI":"10.1007\/BFb0084793"},{"key":"10.1016\/S1571-0661(04)80412-2_NEWBIB7","doi-asserted-by":"crossref","unstructured":"Karsisto K. & Valmari A.: \u201cVerification-Driven Development of a Collision-Avoidance Protocol for the Ethernet\u201d. Proceedings of Formal Techniques in Real-Time and Fault Tolerant Systems, Lecture Notes in Computer Science 1135, Springer-Verlag 1996, pp. 228\u2013245.","DOI":"10.1007\/3-540-61648-9_43"},{"key":"10.1016\/S1571-0661(04)80412-2_NEWBIB8","unstructured":"Kervinen A., Valmari A. & J\u00e4rnstr\u00f6m, R.: \u201cDebugging a Real-life Protocol with CFFD-Based Verification Tools\u201d. Proceedings of FMICS 2001, 6th International Workshop on Formal Methods for Industrial Critical Systems, pp. 13\u201327."},{"key":"10.1016\/S1571-0661(04)80412-2_NEWBIB9","series-title":"Elements of the Theory of Computation","first-page":"361","author":"Lewis","year":"1998"},{"key":"10.1016\/S1571-0661(04)80412-2_NEWBIB10","doi-asserted-by":"crossref","unstructured":"Park D.: \u201cConcurrency and Automata on Infinite Sequences\u201d. Theoretical Computer Science: 5th GI-Conference, Lecture Notes in Computer Science 104, Springer-Verlag 1981, pp. 167\u2013183.","DOI":"10.1007\/BFb0017309"},{"key":"10.1016\/S1571-0661(04)80412-2_NEWBIB11","series-title":"The Theory and Practice of Concurrency","first-page":"565","author":"Roscoe","year":"1998"},{"key":"10.1016\/S1571-0661(04)80412-2_NEWBIB12","series-title":"Lectures on Petri Nets I: Basic Models","first-page":"429","article-title":"\u201cThe State Explosion Problem\u201d","volume":"1491","author":"Valmari","year":"1998"},{"key":"10.1016\/S1571-0661(04)80412-2_NEWBIB13","doi-asserted-by":"crossref","unstructured":"Valmari A., Karsisto K. & Set\u00e4l\u00e4, M.: \u201cVisualisation of Reduced Abstracted Behaviour as a Design Tool\u201d. Proceedings of PDP'96, the Fourth Euromicro Workshop on Parallel and Distributed Processing, IEEE Computer Society Press, pp. 187\u2013194.","DOI":"10.1109\/EMPDP.1996.500586"},{"key":"10.1016\/S1571-0661(04)80412-2_NEWBIB14","doi-asserted-by":"crossref","unstructured":"Valmari A., Kemppainen J., Clegg M. & Levanto M.: \u201cPutting Advanced Reachability Analysis Techniques Together: the ARA Tool\u201d. Proceedings of Formal Methods Europe '93: Industrial-Strength Formal Methods, Lecture Notes in Computer Science 670, Springer-Verlag 1993, pp. 597\u2013616.","DOI":"10.1007\/BFb0024669"},{"key":"10.1016\/S1571-0661(04)80412-2_NEWBIB15","doi-asserted-by":"crossref","unstructured":"Valmari A. & Kokkarinen I.: \u201cUnbounded Verification Results by Finite-State Compositional Techniques: 10any States and Beyond\u201d. Proceeding of the 1998 International Conference on Application of Concurrency to System Design, Aizu-Wakamatsu, Fukushima, Japan, March 1998, IEEE Computer Society, pp. 75\u201385.","DOI":"10.1109\/CSD.1998.657541"},{"key":"10.1016\/S1571-0661(04)80412-2_NEWBIB16","doi-asserted-by":"crossref","unstructured":"Valmari A. & Set\u00e4l\u00e4, M.: \u201cVisual Verification of Safety and Liveness\u201d. Proceedings of Formal Methods Europe '96: Industrial Benefit and Advances in Formal Methods, Lecture Notes in Computer Science 1051, Springer-Verlag 1996, pp. 228\u2013247.","DOI":"10.1007\/3-540-60973-3_90"},{"key":"10.1016\/S1571-0661(04)80412-2_NEWBIB17","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1007\/BF01211218","article-title":"\u201cCompositional Failure-Based Semantic Models for Basic LOTOS\u201d","volume":"7","author":"Valmari","year":"1995","journal-title":"Formal Aspects of Computing"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804122?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804122?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:04:43Z","timestamp":1761609883000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104804122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S1571066104804122"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80412-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Context-Sensitive Visibility","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(04)80412-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}