{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:10:29Z","timestamp":1725495029883},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422525"},{"type":"electronic","value":"9783540457404"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45740-2_19","type":"book-chapter","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T15:30:51Z","timestamp":1195140651000},"page":"323-342","source":"Crossref","is-referenced-by-count":14,"title":["Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Penczek","sequence":"first","affiliation":[]},{"given":"Agata","family":"P\u00f3\u0142rola","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,28]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"R. Alur, C. Courcoubetis, and D. Dill, Model Checking for Real-Time Systems, Proc. of LICS\u201990, IEEE, 1990, pp. 414\u2013425.","DOI":"10.1109\/LICS.1990.113766"},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"R. Alur and D. Dill, Automata for Modelling Real-Time Systems, Theoretical Computer Science 126(2) (1994), 183\u2013236.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/227595.227602","volume":"43","author":"R. Alur","year":"1996","unstructured":"R. Alur, T. Feder, and T. Henzinger, The Benefits of Relaxing Punctuality, Journal of ACM 43(1) (1996), 116\u2013146.","journal-title":"Journal of ACM"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"A. Biere, A. Cimatti, E. Clarke, and Y. Zhu, Symbolic Model Checking without BDDs, Proc. of DAT\u201999, 1999.","DOI":"10.21236\/ADA360973"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0304-3975(88)90098-9","volume":"59","author":"M.C. Browne","year":"1988","unstructured":"M.C. Browne, E.M. Clarke, and O. Grumberg, Characterizing Finite Kripke Structures in Propositional Temporal Logic, Theoretical Computer Science 59 (1988), 115\u2013131.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"19_CR6","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1109\/32.75415","volume":"17","author":"B. Berthomieu","year":"1991","unstructured":"B. Berthomieu and M. Diaz, Modelling and Verification of Time Dependent Systems Using Time Petre Nets, IEEE Trans. on Software Eng. 17(3) (1991), 259\u2013273.","journal-title":"IEEE Trans. on Software Eng."},{"key":"19_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BFb0055643","volume-title":"Partial Order Reductions for Timed Systems","author":"B.J.L.W.9.8.J. Bengtsson","year":"1998","unstructured":"[BJLW98]J. Bengtsson, B. Jonsson, J. Lilius, and Y. Wang, Partial Order Reductions for Timed Systems, LNCS 1466 (1998), 485\u2013500."},{"issue":"8","key":"19_CR8","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R. Bryant","year":"1986","unstructured":"R. Bryant, Graph-based Algorithms for Boolean Function Manipulation, IEEE Transaction on Computers 35(8) (1986), 677\u2013691.","journal-title":"IEEE Transaction on Computers"},{"key":"19_CR9","unstructured":"D. Dams, O. Grumberg, and R. Gerth, Abstract Interpretation of Reactive Systems: Abstractions Preserving ACTL*, ECTL* and CTL*, Proceedings of the IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET), North-Holland, 1994."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"D. Dams, R. Gerth, B. Knaack, and R. Kuiper, Partial-Order Reduction Techniques for Real-Time Model Checking, Proc. of 3rd Int. Workshop on Formal Methods for Industrial Critical Systems, 1998, pp. 157\u2013169.","DOI":"10.1007\/s001650050028"},{"key":"19_CR11","series-title":"Lect Notes Comput Sci","first-page":"197","volume-title":"Timing Assumptions and Verification of Finite State Concurrent Systems","author":"D. Dill","year":"1989","unstructured":"D. Dill, Timing Assumptions and Verification of Finite State Concurrent Systems, LNCS 407 (1989), 197\u2013212."},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF00625970","volume":"7","author":"A. Emerson","year":"1996","unstructured":"A. Emerson and A.P. Sistla, Symmetry and Model Checking, Formal Methods in SystemDesign 7 (1996), 105\u2013131.","journal-title":"Formal Methods in SystemDesign"},{"key":"19_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/BFb0084794","volume-title":"Propositional Temporal Logics and Equivalences","author":"U. Goltz","year":"1992","unstructured":"U. Goltz, R. Kuiper, and W. Penczek, Propositional Temporal Logics and Equivalences, LNCS 630 (1992), 222\u2013236."},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/inco.1998.2778","volume":"150","author":"R. Gerth","year":"1999","unstructured":"R. Gerth, R. Kuiper, D. Peled, and W. Penczek, A Partial Order Reductions to Branching Time Logic Model Checking, Information and Computation 150 (1999), 132\u2013152.","journal-title":"Information and Computation"},{"key":"19_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/3-540-54430-5_93","volume-title":"Model Checking and Modular Verification","author":"O. Grumberg","year":"1991","unstructured":"O. Grumberg and D.E. Long, Model Checking and Modular Verification, LNCS 527 (1991), 250\u2013265."},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"G.J. Holzmann and D. Peled, An Improvement in Formal Verification, Proc. of FORTE\u201994, Formal Description Techniques, Chapman and Hall, 1994, pp. 197\u2013211.","DOI":"10.1007\/978-0-387-34878-0_13"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"J. Lilius, Efficient State Space Search for Time Petri Nets, Proc. MFCS\u201998 Workshop on Concurrency, ENTCS, vol. 18, Springer-Verlag, 1999, p. 21.","DOI":"10.1016\/S1571-0661(05)80254-3"},{"key":"19_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/3-540-48320-9_30","volume-title":"Partial Order Reductions for Model Checking of Timed Automata","author":"M. Minea","year":"1999","unstructured":"M. Minea, Partial Order Reductions for Model Checking of Timed Automata, LNCS 1664 (1999), 431\u2013446."},{"key":"19_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/3-540-61648-9_49","volume-title":"Partial Orders and Verification of Real Time Systems","author":"F. Pagani","year":"1996","unstructured":"F. Pagani, Partial Orders and Verification of Real Time Systems, LNCS 1135 (1996), 327\u2013346."},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"D. Peled, Partial Order Reduction: Linear and Branching Temporal Logics and Process Algebras, POMIV\u201996, Partial Order Methods in Verification, American Mathematical Society, DIMACS, 1996, pp. 79\u201388.","DOI":"10.1090\/dimacs\/029\/13"},{"key":"19_CR21","unstructured":"A. P\u00f3\u0142rola, Generation of Reduced Abstract State Spaces for Time Petri Nets, Report ICS PAS (2001), to appear."},{"key":"19_CR22","doi-asserted-by":"crossref","first-page":"245","DOI":"10.3233\/FI-2000-43123413","volume":"43","author":"W. Penczek","year":"2000","unstructured":"W. Penczek, M. Szreter, R. Gerth, and R. Kuiper, Improving Partial Order Reductions for Branching Time Properties, Fundamenta Informaticae 43 (2000), 245\u2013267.","journal-title":"Fundamenta Informaticae"},{"key":"19_CR23","unstructured":"Ch. Rouff, teditor, Proc. of Formal Approaches to Agent-Based Systems, Springer-Verlag, 2001, to appear."},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"P. Starke, Analyse von Petri-Netz-Modellen, Teubner Verlag, 1990.","DOI":"10.1007\/978-3-663-09262-9"},{"key":"19_CR25","series-title":"Lect Notes Comput Sci","first-page":"491","volume-title":"Proc. of the 10th International Conference on Application and Theory of Petri Nets","author":"A. Valmari","year":"1989","unstructured":"A. Valmari, Stubborn Sets for Reduced State Space Generation, Proc. of the 10th International Conference on Application and Theory of Petri Nets, LNCS, vol. 483, Springer-Verlag, 1989, pp. 491\u2013515."},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"A. Valmari, Stubborn Set Methods for Process Algebras, Proc. POMIV\u201996, Partial Order Methods in Verification, Americal Mathematical Society, 1996, pp. 213\u2013222.","DOI":"10.1090\/dimacs\/029\/12"},{"key":"19_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/3-540-48321-7_46","volume-title":"A Partial Order Method for the Verification of Time Petri Nets","author":"I.B. Virbitskaite","year":"1999","unstructured":"I.B. Virbitskaite and E.A. Pokozy, A Partial Order Method for the Verification of Time Petri Nets, LNCS 1684 (1999), 547\u2013558."},{"key":"19_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/3-540-57208-2_17","volume-title":"Partial-Order Methods for Temporal Verification","author":"P. Wolper","year":"1993","unstructured":"P. Wolper and P. Godefroid, Partial-Order Methods for Temporal Verification, LNCS 715 (1993), 233\u2013246."},{"key":"19_CR29","first-page":"1","volume":"3","author":"T. Yoneda","year":"1998","unstructured":"T. Yoneda and H. Ryuba, CTL Model Checking of Time Petri Nets Using Geometric Regions, IEICE Trans. Inf. and Syst. 3 (1998), 1\u201310.","journal-title":"IEICE Trans. Inf. and Syst."},{"issue":"2","key":"19_CR30","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1023\/A:1008682131325","volume":"11","author":"T. Yoneda","year":"1997","unstructured":"T. Yoneda and B.H. Schlingloff, Efficient Verification of Parallel Real-Time Systems, Formal Methods in System Design 11(2) (1997), 197\u2013215.","journal-title":"Formal Methods in System Design"}],"container-title":["Lecture Notes in Computer Science","Applications and Theory of Petri Nets 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45740-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T20:59:32Z","timestamp":1630097972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45740-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422525","9783540457404"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-45740-2_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}