{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:50:32Z","timestamp":1740124232494,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T00:00:00Z","timestamp":1498608000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672340, 61472238, and 61472240"],"award-info":[{"award-number":["61672340, 61472238, and 61472240"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Software Qual J"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s11219-017-9380-8","type":"journal-article","created":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T02:45:28Z","timestamp":1498617928000},"page":"961-989","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Asynchronous multi-process timed automata"],"prefix":"10.1007","volume":"26","author":[{"given":"Guoqiang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Fukuda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,28]]},"reference":[{"key":"9380_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., & Tsay, Y.-K. (1996). General decidability theorems for infinite-state systems. In Proceedings of the 11th symposium on logic in computer science, (LICS\u201996), (pp. 313\u2013321). IEEE Society.","DOI":"10.1109\/LICS.1996.561359"},{"issue":"1\u20132","key":"9380_CR2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0304-3975(00)00105-5","volume":"256","author":"PA Abdulla","year":"2001","unstructured":"Abdulla, P.A., & Jonsson, B. (2001). Ensuring completeness of symbolic verification methods for infinite-state systems. Theoretical Computer Science, 256(1\u20132), 145\u2013167.","journal-title":"Theoretical Computer Science"},{"key":"9380_CR3","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., & Nyl\u00e9n, A. (2001). Timed petri nets and BQOs. In Proceedings of the 22nd international conference on application and theory of petri nets (ICATPN\u201901), (pp. 53\u201370). Springer.","DOI":"10.1007\/3-540-45740-2_5"},{"issue":"4","key":"9380_CR4","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1145\/1075382.1075387","volume":"27","author":"R Alur","year":"2005","unstructured":"Alur, R., Benedikt, M., Etessami, K., Godefroid, P., Reps, T.W., & Yannakakis, M. (2005). Analysis of recursive state machines. ACM Transactions on Programming Languages and Systems (TOPLAS), 27(4), 786\u2013818.","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"issue":"2","key":"9380_CR5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., & Dill, D.L. (1994). A Theory of timed automata. Theoretical Computer Science, 126(2), 183\u2013235.","journal-title":"Theoretical Computer Science"},{"key":"9380_CR6","doi-asserted-by":"crossref","unstructured":"Behrmann, G., David, A., & Larsen, K.G. (2004). A tutorial on UPPAAL. In Proceedings of the international school on formal methods for the design of computer, communication and software systems (SFM-RT\u201904), (pp. 200\u2013236). Springer.","DOI":"10.1007\/978-3-540-30080-9_7"},{"key":"9380_CR7","doi-asserted-by":"crossref","unstructured":"Benerecetti, M., Minopoli, S., & Peron, A. (2010). Analysis of timed recursive state machines. In Proceedings of the 17th international symposium on temporal representation and reasoning (TIME\u201910), (pp. 61\u201368). IEEE Computer Society.","DOI":"10.1109\/TIME.2010.10"},{"key":"9380_CR8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.tcs.2016.02.021","volume":"625","author":"M Benerecetti","year":"2016","unstructured":"Benerecetti, M., & Peron, A. (2016). Timed recursive state machines: timed recursive state expressiveness and complexity. Theoretical Computer Science, 625, 85\u2013124.","journal-title":"Theoretical Computer Science"},{"key":"9380_CR9","unstructured":"Bengtsson, J., & Yi, W. (2003). Timed automata: semantics, algorithms and tools. In Proceedings of the lectures on concurrency and petri nets (LCPN\u201903), (pp. 87\u2013124). Springer."},{"key":"9380_CR10","doi-asserted-by":"crossref","unstructured":"B\u00e9rard, B., Cassez, F., Haddad, S., Lime, D.x, & Roux, O.H. (2005). Comparison of the expressiveness of timed automata and time petri nets. In Proceedings of the 3rd international conference on formal modeling and analysis of timed systems (FORMATS\u201905), (pp. 211\u2013225). Springer.","DOI":"10.1007\/11603009_17"},{"issue":"1","key":"9380_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10703-011-0140-2","volume":"40","author":"B B\u00e9rard","year":"2012","unstructured":"B\u00e9rard, B., Haddad, S., & Sassolas, M. (2012). Interrupt timed automata: verification and expressiveness. Formations Methods of System Design, 40(1), 41\u201387.","journal-title":"Formations Methods of System Design"},{"issue":"3","key":"9380_CR12","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1109\/32.75415","volume":"17","author":"B Berthomieu","year":"1991","unstructured":"Berthomieu, B., & Diaz, M. (1991). Modeling and verification of time dependent systems using time petri nets. IEEE Transactions on Software Engineering, 17(3), 259\u2013273.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"9380_CR13","unstructured":"Berthomieu, B., & Menasche, M. (1983). An enumerative approach for analyzing time petri nets. In Proceedings of the 9th world computer congress (IFIP\u201983), (pp. 41\u201346). IEEE."},{"issue":"1","key":"9380_CR14","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ic.2007.10.004","volume":"206","author":"P Bouyer","year":"2008","unstructured":"Bouyer, P., Haddad, S., & Reynier, P.-A. (2008). Timed petri nets and timed automata: on the discriminating power of Zeno sequences. Information and Computation, 206(1), 73\u2013107.","journal-title":"Information and Computation"},{"key":"9380_CR15","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Reynier, P.-A., & Haddad, S. (2006). Extended timed automata and time petri nets. In Proceedings of the 6th international conference on application of concurrency to system design (ACSD\u201906), (pp. 91\u2013100). IEEE Society.","DOI":"10.1109\/ACSD.2006.6"},{"key":"9380_CR16","doi-asserted-by":"crossref","unstructured":"Byg, J., J\u00f8rgensen, K.Y., & Srba, J. (2009). An efficient translation of timed-arc petri nets to networks of timed automata. In Proceedings of the 11th international conference on formal engineering methods (ICFEM\u201909), (pp. 698\u2013716). Springer.","DOI":"10.1007\/978-3-642-10373-5_36"},{"issue":"10","key":"9380_CR17","doi-asserted-by":"crossref","first-page":"1456","DOI":"10.1016\/j.jss.2005.12.021","volume":"79","author":"F Cassez","year":"2006","unstructured":"Cassez, F., & Roux, O.H. (2006). Structural translation from time petri nets to timed automata. Journal of Systems and Software, 79(10), 1456\u20131468.","journal-title":"Journal of Systems and Software"},{"issue":"1","key":"9380_CR18","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3233\/FI-1997-3112","volume":"31","author":"J Esparza","year":"1997","unstructured":"Esparza, J. (1997). Petri nets, commutative context-free grammars, and basic parallel processes. Fundamenta Informaticae, 31(1), 13\u201325.","journal-title":"Fundamenta Informaticae"},{"key":"9380_CR19","doi-asserted-by":"crossref","unstructured":"Fang, B., Li, G., Sun, D, & Cai, H. (2016). Schedulability analysis of timed regular tasks by under-approximation on wcet. In Proceedings of the 2nd international symposium on dependable software engineering, theories, tools, and applications (SETTA\u201916), (pp. 147\u2013162). Springer.","DOI":"10.1007\/978-3-319-47677-3_10"},{"issue":"8","key":"9380_CR20","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1016\/j.ic.2007.01.009","volume":"205","author":"E Fersman","year":"2007","unstructured":"Fersman, E., Krc\u00e1l, P., Pettersson, P., & Yi, W. (2007). Task automata: schedulability, decidability and undecidability. Information and Computation, 205(8), 1149\u20131172.","journal-title":"Information and Computation"},{"key":"9380_CR21","doi-asserted-by":"crossref","unstructured":"Fersman, E., Pettersson, P., & Yi, W. (2002). Timed automata with asynchronous processes: Schedulability and decidability. In Proceedings of the 8th international conference on tools and algorithms for the construction and analysis of systems (TACAS\u201902), (pp. 67\u201382). Springer.","DOI":"10.1007\/3-540-46002-0_6"},{"key":"9380_CR22","doi-asserted-by":"crossref","unstructured":"Guan, N., Tang, Y, Abdullah, J., Stigge, M., & Yi, W. (2015). Scalable timing analysis with refinement. In Proceedings of the 21st international conference on tools and algorithms for the construction and analysis of systems (TACAS\u201915), (pp. 3\u201318). Springer.","DOI":"10.1007\/978-3-662-46681-0_1"},{"issue":"2","key":"9380_CR23","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"J Hopcroft","year":"1979","unstructured":"Hopcroft, J., & Pansiot, J.-J. (1979). On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science, 8(2), 135\u2013159.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"9380_CR24","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"RM Karp","year":"1969","unstructured":"Karp, R.M., & Miller, R.E. (1969). Parallel program schemata. Journal of Computer and System Sciences, 3(2), 147\u2013195.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1-2","key":"9380_CR25","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/s100090050010","volume":"1","author":"KG Larsen","year":"1997","unstructured":"Larsen, K.G., Pettersson, P., & Yi, W. (1997). UPPAAL in a nutshell. STTT, 1(1-2), 134\u2013152.","journal-title":"STTT"},{"key":"9380_CR26","doi-asserted-by":"crossref","unstructured":"Li, G., Cai, X., Ogawa, M., & Yuen, S. (2013). Nested timed automata. In Proceedings of the 11th international conference on formal modeling and analysis of timed systems (FORMATS\u201913), (pp. 168\u2013182). Springer.","DOI":"10.1007\/978-3-642-40229-6_12"},{"key":"9380_CR27","doi-asserted-by":"crossref","unstructured":"Li, G., Ogawa, M., & Yuen, S. (2015). Nested timed automata with frozen clocks. In Proceedings of the 13th international conference on formal modeling and analysis of timed systems (FORMATS\u201915), volume 9268 of lecture notes in computer science, (pp. 189\u2013205). Springer.","DOI":"10.1007\/978-3-319-22975-1_13"},{"key":"9380_CR28","doi-asserted-by":"crossref","unstructured":"Norstr\u00f6m, C., Wall, A., & Yi, W. (1999). Timed automata as task models for event-driven systems. In Proceedings of the 6th international workshop on real-time computing and applications symposium (RTCSA\u201999), (pp. 182\u2013189). IEEE Society.","DOI":"10.1109\/RTCSA.1999.811218"},{"key":"9380_CR29","unstructured":"Ruiz, V.V., De Frutos-Escrig, D., & Gomez, F.C. (1999). On nondecidability of reachability for timed-arc petri nets. In Proceedings of the 8th international workshop on petri nets and performance models (PNPM\u201999), (pp. 188\u2013196). IEEE Society."},{"key":"9380_CR30","doi-asserted-by":"crossref","unstructured":"Sen, K., & Viswanathan, M. (2006). Model checking multithreaded programs with asynchronous atomic methods. In Proceedings of the 18th international conference on computer aided verification (CAV\u201906), (pp. 300\u2013314). Springer.","DOI":"10.1007\/11817963_29"},{"key":"9380_CR31","unstructured":"Srba, J. (2005). Timed-arc petri nets vs. networks of timed automata. In Proceedings of the 26th international conference on applications and theory of petri nets (ICATPN\u201905), (pp. 385\u2013402). Springer."},{"key":"9380_CR32","doi-asserted-by":"crossref","unstructured":"Trivedi, A., & Wojtczak, D. (2010). Recursive timed automata. In Proceedings of the 8th international symposium on automated technology for verification and analysis (ATVA\u201910), volume 6252 of lecture notes in computer science, (pp. 306\u2013324). Springer.","DOI":"10.1007\/978-3-642-15643-4_23"}],"container-title":["Software Quality Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11219-017-9380-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11219-017-9380-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11219-017-9380-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T01:02:29Z","timestamp":1602378149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11219-017-9380-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,28]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["9380"],"URL":"https:\/\/doi.org\/10.1007\/s11219-017-9380-8","relation":{},"ISSN":["0963-9314","1573-1367"],"issn-type":[{"type":"print","value":"0963-9314"},{"type":"electronic","value":"1573-1367"}],"subject":[],"published":{"date-parts":[[2017,6,28]]}}}