{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:03:35Z","timestamp":1725563015053},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642148071"},{"type":"electronic","value":"9783642148088"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14808-8_7","type":"book-chapter","created":{"date-parts":[[2010,8,21]],"date-time":"2010-08-21T05:52:01Z","timestamp":1282369921000},"page":"91-105","source":"Crossref","is-referenced-by-count":1,"title":["Prioritized slotted-Circus"],"prefix":"10.1007","author":[{"given":"Pawe\u0142","family":"Gancarski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Butterfield","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/BFb0040258","volume-title":"Mathematical Foundations of Programming Semantics","author":"G. Barrett","year":"1990","unstructured":"Barrett, G.: The semantics of priority and fairness in occam. In: Main, M.G., Melton, A., Mislove, M.W., Schmidt, D.A. (eds.) MFPS 1989. LNCS, vol.\u00a0442, pp. 194\u2013208. Springer, Heidelberg (1990)"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/SEFM.2006.27","volume-title":"Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2006)","author":"A. Basu","year":"2006","unstructured":"Basu, A., Bozga, M., Sifakis, J.: Modeling heterogeneous real-time components in BIP. In: Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2006), Pune, India, September 11-15, pp. 3\u201312. IEEE Computer Society, Los Alamitos (2006)"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1007\/3-540-45022-X_62","volume-title":"Automata, Languages and Programming","author":"M. Bravetti","year":"2000","unstructured":"Bravetti, M., Gorrieri, R.: A complete axiomatization for observational congruence of prioritized finite-state behaviors. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 744\u2013755. Springer, Heidelberg (2000)"},{"key":"7_CR4","unstructured":"Butterfield, A., Gancarski, P.: Slotted-Circus: A generic UTP framework for discretely-timed circus. Technical Report TCD-CS-09-32, School of Computer Science & Statistic Trinity College Dublin, Trinity College, Dublin 2, Ireland (July 2009), \n                    \n                      https:\/\/www.cs.tcd.ie\/publications\/tech-reports\/reports.09\/TCD-CS-2009-32.pdf"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-540-73210-5_5","volume-title":"Integrated Formal Methods","author":"A. Butterfield","year":"2007","unstructured":"Butterfield, A., Sherif, A., Woodcock, J.: Slotted-circus: A UTP-family of reactive theories. In: Davies, J., Gibbons, J. (eds.) IFM 2007. LNCS, vol.\u00a04591, pp. 75\u201397. Springer, Heidelberg (2007)"},{"issue":"3","key":"7_CR6","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/s10009-004-0181-6","volume":"7","author":"A. Butterfield","year":"2005","unstructured":"Butterfield, A., Woodcock, J.: prialt in Handel-C: an operational semantics. International Journal on Software Tools for Technology Transfer (STTT)\u00a07(3), 248\u2013267 (2005)","journal-title":"International Journal on Software Tools for Technology Transfer (STTT)"},{"issue":"5","key":"7_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF01379186","volume":"18","author":"J. Camilleri","year":"1989","unstructured":"Camilleri, J.: An operational semantics for OCCAM. International Journal of Parallel Programming\u00a018(5), 149\u2013167 (1989)","journal-title":"International Journal of Parallel Programming"},{"key":"7_CR8","unstructured":"Celoxica Ltd. Handel-C Language Reference Manual, v3.0 (2002), \n                    \n                      http:\/\/www.celoxica.com"},{"issue":"1\/2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/0890-5401(90)90059-Q","volume":"87","author":"R. Cleaveland","year":"1990","unstructured":"Cleaveland, R., Hennessy, M.: Priorities in process algebras. Inf. Comput.\u00a087(1\/2), 58\u201377 (1990)","journal-title":"Inf. Comput."},{"issue":"9","key":"7_CR10","doi-asserted-by":"publisher","first-page":"1426","DOI":"10.1016\/j.ic.2007.05.001","volume":"205","author":"R. Cleaveland","year":"2007","unstructured":"Cleaveland, R., L\u00fcttgen, G., Natarajan, V.: Priority and abstraction in process algebra. Inf. Comput.\u00a0205(9), 1426\u20131458 (2007)","journal-title":"Inf. Comput."},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/inco.1995.1003","volume":"116","author":"J. Camilleri","year":"1995","unstructured":"Camilleri, J., Winskel, G.: CCS with priority choice. Inf. Comput.\u00a0116(1), 26\u201337 (1995)","journal-title":"Inf. Comput."},{"issue":"4","key":"7_CR12","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1145\/155183.155221","volume":"15","author":"C.J. Fidge","year":"1993","unstructured":"Fidge, C.J.: A formal definition of priority in CSP. ACM Transactions on Programming Languages and Systems\u00a015(4), 681\u2013705 (1993)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-05089-3_29","volume-title":"FM 2009: Formal Methods","author":"P. Gancarski","year":"2009","unstructured":"Gancarski, P., Butterfield, A.: The denotational semantics of slotted-circus. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 451\u2013466. Springer, Heidelberg (2009)"},{"key":"7_CR14","series-title":"Series in Computer Science","volume-title":"Unifying Theories of Programming","author":"C.A.R. Hoare","year":"1998","unstructured":"Hoare, C.A.R., He, J.: Unifying Theories of Programming. Series in Computer Science. Prentice Hall, Englewood Cliffs (1998), \n                    \n                      http:\/\/www.unifyingtheories.org"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BFb0055626","volume-title":"CONCUR \u201998 Concurrency Theory","author":"H. Hermanns","year":"1998","unstructured":"Hermanns, H., Lohrey, M.: Priority and maximal progress are completely axiomatisable. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 237\u2013252. Springer, Heidelberg (1998)"},{"key":"7_CR16","series-title":"Intl. Series in Computer Science","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Intl. Series in Computer Science. Prentice Hall, Englewood Cliffs (1985)"},{"key":"7_CR17","first-page":"141","volume-title":"Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Programs are predicates. In: Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages, pp. 141\u2013155. Prentice-Hall, Inc., Englewood Cliffs (1985)"},{"key":"7_CR18","unstructured":"Lowe, G.: Probabilities and Priorities in Timed CSP. PhD thesis, Oxford University (1993)"},{"issue":"1-2","key":"7_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00165-007-0052-5","volume":"21","author":"M. Oliveira","year":"2009","unstructured":"Oliveira, M., Cavalcanti, A., Woodcock, J.: A UTP semantics for circus. Formal Asp. Comput.\u00a021(1-2), 3\u201332 (2009)","journal-title":"Formal Asp. Comput."},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/3-540-15670-4_15","volume-title":"Seminar on Concurrency","author":"A.W. Roscoe","year":"1985","unstructured":"Roscoe, A.W.: Denotational semantics for occam. In: Brookes, S.D., Roscoe, A.W., Winskel, G. (eds.) Seminar on Concurrency. LNCS, vol.\u00a0197, pp. 306\u2013329. Springer, Heidelberg (1985)"},{"key":"7_CR21","volume-title":"Concurrent and Real-time Systems \u2014 The CSP Approach","author":"S. Schneider","year":"2000","unstructured":"Schneider, S.: Concurrent and Real-time Systems \u2014 The CSP Approach. Wiley, Chichester (2000)"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/3-540-36103-0_62","volume-title":"Formal Methods and Software Engineering","author":"A. Sherif","year":"2002","unstructured":"Sherif, A., He, J.: Towards a time model for circus. In: George, C., Miao, H. (eds.) ICFEM 2002. LNCS, vol.\u00a02495, pp. 613\u2013624. Springer, Heidelberg (2002)"},{"key":"7_CR23","unstructured":"Sherif, A.: A Framework for Specification and Validation of Real Time Systems using Circus Action. Ph.d. thesis, Universidade Federale de Pernambuco, Recife, Brazil (January 2006)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14808-8_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:38:45Z","timestamp":1619771925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14808-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642148071","9783642148088"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14808-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}