{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:20Z","timestamp":1761611300217},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616047"},{"type":"electronic","value":"9783540706250"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61604-7_71","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:03:30Z","timestamp":1330293810000},"page":"481-497","source":"Crossref","is-referenced-by-count":18,"title":["Constrained properties, semilinear systems, and Petri nets"],"prefix":"10.1007","author":[{"given":"Ahmed","family":"Bouajjani","sequence":"first","affiliation":[]},{"given":"Peter","family":"Habermehl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"P. Abdulla and B. Jonsson. Verifying Programs with Unreliable Channels. In LICS'93. IEEE, 1993.","DOI":"10.1109\/LICS.1993.287591"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"J. Baeten, J.A. Bergstra, and J.W. Klop. Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. T.R. CS-R8632, 1987. CWI.","DOI":"10.1007\/3-540-17945-3_5"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"J.A. Bergstra and J.W. Klop. Process Theory based on Bisimulation Semantics. In REX School\/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, 1988. LNCS 354.","DOI":"10.1007\/BFb0013021"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"A. Bouajjani, R. Echahed, and P. Habermehl. On the Verification Problem of Nonregular Properties for Nonregular Processes. In LICS'95. IEEE, 1995.","DOI":"10.1109\/LICS.1995.523250"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"A. Bouajjani, R. Echahed, and P. Habermehl. Verifying Infinite State Processes with Sequential and Parallel Composition. In POPL'95. ACM, 1995.","DOI":"10.1145\/199448.199470"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"O. Burkart and B. Steffen. Pushdown Processes: Parallel Composition and Model Checking. In CONCUR'94, 1994. LNCS 836.","DOI":"10.1007\/978-3-540-48654-1_9"},{"key":"28_CR7","unstructured":"S. Christensen. Decidability and Decomposition in Process Algebra. PhD thesis, University of Edinburgh, 1993."},{"key":"28_CR8","unstructured":"S. Christensen and H. H\u00fcttel. Decidability Issues for Infinite State Processes \u2014 A Survey. Bull. of the EATCS, 51, 1993."},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"S. Christensen, H. H\u00fcttel, and C. Stirling. Bisimulation Equivalence is Decidable for all Context-Free Processes. Information and Computation, 121, 1995.","DOI":"10.1006\/inco.1995.1129"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"R.S. Cohen and A.Y. Gold. Theory of \u03a9-Languages. I: Characterizations of \u03a9-Context-Free Languages. J.C.S.S., 15, 1977.","DOI":"10.1016\/S0022-0000(77)80004-4"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"J. Esparza and A. Kiehn. On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes. In CAV'95. LNCS 939, 1995.","DOI":"10.1007\/3-540-60045-0_62"},{"key":"28_CR12","unstructured":"Javier Esparza. On the Decidability of Model-Checking for Several Mu-calculi and Petri Nets. In CAAP'94. LNCS 787, 1994."},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"R. Howell, L. Rosier, and H.C. Yen. A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets. T.C.S., 82, 1991.","DOI":"10.1016\/0304-3975(91)90228-T"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"P. Jancar. Decidability of a Temp. Logic Problem for Petri Nets. T.C.S., 74, 1990.","DOI":"10.1016\/0304-3975(90)90006-4"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"E. Mayr. An Algorithm for the General Petri Net Reachability Problem. SIAM J. on Comput., 13, 1984.","DOI":"10.1137\/0213029"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"A. Pnueli. The Temporal Logic of Programs. In FOCS'77. IEEE, 1977.","DOI":"10.1109\/SFCS.1977.32"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"W. Thomas. Star-Free Regular Sets of \u03a9-Sequences. Inform. and Cont., 42, 1979.","DOI":"10.1016\/S0019-9958(79)90629-6"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"R. Valk and M. Jantzen. The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets. Acta Informatica, 21, 1985.","DOI":"10.1007\/BF00289715"},{"key":"28_CR19","unstructured":"M.Y. Vardi and P. Wolper. An Automata-Theoretic Approach to Automatic Program Verification. In LICS'86. IEEE, 1986."}],"container-title":["Lecture Notes in Computer Science","CONCUR '96: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61604-7_71.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:33Z","timestamp":1605647313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61604-7_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616047","9783540706250"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-61604-7_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}