{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:10:04Z","timestamp":1743081004628,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316050"},{"type":"electronic","value":"9783642316067"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31606-7_11","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T07:47:55Z","timestamp":1345880875000},"page":"125-137","source":"Crossref","is-referenced-by-count":8,"title":["Nominal Automata for Resource Usage Control"],"prefix":"10.1007","author":[{"given":"Pierpaolo","family":"Degano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gian-Luigi","family":"Ferrari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluca","family":"Mezzetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Baier, C., Katoen, J.P.: Principles of model checking. MIT Press (2008)"},{"key":"11_CR2","unstructured":"Bartoletti, M., Zunino, R.: LocUsT: a tool for checking usage policies. Tech. Rep. TR08-07, University of Pisa (2008)"},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.5381\/jot.2009.8.4.a1","volume":"8","author":"M. Bartoletti","year":"2009","unstructured":"Bartoletti, M., Costa, G., Degano, P., Martinelli, F., Zunino, R.: Securing Java with local policies. Journal of Object Technology\u00a08(4), 5\u201332 (2009)","journal-title":"Journal of Object Technology"},{"issue":"5","key":"11_CR4","doi-asserted-by":"crossref","first-page":"799","DOI":"10.3233\/JCS-2009-0357","volume":"17","author":"M. Bartoletti","year":"2009","unstructured":"Bartoletti, M., Degano, P., Ferrari, G.L.: Planning and verifying service composition. Journal of Computer Security\u00a017(5), 799\u2013837 (2009)","journal-title":"Journal of Computer Security"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-00945-7_2","volume-title":"Trustworthy Global Computing","author":"M. Bartoletti","year":"2009","unstructured":"Bartoletti, M., Degano, P., Ferrari, G.L., Zunino, R.: Model Checking Usage Policies. In: Kaklamanis, C., Nielson, F. (eds.) TGC 2008. LNCS, vol.\u00a05474, pp. 19\u201335. Springer, Heidelberg (2009); Extended version to appear in Math. Stuct. Comp. Sci."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Bartoletti, M., Degano, P., Ferrari, G.L., Zunino, R.: Local policies for resource usage analysis. ACM Trans. Program. Lang. Syst.\u00a031(6) (2009)","DOI":"10.1145\/1552309.1552313"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-15205-4_12","volume-title":"Computer Science Logic","author":"M. Benedikt","year":"2010","unstructured":"Benedikt, M., Ley, C., Puppis, G.: Automata vs. Logics on Data Words. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol.\u00a06247, pp. 110\u2013124. Springer, Heidelberg (2010)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-23217-6_12","volume-title":"CONCUR 2011","author":"B. Bollig","year":"2011","unstructured":"Bollig, B.: An Automaton over Data Words That Captures EMSO Logic. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol.\u00a06901, pp. 171\u2013186. Springer, Heidelberg (2011)"},{"issue":"2","key":"11_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0020-0190(02)00229-6","volume":"84","author":"P. Bouyer","year":"2002","unstructured":"Bouyer, P.: A logical characterization of data languages. Information Processing Letters\u00a084(2), 75\u201385 (2002)","journal-title":"Information Processing Letters"},{"issue":"3","key":"11_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s002360050120","volume":"35","author":"E.Y.C. Cheng","year":"1998","unstructured":"Cheng, E.Y.C., Kaminski, M.: Context-free languages over infinite alphabets. Acta Inf.\u00a035(3), 245\u2013267 (1998)","journal-title":"Acta Inf."},{"key":"11_CR11","unstructured":"Ciancia, V., Tuosto, E.: A novel class of automata for languages on infinite alphabets. Tech. rep., CS-09-003, University of Leicester, UK (2009)"},{"key":"11_CR12","unstructured":"Degano, P., Mezzetti, G., Ferrari, G.L.: Nominal models and resource usage control. Tech. Rep. TR-11-09, Dipartimento di Informatica, Universit\u00e0 di Pisa (2011)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BFb0017477","volume-title":"Trees in Algebra and Programming - CAAP \u201994","author":"J. Esparza","year":"1994","unstructured":"Esparza, J.: On the Decidability of Model Checking for Several \u03bc-calculi and Petri Nets. In: Tison, S. (ed.) CAAP 1994. LNCS, vol.\u00a0787, pp. 115\u2013129. Springer, Heidelberg (1994)"},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M.J. Gabbay","year":"2002","unstructured":"Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing\u00a013(3), 341\u2013363 (2002)","journal-title":"Formal Aspects of Computing"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-45608-2_5","volume-title":"Foundations of Security Analysis and Design","author":"A.D. Gordon","year":"2001","unstructured":"Gordon, A.D.: Notes on Nominal Calculi for Security and Mobility. In: Focardi, R., Gorrieri, R. (eds.) FOSAD 2000. LNCS, vol.\u00a02171, pp. 262\u2013330. Springer, Heidelberg (2001)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-642-13089-2_47","volume-title":"Language and Automata Theory and Applications","author":"O. Grumberg","year":"2010","unstructured":"Grumberg, O., Kupferman, O., Sheinvald, S.: Variable Automata over Infinite Alphabets. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 561\u2013572. Springer, Heidelberg (2010)"},{"issue":"1","key":"11_CR17","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/1111596.1111601","volume":"28","author":"K.W. Hamlen","year":"2006","unstructured":"Hamlen, K.W., Morrisett, J.G., Schneider, F.B.: Computability classes for enforcement mechanisms. ACM Trans. on Programming Languages and Systems\u00a028(1), 175\u2013205 (2006)","journal-title":"ACM Trans. on Programming Languages and Systems"},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M. Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theoretical Computer Science\u00a0134(2), 329\u2013363 (1994)","journal-title":"Theoretical Computer Science"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/3-540-44612-5_52","volume-title":"Mathematical Foundations of Computer Science 2000","author":"U. Montanari","year":"2000","unstructured":"Montanari, U., Pistore, M.: \u03c0-Calculus, Structured Coalgebras and Minimal HD-Automata. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 569\u2013578. Springer, Heidelberg (2000)"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/3-540-44683-4_49","volume-title":"Mathematical Foundations of Computer Science 2001","author":"F. Neven","year":"2001","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Towards Regular Languages over Infinite Alphabets. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 560\u2013572. Springer, Heidelberg (2001)"},{"key":"11_CR21","unstructured":"Sangiorgi, D., Walker, D.: The Pi-Calculus - a theory of mobile processes. Cambridge University Press (2001)"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11874683_3","volume-title":"Computer Science Logic","author":"L. Segoufin","year":"2006","unstructured":"Segoufin, L.: Automata and Logics for Words and Trees over an Infinite Alphabet. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 41\u201357. Springer, Heidelberg (2006)"},{"issue":"2","key":"11_CR23","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1017\/S0956796807006466","volume":"18","author":"C. Skalka","year":"2008","unstructured":"Skalka, C., Smith, S., Horn, D.V.: Types and trace effects of higher order programs. Journal of Functional Programming\u00a018(2), 179\u2013249 (2008)","journal-title":"Journal of Functional Programming"},{"issue":"1","key":"11_CR24","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1145\/1925844.1926420","volume":"46","author":"N. Tzevelekos","year":"2011","unstructured":"Tzevelekos, N.: Fresh-register automata. ACM SIGPLAN Notices\u00a046(1), 295\u2013306 (2011)","journal-title":"ACM SIGPLAN Notices"},{"key":"11_CR25","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification (preliminary report). In: LICS, pp. 332\u2013344. IEEE Computer Society (1986)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31606-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T09:30:20Z","timestamp":1675762220000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-31606-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316050","9783642316067"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31606-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}