Navegar

Colección

Datos Estadísticas

Artículo

Bruni, R.; Melgratti, H.; Montanari, U.; Olveczky P.C.; Talcott C.; Marti-Oliet N. "A normal form for stateful connectors" (2015) Conference on Logic, Rewriting and Concurrency dedicated to Jose Meseguer on the Occasion of his 65th Birthday, 2015. 9200:205-227
El editor solo permite decargar el artículo en su versión post-print desde el repositorio. Por favor, si usted posee dicha versión, enviela a
Consulte el artículo en la página del editor
Consulte la política de Acceso Abierto del editor

Abstract:

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.

Registro:

Documento: Artículo
Título:A normal form for stateful connectors
Autor:Bruni, R.; Melgratti, H.; Montanari, U.; Olveczky P.C.; Talcott C.; Marti-Oliet N.
Filiación:Department of Computer Science, University of Pisa, Pisa, Italy
Departamento de Computación, FCEyN, Universidad de Buenos Aires - Conicet, Buenos Aires, Argentina
Palabras clave:Algebras of connectors; Petri nets with boundaries; Computation theory; Computer circuits; Petri nets; Reconfigurable hardware; Semantics; Bisimilarity; Finite state; Non Determinism; Normal form; P/T net; Calculations
Año:2015
Volumen:9200
Página de inicio:205
Página de fin:227
DOI: http://dx.doi.org/10.1007/978-3-319-23165-5_9
Título revista:Conference on Logic, Rewriting and Concurrency dedicated to Jose Meseguer on the Occasion of his 65th Birthday, 2015
Título revista abreviado:Lect. Notes Comput. Sci.
ISSN:03029743
Registro:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v9200_n_p205_Bruni

Referencias:

  • Arbab, F., Reo: A channel-based coordination model for component composition (2004) Math. Struct. Comp. Sci, 14 (3), pp. 329-366
  • 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
  • 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
  • Basu, A., Bozga, M., Sifakis, J., Modeling heterogeneous real-time components in BIP (2006) SEFM 2006, pp. 3-12. , IEEE Computer Society
  • Bliudze, S., Sifakis, J., The algebra of connectors - Structuring interaction in BIP (2008) IEEE Trans. Comput, 57 (10), pp. 1315-1330
  • 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
  • Bonchi, F., Sobocinski, P., Zanasi, F., Full abstraction for signal flow graphs (2015) POPL 2015, pp. 515-526. , ACM
  • Bruni, R., Lanese, I., Montanari, U., A basic algebra of stateless connectors (2006) Theor. Comput. Sci, 366 (1-2), pp. 98-120
  • 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
  • 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
  • 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
  • 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
  • Bruni, R., Meseguer, J., Montanari, U., Sassone, V., Functorial models for Petri nets (2001) Inf. Comput, 170 (2), pp. 207-236
  • Degano, P., Meseguer, J., Montanari, U., Axiomatizing the algebra of net computations and processes (1996) Acta Inf, 33 (7), pp. 641-667
  • Gadducci, F., Montanari, U., The tile model (2000) Proof, Language, and Interaction, pp. 133-166. , The MIT Press
  • Hackney, P., Robertson, M., On the Category of Props (2012), , arXiv:1207.2773
  • Jongmans, S.S.T., Arbab, F., Overview of thirty semantic formalisms for Reo (2012) Sci. Ann. Comput. Sci, 22 (1), pp. 201-251
  • Kanellakis, P.C., Smolka, S.A., CCS expressions, finite state processes, and three problems of equivalence (1983) PODC 1983, pp. 228-240. , ACM
  • 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
  • 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
  • Maclane, S., Categorical algebra (1965) Bull. AMS, 71 (1), pp. 40-106
  • Meseguer, J., Montanari, U., Petri nets are monoids (1990) Inf. Comp, 88 (2), pp. 105-155
  • Meseguer, J., Montanari, U., Sassone, V., On the semantics of place/transition Petri nets (1997) Math. Struct. Comp. Sci, 7 (4), pp. 359-397
  • Paige, R., Tarjan, R.E., Three partition refinement algorithms (1987) SIAM J. Comput, 16 (6), pp. 973-989
  • Perry, D.E., Wolf, E.L., Foundations for the study of software architecture (1992) ACM SIGSOFT Soft. Eng. Notes, 17, pp. 40-52
  • Petri, C., (1962) Kommunikation Mit Automaten, , Ph.D. thesis, Institut für Instrumentelle Mathematik, Bonn
  • Sobocinski, P., A non-interleaving process calculus for multi-party synchronisation (2009) ICE 2009, EPTCS, 12, pp. 87-98
  • Sobociński, P., Representations of Petri net interactions (2010) CONCUR 2010. LNCS, 6269, pp. 554-568. , Gastin, P., Laroussinie, F. (eds.), Springer, HeidelbergA4 -

Citas:

---------- APA ----------
Bruni, R., Melgratti, H., Montanari, U., Olveczky P.C., Talcott C. & Marti-Oliet N. (2015) . A normal form for stateful connectors. Conference on Logic, Rewriting and Concurrency dedicated to Jose Meseguer on the Occasion of his 65th Birthday, 2015, 9200, 205-227.
http://dx.doi.org/10.1007/978-3-319-23165-5_9
---------- CHICAGO ----------
Bruni, R., Melgratti, H., Montanari, U., Olveczky P.C., Talcott C., Marti-Oliet N. "A normal form for stateful connectors" . Conference on Logic, Rewriting and Concurrency dedicated to Jose Meseguer on the Occasion of his 65th Birthday, 2015 9200 (2015) : 205-227.
http://dx.doi.org/10.1007/978-3-319-23165-5_9
---------- MLA ----------
Bruni, R., Melgratti, H., Montanari, U., Olveczky P.C., Talcott C., Marti-Oliet N. "A normal form for stateful connectors" . Conference on Logic, Rewriting and Concurrency dedicated to Jose Meseguer on the Occasion of his 65th Birthday, 2015, vol. 9200, 2015, pp. 205-227.
http://dx.doi.org/10.1007/978-3-319-23165-5_9
---------- VANCOUVER ----------
Bruni, R., Melgratti, H., Montanari, U., Olveczky P.C., Talcott C., Marti-Oliet N. A normal form for stateful connectors. Lect. Notes Comput. Sci. 2015;9200:205-227.
http://dx.doi.org/10.1007/978-3-319-23165-5_9