{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:49:21Z","timestamp":1725515361633},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540686767"},{"type":"electronic","value":"9783540686798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-68679-8_39","type":"book-chapter","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T02:58:16Z","timestamp":1213066696000},"page":"625-641","source":"Crossref","is-referenced-by-count":0,"title":["History Dependent Automata for Service Compatibility"],"prefix":"10.1007","author":[{"given":"Vincenzo","family":"Ciancia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gian-Luigi","family":"Ferrari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Pistore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emilio","family":"Tuosto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","first-page":"207","volume":"54","author":"A. Bouali","year":"1994","unstructured":"Bouali, A., Gnesi, S., Larosa, S.: The Integration Project for the JACK Environment. Bulletin of the EATCS\u00a054, 207\u2013223 (1994)","journal-title":"Bulletin of the EATCS"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Ciancia, V., Montanari, U.: A name abstraction functor for named sets. In: Coalgebraic Methods in Computer Science 2008 (to appear, 2008)","DOI":"10.1016\/j.entcs.2008.05.019"},{"issue":"2-3","key":"39_CR3","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.tcs.2004.09.021","volume":"331","author":"G.L. Ferrari","year":"2005","unstructured":"Ferrari, G.L., Montanari, U., Tuosto, E.: Coalgebraic minimization of hd-automata for the pi-calculus using polymorphic types. Theoretical Computer Science\u00a0331(2-3), 325\u2013365 (2005)","journal-title":"Theoretical Computer Science"},{"key":"39_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BFb0035394","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Ferrari","year":"1997","unstructured":"Ferrari, G., Ferro, G., Gnesi, S., Montanari, U., Pistore, M., Ristori, G.: An Automata Based Verification Environment for Mobile Processes. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol.\u00a01217, pp. 275\u2013289. Springer, Heidelberg (1997)"},{"issue":"4","key":"39_CR5","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1145\/990010.990013","volume":"12","author":"G. Ferrari","year":"2003","unstructured":"Ferrari, G., Gnesi, S., Montanari, U., Pistore, M.: A Model Checking Verification Environment for Mobile Processes. ACM Transactions on Software Engineering and Methodology\u00a012(4), 440\u2013473 (2003)","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"39_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-45931-6_10","volume-title":"Foundations of Software Science and Computation Structures","author":"G. Ferrari","year":"2002","unstructured":"Ferrari, G., Montanari, U., Pistore, M.: Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 129\u2013143. Springer, Heidelberg (2002)"},{"key":"39_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/978-3-540-39656-7_13","volume-title":"Formal Methods for Components and Objects","author":"G. Ferrari","year":"2003","unstructured":"Ferrari, G., Montanari, U., Tuosto, E.: From Co-algebraic Specifications to Implementation: The Mihda toolkit. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2002. LNCS, vol.\u00a02852, pp. 319\u2013338. Springer, Heidelberg (2003)"},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.tcs.2004.09.021","volume":"331","author":"G. Ferrari","year":"2005","unstructured":"Ferrari, G., Montanari, U., Tuosto, E.: Coalgebraic Minimisation of HD-automata for the \u03c0-Calculus in a Polymorphic \u03bb-Calculus. Theoretical Computer Science\u00a0331, 325\u2013365 (2005)","journal-title":"Theoretical Computer Science"},{"key":"39_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/11548133_10","volume-title":"Algebra and Coalgebra in Computer Science","author":"G. Ferrari","year":"2005","unstructured":"Ferrari, G., Montanari, U., Tuosto, E., Victor, B., Yemane, K.: Modelling and Minimising the Fusion Calculus Using HD-Automata. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol.\u00a03629, pp. 142\u2013156. Springer, Heidelberg (2005)"},{"issue":"3-5","key":"39_CR10","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M. Gabbay","year":"2002","unstructured":"Gabbay, M., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing\u00a013(3-5), 341\u2013363 (2002)","journal-title":"Formal Aspects of Computing"},{"issue":"2-3","key":"39_CR11","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10990-006-8749-3","volume":"19","author":"F. Gadducci","year":"2006","unstructured":"Gadducci, F., Miculan, M., Montanari, U.: About permutation algebras (pre)sheaves and named sets. Higher-Order and Symbolic Computation\u00a019(2-3), 283\u2013304 (2006)","journal-title":"Higher-Order and Symbolic Computation"},{"issue":"1","key":"39_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, I and II. Information and Computation\u00a0100(1), 1\u201340,41\u201377 (1992)","journal-title":"Information and Computation"},{"key":"39_CR13","series-title":"Lecture Notes in Computer Science","first-page":"449","volume-title":"CONCUR 2002 - Concurrency Theory","author":"U. Montanari","year":"2002","unstructured":"Montanari, U., Buscemi, M.: A First Order Coalgebraic Model of \u03c0-Calculus Early Observational Equivalence. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 449\u2013465. Springer, Heidelberg (2002)"},{"key":"39_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/3-540-60218-6_4","volume-title":"CONCUR \u201995 Concurrency Theory","author":"U. Montanari","year":"1995","unstructured":"Montanari, U., Pistore, M.: Checking Bisimilarity for Finitary \u03c0-Calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 42\u201356. Springer, Heidelberg (1995)"},{"key":"39_CR15","unstructured":"Montanari, U., Pistore, M.: History Dependent Automata. Technical report, Dipartimento di Informatica, Universit\u00e0 di Pisa, TR-11-98 (1998)"},{"key":"39_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45022-X","volume-title":"Intelligent Data Engineering and Automated Learning - IDEAL 2000. Data Mining, Financial Engineering, and Intelligent Agents","author":"U. Montanari","year":"2000","unstructured":"Montanari, U., Pistore, M.: \u03c0-Calculus, Structured Coalgebras, and Minimal HD-Automata. In: Leung, K.-S., Chan, L., Meng, H. (eds.) IDEAL 2000. LNCS, vol.\u00a01983, Springer, Heidelberg (2000); An extended version will be published on Theoretical Computer Science"},{"key":"39_CR17","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/j.tcs.2005.03.014","volume":"340","author":"U. Montanari","year":"2005","unstructured":"Montanari, U., Pistore, M.: Structured coalgebras and minimal hd-automata for the \u03c0-calculus. Theoretical Computer Science\u00a0340, 539\u2013576 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"39_CR18","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.: Three Partition Refinement Algorithms. SIAM Journal on Computing\u00a016(6), 973\u2013989 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"39_CR19","volume-title":"Annual Symposium on Logic in Computer Science","author":"J. Parrow","year":"1998","unstructured":"Parrow, J., Victor, B.: The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes. In: Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"39_CR20","unstructured":"Pistore, M.: History Dependent Automata. PhD thesis, Universit\u00e0 di Pisa, Dipartimento di Informatica, available at University of Pisa as PhD Thesis TD-5\/99 (1999)"},{"issue":"1","key":"39_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J.J.M.M. Rutten","year":"2000","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoretical Computer Science\u00a0249(1), 3\u201380 (2000)","journal-title":"Theoretical Computer Science"},{"key":"39_CR22","volume-title":"The \u03c0-Calculus: a Theory of Mobile Processes","author":"D. Sangiorgi","year":"2002","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-Calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2002)"}],"container-title":["Lecture Notes in Computer Science","Concurrency, Graphs and Models"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68679-8_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,2]],"date-time":"2019-03-02T04:02:56Z","timestamp":1551499376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68679-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540686767","9783540686798"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68679-8_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}