A Calculus for Team Automata (Contributo in atti di convegno)

Type

• Prodotto della ricerca (Classe)
• Contributo in atti di convegno (Classe)

Label

• A Calculus for Team Automata (Contributo in atti di convegno) (literal)

Anno

• 2008-01-01T00:00:00+01:00 (literal)

Alternative label

• Ter Beek M. H.; Gadducci F.; Janssens D. (2008)
  A Calculus for Team Automata
  in Brazilian Symposium on Formal Methods (SBMF'06), Natal, Rio Grande do Norte, Br
  (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori

• Ter Beek M. H.; Gadducci F.; Janssens D. (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note

• In: Brazilian Symposium on Formal Methods (SBMF'06) (Natal, Rio Grande do Norte, Brazil, 17-23 Settembre 2006). Proceedings, pp. 41 - 55. A. Martins Moreira and L. Ribeiro (eds.). (Electronic Notes in Theoretical Computer Science, vol. 195, 3). Elsevier Science Publishers, Amsterdam, 2008. (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#descrizioneSinteticaDelProdotto

• ABSTRACT: Team automata are a formalism for the component-based specification of reactive, distributed systems. Their main feature is a flexible technique for specifying coordination patterns among systems, thus extending I/O automata. Furthermore, for some patterns the language recognized by a team automaton can be specified via those languages recognized by its components. We introduce a process calculus tailored over team automata. Each automaton is described by a process, such that its associated (fragment of a) labeled transition system is bisimilar to the original automaton. The mapping is moreover denotational, since the operators defined on processes are in a bijective correspondence with a chosen family of coordination patterns and that correspondence is preserved by the mapping. We thus extend to team automata a few classical results on I/O automata and their representation by process calculi. Moreover, besides providing a language for expressing team automata, we widen the family of coordination patterns for which an equational characterization of the language associated to a composite automaton can be provided. The latter result is obtained by providing a set of axioms, in ACP-style, for capturing bisimilarity in our calculus. (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni

• CNR-ISTI, Pisa (literal)

Titolo

• A Calculus for Team Automata (literal)

Prodotto di

• Metodi e Strumenti per la Progettazione di Sistemi Software-Intensive ad Elevata Complessità (ICT.P09.008.002) (Modulo)
• Istituto di scienza e tecnologie dell'informazione \"Alessandro Faedo\" (ISTI) (Istituto)

Autore CNR

• MAURICE HENRI TER BEEK (Persona)

Insieme di parole chiave

• Keywords of "A Calculus for Team Automata" (Insieme di parole chiave)

Incoming links:

Prodotto

• Istituto di scienza e tecnologie dell'informazione \"Alessandro Faedo\" (ISTI) (Istituto)
• Metodi e Strumenti per la Progettazione di Sistemi Software-Intensive ad Elevata Complessità (ICT.P09.008.002) (Modulo)

Autore CNR di

• MAURICE HENRI TER BEEK (Persona)

Insieme di parole chiave di

• Keywords of "A Calculus for Team Automata" (Insieme di parole chiave)