A normal form for stateful connectors
In this paper we consider a calculus of connectors that allows for the most general combination of synchronisation, non-determinism and buffering. According to previous results, this calculus is tightly related to a flavour of Petri nets with interfaces for composition, called Petri nets with bounda...
Guardado en:
| Autor principal: | |
|---|---|
| Otros Autores: | , , , , |
| Formato: | Acta de conferencia Capítulo de libro |
| Lenguaje: | Inglés |
| Publicado: |
Springer Verlag
2015
|
| Acceso en línea: | Registro en Scopus DOI Handle Registro en la Biblioteca Digital |
| Aporte de: | Registro referencial: Solicitar el recurso aquí |
| LEADER | 07891caa a22008657a 4500 | ||
|---|---|---|---|
| 001 | PAPER-13896 | ||
| 003 | AR-BaUEN | ||
| 005 | 20230518204420.0 | ||
| 008 | 190411s2015 xx ||||fo|||| 00| 0 eng|d | ||
| 024 | 7 | |2 scopus |a 2-s2.0-84960391492 | |
| 040 | |a Scopus |b spa |c AR-BaUEN |d AR-BaUEN | ||
| 100 | 1 | |a Bruni, R. | |
| 245 | 1 | 2 | |a A normal form for stateful connectors |
| 260 | |b Springer Verlag |c 2015 | ||
| 270 | 1 | 0 | |m Bruni, R.; Department of Computer Science, University of PisaItaly; email: bruni@di.unipi.it |
| 506 | |2 openaire |e Política editorial | ||
| 504 | |a Arbab, F., Reo: A channel-based coordination model for component composition (2004) Math. Struct. Comp. Sci, 14 (3), pp. 329-366 | ||
| 504 | |a Arbab, F., Bruni, R., Clarke, D., Lanese, I., Montanari, U., Tiles for Reo (2009) WADT 2008. LNCS, 5486, pp. 37-55. , Corradini, A., Montanari, U. (eds.), Springer, Heidelberg | ||
| 504 | |a Baldan, P., Corradini, A., Ehrig, H., Heckel, R., Compositional semantics for open Petri nets based on deterministic processes (2005) Math. Struct. Comp. Sci, 15 (1), pp. 1-35 | ||
| 504 | |a Basu, A., Bozga, M., Sifakis, J., Modeling heterogeneous real-time components in BIP (2006) SEFM 2006, pp. 3-12. , IEEE Computer Society | ||
| 504 | |a Bliudze, S., Sifakis, J., The algebra of connectors - Structuring interaction in BIP (2008) IEEE Trans. Comput, 57 (10), pp. 1315-1330 | ||
| 504 | |a Bonchi, F., Sobociński, P., Zanasi, F., A categorical semantics of signal flow graphs (2014) CONCUR 2014. LNCS, 8704, pp. 435-450. , Baldan, P., Gorla, D. (eds.), Springer, Heidelberg | ||
| 504 | |a Bonchi, F., Sobocinski, P., Zanasi, F., Full abstraction for signal flow graphs (2015) POPL 2015, pp. 515-526. , ACM | ||
| 504 | |a Bruni, R., Lanese, I., Montanari, U., A basic algebra of stateless connectors (2006) Theor. Comput. Sci, 366 (1-2), pp. 98-120 | ||
| 504 | |a Bruni, R., Melgratti, H., Montanari, U., A connector algebra for P/T nets interactions (2011) CONCUR 2011. LNCS, 6901, pp. 312-326. , Katoen, J.-P., König, B. (eds.), Springer, Heidelberg | ||
| 504 | |a Bruni, R., Melgratti, H., Montanari, U., Connector algebras, Petri nets, and BIP (2012) PSI 2011. LNCS, 7162, pp. 19-38. , Clarke, E., Virbitskaite, I., Voronkov, A. (eds.), Springer, Heidelberg | ||
| 504 | |a Bruni, R., Melgratti, H., Montanari, U., Behaviour, interaction and dynamics (2014) Specification, Algebra, and Software. LNCS, 8373, pp. 382-401. , Iida, S., Meseguer, J., Ogata, K. (eds.), Springer, Heidelberg | ||
| 504 | |a Bruni, R., Melgratti, H.C., Montanari, U., Sobocinski, P., Connector algebras for C/E and P/T nets’ interactions (2013) Log. Methods Comput. Sci, 9 (3), pp. 1-65 | ||
| 504 | |a Bruni, R., Meseguer, J., Montanari, U., Sassone, V., Functorial models for Petri nets (2001) Inf. Comput, 170 (2), pp. 207-236 | ||
| 504 | |a Degano, P., Meseguer, J., Montanari, U., Axiomatizing the algebra of net computations and processes (1996) Acta Inf, 33 (7), pp. 641-667 | ||
| 504 | |a Gadducci, F., Montanari, U., The tile model (2000) Proof, Language, and Interaction, pp. 133-166. , The MIT Press | ||
| 504 | |a Hackney, P., Robertson, M., On the Category of Props (2012), , arXiv:1207.2773 | ||
| 504 | |a Jongmans, S.S.T., Arbab, F., Overview of thirty semantic formalisms for Reo (2012) Sci. Ann. Comput. Sci, 22 (1), pp. 201-251 | ||
| 504 | |a Kanellakis, P.C., Smolka, S.A., CCS expressions, finite state processes, and three problems of equivalence (1983) PODC 1983, pp. 228-240. , ACM | ||
| 504 | |a Katis, P., Sabadini, N., Walters, R.F.C., Representing place/transition nets in Span(Graph) (1997) AMAST 1997. LNCS, 1349. , Johnson, M. (ed.), Springer, Heidelberg | ||
| 504 | |a Katis, P., Sabadini, N., Walters, R.F.C., Representing place/transition nets in Span(Graph) (1997) AMAST 1997. LNCS, 1349, pp. 322-336. , Johnson, M. (ed.), Springer, Heidelberg | ||
| 504 | |a Maclane, S., Categorical algebra (1965) Bull. AMS, 71 (1), pp. 40-106 | ||
| 504 | |a Meseguer, J., Montanari, U., Petri nets are monoids (1990) Inf. Comp, 88 (2), pp. 105-155 | ||
| 504 | |a Meseguer, J., Montanari, U., Sassone, V., On the semantics of place/transition Petri nets (1997) Math. Struct. Comp. Sci, 7 (4), pp. 359-397 | ||
| 504 | |a Paige, R., Tarjan, R.E., Three partition refinement algorithms (1987) SIAM J. Comput, 16 (6), pp. 973-989 | ||
| 504 | |a Perry, D.E., Wolf, E.L., Foundations for the study of software architecture (1992) ACM SIGSOFT Soft. Eng. Notes, 17, pp. 40-52 | ||
| 504 | |a Petri, C., (1962) Kommunikation Mit Automaten, , Ph.D. thesis, Institut für Instrumentelle Mathematik, Bonn | ||
| 504 | |a Sobocinski, P., A non-interleaving process calculus for multi-party synchronisation (2009) ICE 2009, EPTCS, 12, pp. 87-98 | ||
| 504 | |a Sobociński, P., Representations of Petri net interactions (2010) CONCUR 2010. LNCS, 6269, pp. 554-568. , Gastin, P., Laroussinie, F. (eds.), Springer, HeidelbergA4 - | ||
| 520 | 3 | |a In this paper we consider a calculus of connectors that allows for the most general combination of synchronisation, non-determinism and buffering. According to previous results, this calculus is tightly related to a flavour of Petri nets with interfaces for composition, called Petri nets with boundaries. The calculus and the net version are equipped with equivalent bisimilarity semantics. Also the buffers (the net places) can be one-place (C/E nets) or with unlimited capacity (P/T nets). In the paper we investigate the idea of finding normal form representations for terms of this calculus, in the sense that equivalent (bisimilar) terms should have the same (isomorphic) normal form. We show that this is possible for finite state terms. The result is obtained by computing the minimal marking graph (when finite) for the net with boundaries corresponding to the given term, and reconstructing from it a canonical net and a canonical term. © Springer International Publishing Switzerland 2015. |l eng | |
| 593 | |a Department of Computer Science, University of Pisa, Pisa, Italy | ||
| 593 | |a Departamento de Computación, FCEyN, Universidad de Buenos Aires - Conicet, Buenos Aires, Argentina | ||
| 690 | 1 | 0 | |a ALGEBRAS OF CONNECTORS |
| 690 | 1 | 0 | |a PETRI NETS WITH BOUNDARIES |
| 690 | 1 | 0 | |a COMPUTATION THEORY |
| 690 | 1 | 0 | |a COMPUTER CIRCUITS |
| 690 | 1 | 0 | |a PETRI NETS |
| 690 | 1 | 0 | |a RECONFIGURABLE HARDWARE |
| 690 | 1 | 0 | |a SEMANTICS |
| 690 | 1 | 0 | |a BISIMILARITY |
| 690 | 1 | 0 | |a FINITE STATE |
| 690 | 1 | 0 | |a NON DETERMINISM |
| 690 | 1 | 0 | |a NORMAL FORM |
| 690 | 1 | 0 | |a P/T NET |
| 690 | 1 | 0 | |a CALCULATIONS |
| 700 | 1 | |a Melgratti, H. | |
| 700 | 1 | |a Montanari, U. | |
| 700 | 1 | |a Olveczky P.C. | |
| 700 | 1 | |a Talcott C. | |
| 700 | 1 | |a Marti-Oliet N. | |
| 711 | 2 | |d 23 September 2015 through 25 September 2015 |g Código de la conferencia: 166819 | |
| 773 | 0 | |d Springer Verlag, 2015 |g v. 9200 |h pp. 205-227 |p Lect. Notes Comput. Sci. |n Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |x 03029743 |w (AR-BaUEN)CENRE-983 |z 9783319231648 |t Conference on Logic, Rewriting and Concurrency dedicated to Jose Meseguer on the Occasion of his 65th Birthday, 2015 | |
| 856 | 4 | 1 | |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-84960391492&doi=10.1007%2f978-3-319-23165-5_9&partnerID=40&md5=cd98fcaa62d149351d3a739ee5f7da18 |y Registro en Scopus |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-319-23165-5_9 |y DOI |
| 856 | 4 | 0 | |u https://hdl.handle.net/20.500.12110/paper_03029743_v9200_n_p205_Bruni |y Handle |
| 856 | 4 | 0 | |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v9200_n_p205_Bruni |y Registro en la Biblioteca Digital |
| 961 | |a paper_03029743_v9200_n_p205_Bruni |b paper |c PE | ||
| 962 | |a info:eu-repo/semantics/article |a info:ar-repo/semantics/artículo |b info:eu-repo/semantics/publishedVersion | ||
| 963 | |a VARI | ||
| 999 | |c 74849 | ||