{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:13:13Z","timestamp":1762459993115,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030789459"},{"type":"electronic","value":"9783030789466"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-78946-6_12","type":"book-chapter","created":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T06:02:53Z","timestamp":1623909773000},"page":"221-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Interval Probabilistic Timed Graph Transformation Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9275-806X","authenticated-orcid":false,"given":"Maria","family":"Maximova","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9828-618X","authenticated-orcid":false,"given":"Sven","family":"Schneider","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4723-730X","authenticated-orcid":false,"given":"Holger","family":"Giese","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"issue":"2","key":"12_CR1","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). https:\/\/doi.org\/10.1016\/0304-3975(94)90010-8","journal-title":"Theor. Comput. Sci."},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Becker, B., Giese, H.: On safe service-oriented real-time coordination for autonomous vehicles. In: 11th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2008), Orlando, Florida, USA, 5\u20137 May 2008, pp. 203\u2013210. IEEE Computer Society (2008). https:\/\/doi.org\/10.1109\/ISORC.2008.13, http:\/\/ieeexplore.ieee.org\/xpl\/mostRecentIssue.jsp?punumber=4519543, ISBN 978-0-7695-3132-8","DOI":"10.1109\/ISORC.2008.13"},{"key":"12_CR3","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31188-2","volume-title":"Fundamentals of Algebraic Graph Transformation","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. MTCSAES, Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-31188-2"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Krause , C., Giese, H.: Model checking probabilistic real-time properties for service-oriented systems with service level agreements. In: Yu, F., Wang, C. (eds.) Proceedings 13th International Workshop on Verification of Infinite-State Systems, INFINITY 2011, 10th October 2011, Taipei, Taiwan. EPTCS, vol. 73, pp. 64\u201378 (2011)https:\/\/doi.org\/10.4204\/EPTCS.73.8","DOI":"10.4204\/EPTCS.73.8"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-33654-6_21","volume-title":"Graph Transformations","author":"C Krause","year":"2012","unstructured":"Krause, C., Giese, H.: Probabilistic graph transformation systems. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2012. LNCS, vol. 7562, pp. 311\u2013325. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33654-6_21"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-22110-1_47","volume-title":"Computer Aided Verification","author":"M Kwiatkowska","year":"2011","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585\u2013591. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_47"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0304-3975(01)00046-9","volume":"282","author":"MZ Kwiatkowska","year":"2002","unstructured":"Kwiatkowska, M.Z., Norman, G., Segala, R., Sproston, J.: Automatic verification of real-time systems with discrete probability distributions. Theor. Comput. Sci. 282(1), 101\u2013150 (2002). https:\/\/doi.org\/10.1016\/S0304-3975(01)00046-9","journal-title":"Theor. Comput. Sci."},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Maximova, M., Giese, H., Krause, C.: Probabilistic timed graph transformation systems. J. Log. Algebr. Meth. Program. 101(2018), 110\u2013131 (2018). https:\/\/doi.org\/10.1016\/j.jlamp.2018.09.003","DOI":"10.1016\/j.jlamp.2018.09.003"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Maximova, M., Schneider, S., Giese, H.: Interval Probabilistic Timed Graph Transformation Systems. Technical report 134. Hasso Plattner Institute at the University of Potsdam (2021)","DOI":"10.26226\/morressier.604907f41a80aac83ca25d04"},{"key":"12_CR10","unstructured":"Neumann, S.: Modellierung und Verifikation zeitbehafteter Graph transformations systeme mittels Groove. MA thesis. University of Paderborn (2007)"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.jsc.2010.09.009","volume":"46","author":"F Orejas","year":"2011","unstructured":"Orejas, F.: Symbolic graphs for attributed graph constraints. J. Symb. Comput. 46(3), 294\u2013315 (2011). https:\/\/doi.org\/10.1016\/j.jsc.2010.09.009","journal-title":"J. Symb. Comput."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Schneider, S., Maximova, M., Sakizloglou, L., Giese, H.: Formal testing of timed graph transformation systems using metric temporal graph logic. In: Int. J. Softw. Tools Technol. Transf (2020, accepted)","DOI":"10.1007\/s10009-020-00585-w"},{"key":"12_CR13","unstructured":"Segala, R.: Modeling and verification of randomized distributed real-time systems. PhD thesis. Massachusetts Institute of Technology, Cambridge, MA, USA (1995). http:\/\/hdl.handle.net\/1721.1\/36560"},{"key":"12_CR14","unstructured":"UPPAAL. Department of Information Technology at Uppsala University, Sweden and Department of Computer Science at Aalborg University, Denmark (2021). https:\/\/uppaal.org\/"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Zhang, J., Zhao, J., Huang, Z., Cao, Z.: Model checking interval probabilistic timed automata. In: 2009 First International Conference on Information Science and Engineering, pp. 4936\u20134940 (2009). https:\/\/doi.org\/10.1109\/ICISE.2009.749","DOI":"10.1109\/ICISE.2009.749"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78946-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T12:39:17Z","timestamp":1672490357000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78946-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030789459","9783030789466"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78946-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"18 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Graph Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In addition, the proceedings contain 2 tool papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}