{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:01:19Z","timestamp":1778299279924,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540582014","type":"print"},{"value":"9783540485667","type":"electronic"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58201-0_56","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:34:17Z","timestamp":1330270457000},"page":"35-46","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Deciding properties of integral relational automata"],"prefix":"10.1007","author":[{"given":"K\u0101rlis","family":"\u010cer\u0101ns","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"4_CR1","unstructured":"P.Abdulla, B.Jonsson, Verifying Programs with Unreliable Channels, in Proc. of LICS'93, Montreal, Canada, 1993."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"P.A.Abdulla, B.Jonsson, Undecidable Verification Problems for Programs with Unreliable Channels, in Proc. of ICALP'94, LNCS, this volume, 1994.","DOI":"10.1007\/3-540-58201-0_78"},{"key":"4_CR3","unstructured":"R. Alur and D.Dill, Automata for Modelling Real-Time Systems, in Proc. of ICALP'90, LNCS, No.443, 1990."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"R. Alur, C.Courcoubetis and D.Dill, Model-Checking for Real-Time Systems, in Proc. of LICS'90, pp. 414\u2013425, 1990.","DOI":"10.1109\/LICS.1990.113766"},{"key":"4_CR5","unstructured":"A. Auzi\u0146\u0161, J. B\u0101rzdi\u0146\u0161, J. Bi\u010devskis, K. \u010cer\u0101ns and A. Kalni\u0146\u0161, Automatic Construction of Test Sets: Theoretical Approach, in Baltic Computer Science, LNCS, No. 502, 1991."},{"key":"4_CR6","unstructured":"J.M.Barzdin, J.J.Bicevskis and A.A.Kalninsh, Construction of Complete Sample Systems for Program Testing, in Latv. Gosudarst. Univ. Uch. Zapiski, Vol.210, 1974 (In Russian)."},{"key":"4_CR7","unstructured":"J.M.Barzdin, J.J.Bicevskis and A.A.Kalninsh, Automatic Construction of Complete Sample Systems for Program Testing, in Proc. IFIP Congress, 1977, North-Holland 1977."},{"key":"4_CR8","unstructured":"O. Burkhart, B. Steffen, Model Checking for Context-Free Processes, In Proc. of CONCUR'92, LNCS No. 630, 1992."},{"key":"4_CR9","unstructured":"K. \u010cer\u0101ns, Feasibility of Finite and Infinite Paths in Data Dependent Programs, in Proc. for LFCS'92, Russia, Tver, LNCS No. 620, 1992."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"K. \u010cer\u0101ns, Decidability of Bisimulation Equivalences for Parallel Timer Processes, in Proc. of CAV'92, LNCS No.663, 1992.","DOI":"10.1007\/3-540-56496-9_24"},{"key":"4_CR11","volume-title":"Report No.78","author":"K. \u010cer\u0101ns","year":"1993","unstructured":"K. \u010cer\u0101ns, Deciding Properties of Relational Automata: Reachability Relation Characterization, in Proc. of 4th Nordic Workshop on Program Correctness, Report No.78, Department of Informatics, University of Bergen, Bergen, Norway, 1993."},{"key":"4_CR12","volume-title":"Report No.73","author":"K. \u010cer\u0101ns","year":"1993","unstructured":"K. \u010cer\u0101ns, Deciding Properties of Integral Relational Automata, in Proc. of El Winterm\u00f6te, Report No.73, PMG, Dept. of Computer Sciences, Chalmers University of Technology, G\u00f6teborg, Sweden, 1993."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"S. Christensen, Y. Hirshfeld, F. Moller Bisimulation equivalence is decidable for Basic Parallel processes, in Proc. of CONCUR'93, LNCS No. 715, 1993.","DOI":"10.1007\/3-540-57208-2_11"},{"key":"4_CR14","unstructured":"S. Christensen, H. H\u00fcttel, C. Stirling, Bisimulation equivalence is decidable for all context free processes, in Proc. of CONCUR'92, LNCS No. 630, 1992."},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"E.M.Clarke, E.A.Emerson and A.P.Sistla, Automatic Verification of Finite-State Concurrent Systems using Temporal Logic Specifications, in ACM Transactions on Programming Languages and Systems, Vol.8, No.2, 1986.","DOI":"10.1145\/5397.5399"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"E.A.Emerson, J.Y.Hailpern, \u201cSometimes\u201d and \u201cnot never\u201d revisited: On Branching versus Linear Time, in Proc. of ACM POPL'83, 1983.","DOI":"10.1145\/567067.567081"},{"key":"4_CR17","unstructured":"J. Esparza, On the decidability of model checking for several \u03bc-calculi and Petri nets, Report ECS-LFCS-93-274, Department of Computer Science, University of Edinburgh, 1993."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"P. Jan\u010dar, Decidability Questions for Bisimilarity of Petri Nets and Some Related Problems, Report ECS-LFCS-93-261, Department of Computer Science, University of Edinburgh, 1993.","DOI":"10.1007\/3-540-57785-8_173"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"S.R. Kosaraju, Decidability of reachability in vector addition systems, in Proc. 6th ACM STOC, 1982.","DOI":"10.1145\/800070.802201"},{"issue":"3","key":"4_CR20","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"S. Mayr","year":"1984","unstructured":"S. Mayr, An algorithm for the general Petri net reachability problem, SIAM J. of Computing 13(3), pp.441\u2013460, 1984.","journal-title":"SIAM J. of Computing"},{"key":"4_CR21","volume-title":"Finite and Infinite Machines","author":"M. Minsky","year":"1967","unstructured":"M. Minsky, Finite and Infinite Machines, Prentice Hall, Englewood Cliffs, N.Y., 1967."},{"key":"4_CR22","unstructured":"J.L. Peterson, Petri Net Theory and the Modelling of Systems, Prentice Hall, 1981."},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"A.P.Sistla, M.Y.Vardi, P.Wolper, The Complementation Problem for B\u00fcchi Automata With Applications to Temporal Logic, Theoretical Computer Science No.49, 1987.","DOI":"10.1016\/0304-3975(87)90008-9"},{"key":"4_CR24","unstructured":"M.Y. Vardi, P. Wolper, An Automata-Theoretic Approach to Automatic Program Verification, in Proc. of LICS, 1986."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58201-0_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:23:39Z","timestamp":1742595819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58201-0_56"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582014","9783540485667"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-58201-0_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"29 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}