{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:20:07Z","timestamp":1778300407794,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540664253","type":"print"},{"value":"9783540483205","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48320-9_30","type":"book-chapter","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T08:52:42Z","timestamp":1195116762000},"page":"431-446","source":"Crossref","is-referenced-by-count":41,"title":["Partial Order Reduction for Model Checking of Timed Automata"],"prefix":"10.1007","author":[{"given":"Marius","family":"Minea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,4,19]]},"reference":[{"key":"30_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/BFb0032042","volume-title":"Automata, Languages, and Programming","author":"R. Alur","year":"1990","unstructured":"R. Alur and D. Dill. Automata for modeling real-time systems. In Automata, Languages, and Programming. 17th Int. Colloquium Proc., LNCS v. 443, pp. 322\u201335, Coventry, UK, July 1990. Springer."},{"key":"30_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BFb0055643","volume-title":"CONCUR\u201998: Concurrency Theory","author":"J. Bengtsson","year":"1998","unstructured":"J. Bengtsson, B. Jonsson, J. Lilius, and Wang Yi. Partial order reductions for timed systems. In CONCUR\u201998: Concurrency Theory. 8th Int. Conf. Proc., LNCS v. 1466, pp. 485\u2013500, Nice, France, September 1998. Springer."},{"key":"30_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/BFb0028762","volume-title":"Computer Aided Verification","author":"W. Belluomini","year":"1998","unstructured":"W. Belluomini and C. J. Myers. Verification of timed systems using POSETs. In Computer Aided Verification. 10th Int. Conf., CAV\u201998. Proc., LNCS v. 1427, pp. 403\u201315, Vancouver, BC, Canada, June 1998. Springer."},{"key":"30_CR4","series-title":"Lect Notes Comput Sci","volume-title":"2nd Int. Conf., CAV\u201990. Proc.","author":"Computer Aided Verification","year":"1990","unstructured":"Computer Aided Verification. 2nd Int. Conf., CAV\u201990. Proc., LNCS v. 531, New Brunswick, NJ, USA, June 1990. Springer."},{"key":"30_CR5","series-title":"Lect Notes Comput Sci","first-page":"52","volume-title":"Logic of Programs: Workshop, Yorktown Heights, NY","author":"E. M. Clarke","year":"1981","unstructured":"E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. Logic of Programs: Workshop, Yorktown Heights, NY, LNCS v. 131, pp. 52\u201371. Springer, May 1981."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"D. Dams, R. Gerth, B. Knaack, and R. Kuiper. Partial-order reduction techniques for real-time model checking. In Proc. 3rd Int. Workshop on Formal Methods for Industrial Critical Systems, pp. 157\u201369, Amsterdam, The Netherlands, May 1998.","DOI":"10.1007\/s001650050028"},{"key":"30_CR7","series-title":"Lect Notes Comput Sci","first-page":"197","volume-title":"Proc. Int. Workshop Automatic Verification Methods for Finite State Systems","author":"D. L. Dill","year":"1989","unstructured":"D. L. Dill. Timing assumptions and verification of finite-state concurrent systems. Proc. Int. Workshop Automatic Verification Methods for Finite State Systems., LNCS v. 407, pp. 197\u2013212, Grenoble, June 1989. Springer."},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"P. Godefroid. Using partial orders to improve automatic verification methods. In [4], pp. 176\u201385.","DOI":"10.1007\/BFb0023731"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. In Proc. Seventh Ann. IEEE Symp. on Logic in Computer Science, pp. 394\u2013406, Santa Cruz, CA, USA, June 1992. IEEE Comp. Soc. Press.","DOI":"10.1109\/LICS.1992.185551"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"J. Lilius. Efficient state space search for time Petri nets. In Proc. MFCS\u201998 Workshop on Concurrency, Brno, Czech Republic, August 1998. Elsevier.","DOI":"10.1016\/S1571-0661(05)80254-3"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"K. G. Larsen, P. Pettersson, and Wang Yi. Compositional and symbolic modelcheking of real-time systems. In Proc. 16th IEEE Real-Time Systems Symp., pp. 76\u201387, Pisa, Italy, Dec. 1995. IEEE Comp. Soc. Press.","DOI":"10.1109\/REAL.1995.495198"},{"key":"30_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/3-540-61648-9_49","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"F. Pagani","year":"1996","unstructured":"F. Pagani. Partial orders and verification of real-time systems. In Formal Techniques in Real-Time and Fault-Tolerant Systems. 4th Int. Symp. Proc., LNCS v. 1135, pp. 327\u201346, Uppsala, September 1996. Springer."},{"key":"30_CR13","unstructured":"F. Pagani. Ordres partiels pour la v\u00e9rification de syst\u00e9mes temps r\u00e9el (Partial orders for verification of real-time systems). PhD thesis, Centre d\u2019\u00e9tudes et de Recherches de Toulouse, September 1997."},{"key":"30_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1993","unstructured":"D. Peled. All from one, one for all: on model checking using representatives. In Computer Aided Verification. 5th Int. Conf., CAV\u201993. Proc., LNCS v. 697, pp. 409\u201323, Elounda, Greece, June 1993. Springer."},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"A. Valmari. A stubborn attack on state explosion. In [4], pp. 156\u201365.","DOI":"10.1007\/BFb0023729"},{"key":"30_CR16","unstructured":"M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. Symp. on Logic in Computer Science, pp. 332\u201344, Cambridge, MA, USA, June 1986. IEEE Comp. Soc. Press."},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"H. Wong-Toi. Symbolic Approximations for Verifying Real-Time Systems. PhD thesis, Stanford University, December 1994.","DOI":"10.1142\/9789812831583_0007"},{"issue":"2","key":"30_CR18","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):197\u2013215, August 1997.","journal-title":"Formal Methods in System Design"}],"container-title":["Lecture Notes in Computer Science","CONCUR\u201999 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48320-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T09:06:28Z","timestamp":1556960788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48320-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664253","9783540483205"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48320-9_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}