{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T11:33:38Z","timestamp":1790076818097,"version":"4.0.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319912677","type":"print"},{"value":"9783319912684","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-91268-4_12","type":"book-chapter","created":{"date-parts":[[2018,5,7]],"date-time":"2018-05-07T16:27:38Z","timestamp":1525710458000},"page":"227-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Pattern Matching in Link Streams: A Token-Based Approach"],"prefix":"10.1007","author":[{"given":"Cl\u00e9ment","family":"Bertrand","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hanna","family":"Klaudel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthieu","family":"Latapy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Peschanski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,5,8]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, J., Diao, Y., Gyllstrom, D., Immerman, N.: Efficient pattern matching over event streams. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 147\u2013160 (2008)","DOI":"10.1145\/1376616.1376634"},{"issue":"2","key":"12_CR2","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. Theor. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1145\/506147.506151","volume":"49","author":"E Asarin","year":"2002","unstructured":"Asarin, E., Caspi, P., Maler, O.: Timed regular expressions. J. ACM 49(2), 172\u2013206 (2002)","journal-title":"J. ACM"},{"issue":"6","key":"12_CR4","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1142\/S012905410300214X","volume":"14","author":"C C\u00e2mpeanu","year":"2003","unstructured":"C\u00e2mpeanu, C., Salomaa, K., Sheng, Y.: A formal study of practical regular expressions. Int. J. Found. Comput. Sci. 14(6), 1007\u20131018 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-00982-2_24","volume-title":"Language and Automata Theory and Applications","author":"B Carle","year":"2009","unstructured":"Carle, B., Narendran, P.: On extended regular expressions. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 279\u2013289. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00982-2_24"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Deharbe, A., Peschanski, F.: The omniscient garbage collector: a resource analysis framework. In: ACSD 2014. IEEE Computer Society (2014)","DOI":"10.1109\/ACSD.2014.18"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Deharbe, A., Peschanski, F.: The omniscient garbage collector: a resource analysis framework. Research report, LIP6 UPMC Sorbonne Universit\u00e9s, France (2014). https:\/\/hal.archives-ouvertes.fr\/hal-01626770","DOI":"10.1109\/ACSD.2014.18"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Fontugne, R., Borgnat, P., Abry, P., Fukuda, K.: MAWILab: combining diverse anomaly detectors for automated anomaly labeling and performance benchmarking. In: ACM CoNEXT 2010 (2010)","DOI":"10.1145\/1921168.1921179"},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0304-3975(92)90339-H","volume":"96","author":"VK Garg","year":"1992","unstructured":"Garg, V.K., Ragunath, M.T.: Concurrent regular expressions and their relationship to petri nets. Theor. Comput. Sci. 96(2), 285\u2013304 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theor. Comput. Sci. 134, 329\u2013363 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Latapy, M., Viard, T., Magnien, C.: Stream graphs and link streams for the modeling of interactions over time. CoRR, abs\/1710.04073 (2017)","DOI":"10.1007\/s13278-018-0537-7"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Paranjape, A., Benson, A.R., Leskovec, J.: Motifs in temporal networks. In: Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, WSDM 2017, pp. 601\u2013610. ACM (2017)","DOI":"10.1145\/3018661.3018731"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Tzevelekos, N.: Fresh-register automata. In: Proceedings of the 38th Annual ACM SIGPLAN-SIGACT, POPL 2011, pp. 295\u2013306. ACM (2011)","DOI":"10.1145\/1926385.1926420"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-319-10512-3_16","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"D Ulus","year":"2014","unstructured":"Ulus, D., Ferr\u00e8re, T., Asarin, E., Maler, O.: Timed pattern matching. In: Legay, A., Bozga, M. (eds.) FORMATS 2014. LNCS, vol. 8711, pp. 222\u2013236. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10512-3_16"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/978-3-662-49674-9_47","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Ulus","year":"2016","unstructured":"Ulus, D., Ferr\u00e8re, T., Asarin, E., Maler, O.: Online timed pattern matching using derivatives. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 736\u2013751. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_47"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Viard, T., Fournier-S\u2019niehotta, R., Magnien, C., Latapy, M.: Discovering patterns of interest in IP traffic using cliques in bipartite link streams. CoRR, abs\/1710.07107 (2017)","DOI":"10.1007\/978-3-319-73198-8_20"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-319-44878-7_8","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"M Waga","year":"2016","unstructured":"Waga, M., Akazaki, T., Hasuo, I.: A Boyer-Moore type algorithm for timed pattern matching. In: Fr\u00e4nzle, M., Markey, N. (eds.) FORMATS 2016. LNCS, vol. 9884, pp. 121\u2013139. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44878-7_8"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-319-65765-3_13","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"M Waga","year":"2017","unstructured":"Waga, M., Hasuo, I., Suenaga, K.: Efficient online timed pattern matching by automata-based skipping. In: Abate, A., Geeraerts, G. (eds.) FORMATS 2017. LNCS, vol. 10419, pp. 224\u2013243. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-65765-3_13"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, H., Diao, Y., Immerman, N.: On complexity and optimization of expensive queries in complex event processing (2014)","DOI":"10.1145\/2588555.2593671"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91268-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:28:19Z","timestamp":1710268099000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-91268-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319912677","9783319912684"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91268-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"8 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PETRI NETS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applications and Theory of Petri Nets and Concurrency","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"39","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/interes.institute\/petrinets2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}