{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T09:59:38Z","timestamp":1760954378117},"reference-count":31,"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\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5617,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0167-6423(97)00017-8","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:33:51Z","timestamp":1052782431000},"page":"309-338","source":"Crossref","is-referenced-by-count":16,"title":["State space reduction by non-standard semantics for deadlock analysis"],"prefix":"10.1016","volume":"30","author":[{"given":"Nicoletta","family":"De Francesco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonella","family":"Santone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gigliola","family":"Vaglini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6423(97)00017-8_BIB1","series-title":"Proc. 4th Workshop on Computer Aided Verification (CAV'92)","first-page":"260","article-title":"Property preserving simulations","volume":"Vol. 663","author":"Bensalem","year":"1992"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB2","series-title":"Proc. IFIP WG 6.1 7th Conf. on Protocol Specification, Testing and Verification","article-title":"Fundamental results for the verification of observational equivalence: a survey","author":"Bolognesi","year":"1987"},{"issue":"3","key":"10.1016\/S0167-6423(97)00017-8_BIB3","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0167-6423(92)90018-7","article-title":"Minimal state graph generation","volume":"18","author":"Bouajjani","year":"1992","journal-title":"Science of Computer Programming"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB4","first-page":"207","article-title":"The integration Project for JACK Environment","volume":"54","author":"Bouali","year":"1994","journal-title":"Bull. EATCS"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB5","series-title":"Proc. 4th Internat. Conf. on Concurrency Theory (CONCUR'93)","first-page":"37","article-title":"A practical technique for process abstraction","volume":"Vol. 714","author":"Bruns","year":"1993"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB6","doi-asserted-by":"crossref","first-page":"1512","DOI":"10.1145\/186025.186051","article-title":"Model checking and abstraction","volume":"16","author":"Clarke","year":"1994","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB7","series-title":"Proc. 5th Internat. Conf. on Concurrency Theory (CONCUR'94)","first-page":"417","article-title":"Testing-based abstractions for value-passing systems","volume":"Vol. 836","author":"Cleaveland","year":"1994"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB8","series-title":"Workshop on Computer Aided Verification, DIMACS 90","article-title":"Memory efficient algorithms for the verification of temporal properties","author":"Courcoubetis","year":"1990"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB9","series-title":"Proc. 6th ACM Symp. on Principles of Programming Languages","first-page":"269","article-title":"Systematic design of program analysis frameworks","author":"Cousot","year":"1979"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB10","series-title":"ACM Symp. on Principles of Programming Languages","first-page":"83","article-title":"Inductive definitions, semantics and abstract interpretations","author":"Cousot","year":"1992"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB11","series-title":"Workshop on Computer Aided Verification (CAV'94)","first-page":"455","article-title":"Model checking using adaptive state and data abstraction","volume":"Vol. 818","author":"Dams","year":"1994"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB12","unstructured":"N. De Francesco, A. Santone, G. Vaglini, Reducing state space with non-standard semantics, Internal Report IR-3\/95, Dipartimento di Ingegneria dell'Informazionc, Univ. of Pisa."},{"key":"10.1016\/S0167-6423(97)00017-8_BIB13","series-title":"3rd Internat. Conf. on Formal Description Techniques, FORTE'90","article-title":"Verifying bisimulation on the fly","author":"Fernandez","year":"1990"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB14","series-title":"Proc. 3rd Internat. Conf. on Computer-Aided Verification (CAV'91)","first-page":"181","article-title":"\u201cOn the Fly\u201d verification of behavioural equivalences and preordes","volume":"Vol. 575","author":"Fernandez","year":"1991"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB15","series-title":"Proc. 6th Annual IEEE Symp. on Logic in Computer Science (LICS)","article-title":"A partial approach to model checking","author":"Godefroid","year":"1991"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB16","series-title":"Proc. 3rd Internat. Conf. on Computer-Aided Verification (CAV'91)","first-page":"332","article-title":"Using partial orders for efficient verification of deadlock freedom and safety properties","volume":"Vol. 575","author":"Godefroid","year":"1991"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB17","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0304-3975(94)00073-R","article-title":"On the implementation of concurrent calculi in net calculi: two cases studies","volume":"141","author":"Gorrieri","year":"1995","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/S0167-6423(97)00017-8_BIB18","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0019-9958(84)80014-5","article-title":"On the progress of communication between two finite state machines","volume":"63","author":"Gouda","year":"1984","journal-title":"Inform. and Control"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB19","series-title":"Internat. Workshop on Automatic Verification Methods for Finite State Systems","first-page":"189","article-title":"On-line model-checking for finite linear temporal logic specifications","volume":"Vol. 407","author":"Jard","year":"1989"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB20","series-title":"Proc. 3rd Internat. Conf. on Computer-Aided Verification (CAV'91)","first-page":"192","article-title":"Bounded-memory algorithms for verification on-the-fly","volume":"Vol. 575","author":"Jard","year":"1991"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB21","series-title":"Proc. 2nd Workshop on Computer-Aided Verification","article-title":"Finiteness conditions and structural construction of automata for all process algebras","author":"Madelaine","year":"1990"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB22","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB23","series-title":"Proc. 5th Internat. Conf. on Computer-Aided Verification (CAV'93)","first-page":"409","article-title":"All from one, one for all, on model-checking using representatives","volume":"Vol. 679","author":"Peled","year":"1993"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB24","series-title":"Proc. 2nd Internat. Conf. on Computer-Aided Verification (CAV'90)","first-page":"243","article-title":"A unified approach to the deadlock detection problem in networks of communicating finite state machines","volume":"Vol. 531","author":"Peng","year":"1990"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB25","article-title":"Petri Nets","volume":"Vol. 4","author":"Reisig","year":"1985","journal-title":"EATCS Monographs on Theoretical Computer Science"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB26","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0167-6423(94)00011-5","article-title":"Petri-net-based deadlock analysis of Process Algebra programs","volume":"23","author":"Rondogiannis","year":"1994","journal-title":"Science of Computer Programming"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB27","series-title":"Logics of Programs","article-title":"Property preserving homomorphisms of transition systems","volume":"Vol. 164","author":"Sifakis","year":"1983"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB28","first-page":"57","article-title":"Complexity of analyzing the synchronization structure of concurrent programs","volume":"18","author":"Taylor","year":"1983","journal-title":"Acta Inform."},{"key":"10.1016\/S0167-6423(97)00017-8_BIB29","series-title":"Proc. 2nd Internat. Conf. on Computer-Aided Verification (CAV'90)","first-page":"156","article-title":"A stubborn attack on state explosion","volume":"Vol. 531","author":"Valmari","year":"1990"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB30","series-title":"Proc. 2nd Internat. Conf. on Concurrency Theory (CONCUR'91)","first-page":"526","article-title":"Reduced labelled transition systems save verification effort","volume":"Vol. 527","author":"Valmari","year":"1991"},{"key":"10.1016\/S0167-6423(97)00017-8_BIB31","first-page":"2514","article-title":"Deadlock detection for a class of communicating finite state machines","author":"Yu","year":"1982","journal-title":"IEEE Trans. Commun."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642397000178?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642397000178?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T23:55:39Z","timestamp":1555458939000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642397000178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0167642397000178"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6423(97)00017-8","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}