{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:52:45Z","timestamp":1725598365878},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226151"},{"type":"electronic","value":"9783642226168"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22616-8_36","type":"book-chapter","created":{"date-parts":[[2011,7,29]],"date-time":"2011-07-29T21:25:42Z","timestamp":1311974742000},"page":"464-479","source":"Crossref","is-referenced-by-count":1,"title":["A Semantic Model for Many-Core Parallel Computing"],"prefix":"10.1007","author":[{"given":"Nan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenhua","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0747-7171(89)80070-7","volume":"8","author":"M. Abadi","year":"1989","unstructured":"Abadi, M., Manna, Z.: Temporal Logic Programming. Journal of Symbolic Computation\u00a08, 277\u2013295 (1989)","journal-title":"Journal of Symbolic Computation"},{"key":"36_CR2","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, London (1985)"},{"key":"36_CR3","series-title":"LNCS","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems.","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"36_CR4","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, London (1989)"},{"key":"36_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/3-540-58216-9_48","volume-title":"Logic Programming and Automated Reasoning","author":"Z. Duan","year":"1994","unstructured":"Duan, Z., Koutny, M., Holt, C.: Projection in Temporal Logic Programming. In: Pfenning, F. (ed.) LPAR 1994. LNCS (LNAI), vol.\u00a0822, pp. 333\u2013334. Springer, Heidelberg (1994)"},{"key":"36_CR6","volume-title":"Temporal Logic and Temporal Logic Programming","author":"Z. Duan","year":"2005","unstructured":"Duan, Z.: Temporal Logic and Temporal Logic Programming. Science Press, Beijing (2005)"},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.scico.2007.09.001","volume":"70","author":"Z. Duan","year":"2008","unstructured":"Duan, Z., Yang, X., Koutny, M.: Frammed Temporal Logic Programming. Science of Computer Programming\u00a070, 31\u201361 (2008)","journal-title":"Science of Computer Programming"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1145\/177492.177726","volume":"16","author":"L. Lamport","year":"1994","unstructured":"Lamport, L.: The temporal logic of actions. ACM Trans. Program. Lang. Syst.\u00a016, 872\u2013923 (1994)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s10009-007-0038-x","volume":"9","author":"K. Jensen","year":"2007","unstructured":"Jensen, K., Kristensen, L.M., Wells, L.: Coloured Petri Nets and CPN Tools for Modelling and Validation of Concurrent Systems. International Journal on Software Tools for Technology Transfer\u00a09, 213\u2013254 (2007)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-53863-1_31","volume-title":"Advances in Petri Nets 1990","author":"K. Jensen","year":"1991","unstructured":"Jensen, K.: Coloured Petri Nets: A High Level Language for System Design and Analysis. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol.\u00a0483, pp. 342\u2013416. Springer, Heidelberg (1991)"},{"key":"36_CR11","first-page":"1","volume":"19","author":"M. Koutney","year":"2009","unstructured":"Koutney, M., Pietkiewicz-Koutney, M.: Synthesis of Petri Nets with Localities. Sci. Ann. Comp. Sci.\u00a019, 1\u201323 (2009)","journal-title":"Sci. Ann. Comp. Sci."},{"key":"36_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/3-540-44988-4_18","volume-title":"Application and Theory of Petri Nets 2000","author":"M. Koutny","year":"2000","unstructured":"Koutny, M.: A compositional model of time petri nets. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol.\u00a01825, pp. 303\u2013322. Springer, Heidelberg (2000)"},{"key":"36_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/3-540-44919-1_31","volume-title":"Applications and Theory of Petri Nets 2003","author":"J. Billington","year":"2003","unstructured":"Billington, J., Christensen, S., Hee, K., Kindler, E., Kummer, O., Petrucci, L., Post, R., Stehno, C., Weber, M.: The petri net markup language: Concepts, technology, and tools. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol.\u00a02679, pp. 483\u2013505. Springer, Heidelberg (2003)"},{"key":"36_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/3-540-16492-8_119","volume-title":"Third International Conference on Logic Programming","author":"M. Fujita","year":"1986","unstructured":"Fujita, M., Kono, S., Tanaka, H., Moto-oka, T.: Tokio: Logic Programming Language Based on Temporal Logic and its Compilation to PROLOG. In: Shapiro, E. (ed.) ICLP 1986. LNCS, vol.\u00a0225, pp. 695\u2013709. Springer, Heidelberg (1986)"},{"key":"36_CR15","series-title":"Temporal Logics and their Applications","first-page":"197","volume-title":"Modal and Temporal Logic Programming.","author":"D.M. Gabbay","year":"1987","unstructured":"Gabbay, D.M.: Modal and Temporal Logic Programming. Temporal Logics and their Applications, pp. 197\u2013237. Academic Press, London (1987)"},{"issue":"7","key":"36_CR16","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"R.M. Keller","year":"1976","unstructured":"Keller, R.M.: Formal Verification of Parallel Programs. Communications of the ACM\u00a019(7), 371\u2013384 (1976)","journal-title":"Communications of the ACM"},{"key":"36_CR17","volume-title":"Executing Temporal Logic Programs","author":"B.C. Moszkowski","year":"1986","unstructured":"Moszkowski, B.C.: Executing Temporal Logic Programs. Cambridge University Press, Cambridge (1986)"},{"issue":"5","key":"36_CR18","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1145\/360051.360224","volume":"19","author":"S. Owicki","year":"1976","unstructured":"Owicki, S., Gries, D.: Verifying Properties of Parallel Programs: An Axiomatic Approach. Communications of the ACM\u00a019(5), 279\u2013285 (1976)","journal-title":"Communications of the ACM"},{"key":"36_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/BFb0035645","volume-title":"Qualitative and Quantitative Practical Reasoning","author":"R. Rondogiannis","year":"1997","unstructured":"Rondogiannis, R., Gergatsoulis, M., Panayiotopoulos, T.: Cactus: A Branching Time Logic Programming Languages. In: Nonnengart, A., Kruse, R., Ohlbach, H.J., Gabbay, D.M. (eds.) FAPR 1997 and ECSQARU 1997. LNCS (LNAI), vol.\u00a01244, pp. 511\u2013524. Springer, Heidelberg (1997)"},{"key":"36_CR20","unstructured":"Tang, C.S.: Toward a Unified Logical Basis for Programming Languages. In: Proceedings of IFIP Congress, pp. 425\u2013429 (1983)"},{"key":"36_CR21","unstructured":"Wadge, W.W.: Tense Logic Programming: A Respectable Alternative. In: Proceedings of the 1988 International Symposium on Lucid and Intensional Programming, pp. 26\u201332 (1988)"},{"key":"36_CR22","series-title":"Intensional Logics for Programming","first-page":"23","volume-title":"A Theory and Practice of Temporal Logic Programming","author":"M.A. Orgun","year":"1992","unstructured":"Orgun, M.A., Wadge, W.W.: A Theory and Practice of Temporal Logic Programming. Intensional Logics for Programming, pp. 23\u201350. Oxford University Press, Oxford (1992)"},{"key":"36_CR23","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.jlap.2008.08.001","volume":"78","author":"X. Yang","year":"2008","unstructured":"Yang, X., Duan, Z.: Operational Semantics of Framed Tempura. Journal of Logic and Algebraic Programming\u00a078, 22\u201351 (2008)","journal-title":"Journal of Logic and Algebraic Programming"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22616-8_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T14:58:37Z","timestamp":1554217117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22616-8_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226151","9783642226168"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22616-8_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}