skip to main content
Visitante
Meu Espaço
Minha Conta
Sair
Identificação
This feature requires javascript
Tags
Revistas Eletrônicas (eJournals)
Livros Eletrônicos (eBooks)
Bases de Dados
Bibliotecas USP
Ajuda
Ajuda
Idioma:
Inglês
Espanhol
Português
This feature required javascript
This feature requires javascript
Primo Search
Busca Geral
Busca Geral
Acervo Físico
Acervo Físico
Produção Intelectual da USP
Produção USP
Search For:
Clear Search Box
Search in:
Busca Geral
Or select another collection:
Search in:
Busca Geral
Busca Avançada
Busca por Índices
This feature requires javascript
This feature requires javascript
Structured coalgebras and minimal HD-automata for the π -calculus
Montanari, Ugo ; Pistore, Marco
Theoretical computer science, 2005-08, Vol.340 (3), p.539-576
[Periódico revisado por pares]
Amsterdam: Elsevier B.V
Texto completo disponível
Citações
Citado por
Exibir Online
Detalhes
Resenhas & Tags
Mais Opções
Nº de Citações
This feature requires javascript
Enviar para
Adicionar ao Meu Espaço
Remover do Meu Espaço
E-mail (máximo 30 registros por vez)
Imprimir
Link permanente
Referência
EasyBib
EndNote
RefWorks
del.icio.us
Exportar RIS
Exportar BibTeX
This feature requires javascript
Título:
Structured coalgebras and minimal HD-automata for the π -calculus
Autor:
Montanari, Ugo
;
Pistore, Marco
Assuntos:
[formula omitted]-calculus
;
Algorithmics. Computability. Computer arithmetics
;
Applied sciences
;
Automata theory
;
Automata. Abstract machines. Turing machines
;
Categorical models and logics
;
Coinductive techniques
;
Computer science
;
control theory
;
systems
;
Concurrency and distributed computation
;
Exact sciences and technology
;
General logic
;
Logic and foundations
;
Mathematical logic, foundations, set theory
;
Mathematics
;
Sciences and techniques of general use
;
Theoretical computing
É parte de:
Theoretical computer science, 2005-08, Vol.340 (3), p.539-576
Descrição:
The coalgebraic framework developed for the classical process algebras, and in particular its advantages concerning minimal realizations, does not fully apply to the π -calculus, due to the constraints on the freshly generated names that appear in the bisimulation. In this paper we propose to model the transition system of the π -calculus as a coalgebra on a category of name permutation algebras and to define its abstract semantics as the final coalgebra of such a category. We show that permutations are sufficient to represent in an explicit way fresh name generation, thus allowing for the definition of minimal realizations. We also link the coalgebraic semantics with a slightly improved version of history dependent (HD) automata, a model developed for verification purposes, where states have local names and transitions are decorated with names and name relations. HD-automata associated with agents with a bounded number of threads in their derivatives are finite and can be actually minimized. We show that the bisimulation relation in the coalgebraic context corresponds to the minimal HD-automaton.
Editor:
Amsterdam: Elsevier B.V
Idioma:
Inglês
Links
View record in Pascal Francis
This feature requires javascript
This feature requires javascript
Voltar para lista de resultados
This feature requires javascript
This feature requires javascript
Buscando em bases de dados remotas. Favor aguardar.
Buscando por
em
scope:(USP_PRODUCAO),scope:(USP_EBOOKS),scope:("PRIMO"),scope:(USP),scope:(USP_EREVISTAS),scope:(USP_FISICO),primo_central_multiple_fe
Mostrar o que foi encontrado até o momento
This feature requires javascript
This feature requires javascript