{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:36:46Z","timestamp":1725730606580},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642389078"},{"type":"electronic","value":"9783642389085"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38908-5_18","type":"book-chapter","created":{"date-parts":[[2013,6,10]],"date-time":"2013-06-10T02:18:23Z","timestamp":1370830703000},"page":"232-249","source":"Crossref","is-referenced-by-count":1,"title":["Trust Domains: An Algebraic, Logical, and Utility-Theoretic Approach"],"prefix":"10.1007","author":[{"given":"Gabrielle","family":"Anderson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Collinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Pym","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M.: Logic in access control. In: Proc. LICS 2003, pp. 228\u2013233. IEEE (2003)","DOI":"10.1109\/LICS.2003.1210062"},{"issue":"4","key":"18_CR2","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1145\/155183.155225","volume":"15","author":"M. Abadi","year":"1993","unstructured":"Abadi, M., Burrows, M., Lampson, B., Plotkin, G.: A calculus for access control in distributed systems. ACM Trans. Prog. Langs. Sys.\u00a015(4), 706\u2013734 (1993)","journal-title":"ACM Trans. Prog. Langs. Sys."},{"key":"18_CR3","unstructured":"Anderson, G., Collinson, M., Pym, D.: Utility-based Decision-making in Distributed Systems Modelling. In: Schipper, B.C. (ed.) Proc. 14th TARK, Chennai (2013), Computing Research Repository (CoRR): http:\/\/arxiv.org\/corr\/home ISBN: 978-0-615-74716-3"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Barwise, J., Seligman, J.: Information Flow: The Logic of Distributed Systems. CUP (1997)","DOI":"10.1017\/CBO9780511895968"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Beautement, A., Coles, R., Griffin, J., Ioannidis, C., Monahan, B., Pym, D., Sasse, A., Wonham, M.: Modelling the Human and Technological Costs and Benefits of USB Memory Stick Security. In: Johnson, M.E. (ed.) Managing Information Risk and the Economics of Security, pp. 141\u2013163. Springer (2008)","DOI":"10.1007\/978-0-387-09762-6_7"},{"key":"18_CR6","unstructured":"Collinson, M., Monahan, B., Pym, D.: A Discipline of Mathematical Systems Modelling. College Publications (2012)"},{"key":"18_CR7","unstructured":"Coulouris, G., Dollimore, J., Kindberg, T.: Distributed Systems: Concepts and Design, 3rd edn. Addison Wesley (2000)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Hennessy, M.: A calculus for costed computations. Logical Methods in Computer Science\u00a07(1), paper 9 (2011), doi:10.2168\/LMCS-7(1:7)2011","DOI":"10.2168\/LMCS-7(1:7)2011"},{"issue":"1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of the ACM\u00a032(1), 137\u2013161 (1985)","journal-title":"Journal of the ACM"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-10003-2_79","volume-title":"Automata, Languages and Programming","author":"M. Hennessy","year":"1980","unstructured":"Hennessy, M., Plotkin, G.: On observing nondeterminism and concurrency. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol.\u00a085, pp. 299\u2013308. Springer, Heidelberg (1980)"},{"key":"18_CR11","unstructured":"Jamroga, W.: A temporal logic for Markov chains. In: Proc. AAMAS 2008, pp. 607\u2013704. ACM Digital Library (2008)"},{"issue":"2","key":"18_CR12","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/inco.1996.0057","volume":"127","author":"A. Joyal","year":"1996","unstructured":"Joyal, A., Nielsen, M., Winskel, G.: Bisimulation from open maps. Information and Computation\u00a0127(2), 164\u2013185 (1996)","journal-title":"Information and Computation"},{"key":"18_CR13","unstructured":"Keeney, R., Raiffa, H.: Decisions with multiple objectives: Preferences and value tradeoffs. Wiley (1976)"},{"key":"18_CR14","unstructured":"McCarthy, J.: Formalizing context. In: IJCAI, pp. 555\u2013562 (1993)"},{"issue":"3","key":"18_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"Milner, R.: Calculi for synchrony and asynchrony. Theoret. Comp. Sci.\u00a025(3), 267\u2013310 (1983)","journal-title":"Theoret. Comp. Sci."},{"key":"18_CR16","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, New York (1989)"},{"issue":"2","key":"18_CR17","doi-asserted-by":"publisher","first-page":"215","DOI":"10.2307\/421090","volume":"5","author":"P. O\u2019Hearn","year":"1999","unstructured":"O\u2019Hearn, P., Pym, D.: The logic of bunched implications. Bulletin of Symbolic Logic\u00a05(2), 215\u2013244 (1999)","journal-title":"Bulletin of Symbolic Logic"},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0269888904000116","volume":"19","author":"S. Ramchurn","year":"2004","unstructured":"Ramchurn, S., Huynh, D., Jennings, N.: Trust in multi-agent systems. The Knowledge Engineering Review\u00a019(1), 1\u201325 (2004)","journal-title":"The Knowledge Engineering Review"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Reynolds, J.: Separation logic: A logic for shared mutable data structures. In: Proc. 17th LICS, pp. 55\u201374. IEEE (2002)","DOI":"10.1109\/LICS.2002.1029817"},{"issue":"5","key":"18_CR20","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/BF01211867","volume":"6","author":"C. Tofts","year":"1994","unstructured":"Tofts, C.: Processes with probability, priority and time. Formal Aspects of Computing\u00a06(5), 536\u2013564 (1994)","journal-title":"Formal Aspects of Computing"}],"container-title":["Lecture Notes in Computer Science","Trust and Trustworthy Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38908-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T01:13:22Z","timestamp":1563153202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38908-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642389078","9783642389085"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38908-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}