{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:12:51Z","timestamp":1725484371837},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441656"},{"type":"electronic","value":"9783540457398"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45739-9_12","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T22:42:01Z","timestamp":1179268921000},"page":"165-183","source":"Crossref","is-referenced-by-count":1,"title":["Decidability of Safety Properties of Timed Multiset Rewriting"],"prefix":"10.1007","author":[{"given":"Mitsuharu","family":"Yamamoto","sequence":"first","affiliation":[]},{"given":"Jean-Marie","family":"Cottin","sequence":"additional","affiliation":[]},{"given":"Masami","family":"Hagiya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96 (1992) 73\u2013155","journal-title":"Theoretical Computer Science"},{"key":"12_CR2","unstructured":"Cervesato, I., Durgin, N.A., Lincoln, P., Mitchell, J.C., Scedrov, A.: A meta-notation for protocol analysis. In: IEEE CSFW. (1999) 55\u201369"},{"key":"12_CR3","unstructured":"Kosiuczenko, P., Wirsing, M.: Timed rewriting logic for the specification of time-sensitive systems. In Schwichtenberg, H., ed.: Proceedings of the Internat. Summer School on Proof and Computation. (1995)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"\u00d6lveczky, P.C., Meseguer, J.: Specifying real-time systems in rewriting logic. In: Electronic Notes in Theoretical Computer Science. Volume 4. (1996)","DOI":"10.1016\/S1571-0661(04)00044-1"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Kanovich, M., Okada, M., Scedrov, A.: Specifying real-time finite-state systems in linear logic (1998)","DOI":"10.1016\/S1571-0661(05)80591-2"},{"key":"12_CR6","unstructured":"Hagiya, M., Yamamoto, M., Cottin, J.M.: Symbolic analysis of timed multiset rewriting and its application to protocol analysis (extended abstract). In: Rewriting in Proof and Computation, International Workshop, RPC\u201901, The Research Institute of Electrical Communication (RIEC), Tohoku University (2001) 34\u201341"},{"key":"12_CR7","unstructured":"Bozzano, M., Delzanno, G., Martelli, M.: An effective bottom-up semantics for first-order linear logic programs. In: FLOPS. (2001) 138\u2013152"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(98)00008-5","volume":"216","author":"A. Cerone","year":"1999","unstructured":"Cerone, A., Maggiolo-Schettini, A.: Time-based expressivity of time Petri nets for system specification. Theoretical Computer Science 216 (1999) 1\u201353","journal-title":"Theoretical Computer Science"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126 (1994) 183\u2013236","journal-title":"Theoretical Computer Science"},{"key":"12_CR10","unstructured":"Henzinger, T.: The theory of hybrid automata. In: Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (LICS\u2019 96), New Brunswick, New Jersey (1996) 278\u2013292"},{"key":"12_CR11","unstructured":"Ruiz, V.V., Gomez, F.C., de Frutos Escrig, D.: On non-decidability of reachability for timed-arc Petri nets. In: Proc. 8th Int. Workshop on Petri Net and Performance Models (PNPM\u201999), 8-10 October 1999, Zaragoza, Spain. (1999) 188\u2013196"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"de Frutos Escrig, D., Ruiz, V.V., Alonso, O.M.: Decidability of properties of timed-arc Petri nets. In Nielsen, M., Simpson, D., eds.: Lecture Notes in Computer Science: 21st International Conference on Application and Theory of Petri Nets (ICATPN 2000), Aarhus, Denmark, June 2000. Volume 1825., Springer-Verlag (2000) 187\u2013206","DOI":"10.1007\/3-540-44988-4_12"},{"key":"12_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-45740-2_5","volume-title":"Proc. ICATPN\u20192001, 22nd Int. Conf. on application and theory of Petri nets","author":"P.A. Abdulla","year":"2001","unstructured":"Abdulla, P.A., Nyl\u00e9n, A.: Timed Petri nets and BQOs. In: Proc. ICATPN\u20192001, 22nd Int. Conf. on application and theory of Petri nets. Volume 2075 of LNCS. (2001) 53\u201370"},{"key":"12_CR14","first-page":"394","volume-title":"7th. Symposium of Logics in Computer Science","author":"T.A. Henzinger","year":"1992","unstructured":"T.A. Henzinger, X. Nicollin, J. Sifakis, S. Yovine: Symbolic Model Checking for Real-Time Systems. In: 7th. Symposium of Logics in Computer Science, Santa-Cruz, California, IEEE Computer Scienty Press (1992) 394\u2013406"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/s100090050007","volume":"1","author":"R. Alur","year":"1997","unstructured":"Alur, R., Henzinger, T.A.: Real-time system = discrete system + clock variables. International Journal on Software Tools for Technology Transfer 1 (1997) 86\u2013109","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Jonsson, B.: Verifying networks of timed processes. Lecture Notes in Computer Science 1384 (1998) 298\u2013312","DOI":"10.1007\/BFb0054179"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere ! Theoretical Computer Science 256 (2001) 64\u201392","journal-title":"Theoretical Computer Science"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/10722167_35","volume":"1855","author":"P. Bouyer","year":"2000","unstructured":"Bouyer, P., Dufourd, C., Fleury, E., Petit, A.: Are timed automata updatable ? In: Proc. 12th Int. Conf. Computer Aided Verification (CAV\u20192000), Chicago, IL, USA, July 2000. Volume 1855., Springer (2000) 464\u2013479","journal-title":"Proc. 12th Int. Conf. Computer Aided Verification (CAV\u20192000)"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques in Real-Time and Fault-Tolerant Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45739-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:54:28Z","timestamp":1556398468000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45739-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441656","9783540457398"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45739-9_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}