Arquitetura multiprocessada e reconfigurável para a síntese de redes de Petri em hardware

Uma arquitetura reconfigurável e multiprocessada para a implementação física de Redes de Petri foi desenvolvida em VHDL e mapeada sobre um FPGA. Convencionalmente, as Redes de Petri são transformadas em uma linguagem de descrição de hardware no nível de transferências entre registradores e um processo de síntese de alto nível é utilizado para gerar as funções booleanas e tabelas de transição de estado para que se possa, finalmente, mapeá-las num FPGA (Morris et al., 2000) (Soto and Pereira, 2001). A arquitetura proposta possui blocos lógicos reconfiguráveis desenvolvidos exclusivamente para a implementação dos lugares e das transições da rede, não sendo necessária a descrição da rede em níveis de abstração intermediários e nem a utilização de um processo de síntese para realizar o mapeamento da rede na arquitetura. A arquitetura permite o mapeamento de modelos de Redes de Petri com diferenciação entre as marcas e associação de tempo no disparo das transições, sendo composta por um arranjo de processadores reconfiguráveis, cada um dos quais representando o comportamento de uma transição da Rede de Petri a ser mapeada e por um sistema de comunicação, implementado por um conjunto de roteadores que são capazes de enviar pacotes de dados de um processador reconfigurável a outro. A arquitetura proposta foi validada num FPGA de 10.570 elementos lógicos com uma topologia que permitiu a implementação de Redes de Petri de até 9 transições e 36 lugares, atingindo uma latência de 15,4ns e uma vazão de até 17,12GB/s com uma freqüência de operação de 64,58MHz.

Branch and bound algorithm for transmission network expansion planning using DC model

This paper presents an algorithm to solve the network transmission system expansion planning problem using the DC model which is a mixed non-linear integer programming problem. The major feature of this work is the use of a Branch-and-Bound (B&B) algorithm to directly solve mixed non-linear integer problems. An efficient interior point method is used to solve the non-linear programming problem at each node of the B&B tree. Tests with several known systems are presented to illustrate the performance of the proposed method. ©2007 IEEE.

Aperfeiçoamento do método clause-column table para a geração eficiente de implicantes primos

Pós-graduação em Engenharia Elétrica - FEIS

Composition and invertibility for a class of generalized functions in the Colombeau's theory

In this work we define the composite function for a special class of generalized mappings and we study the invertibility for a certain class of generalized functions with real values.

Equivalence of many-photon Green's functions in the Duffin-Kemmer-Petiau and Klein-Gordon-Fock statistical quantum field theories

Using the functional integral formalism for the statistical generating functional in the statistical (finite temperature) quantum field theory, we prove the equivalence of many-photon Greens functions in the Duffin-Kennner-Petiau and Klein-Gordon-Fock statistical quantum field theories. As an illustration, we calculate the one-loop polarization operators in both theories and demonstrate their coincidence.

Equivalence of many-gluon Green's functions in the Duffin-Kemmer-Petieu and Klein-Gordon-Fock statistical quantum field theories

We prove the equivalence of many-gluon Green's functions in the Duffin-Kemmer-Petieu and Klein-Gordon-Fock statistical quantum field theories. The proof is based on the functional integral formulation for the statistical generating functional in a finite-temperature quantum field theory. As an illustration, we calculate one-loop polarization operators in both theories and show that their expressions indeed coincide.

Composition for a class of generalized functions in Colombeau's theory

In Colombeau's theory, given an open subset Ω of ℝn, there is a differential algebra G(Ω) of generalized functions which contains in a natural way the space D′(Ω) of distributions as a vector subspace. There is also a simpler version of the algebra G,(Ω). Although this subalgebra does not contain, in canonical way, the space D′(Ω) is enough for most applications. This work is developed in the simplified generalized functions framework. In several applications it is necessary to compute higher intrinsic derivatives of generalized functions, and since these derivatives are multilinear maps, it is necessary to define the space of generalized functions in Banach spaces. In this article we introduce the composite function for a special class of generalized mappings (defined in open subsets of Banach spaces with values in Banach spaces) and we compute the higher intrinsic derivative of this composite function.

Wigner distribution for a class of isospectral position-dependent mass systems

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Laguerre polynomials as Jensen polynomials of Laguerre-Polya entire functions

We prove that the only Jensen polynomials associated with an entire function in the Laguerre-Polya class that are orthogonal are the Laguerre polynomials. (C) 2009 Elsevier B.V. All rights reserved.

Schur-SzegA composition of entire functions

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

BASIC HYPERGEOMETRIC FUNCTIONS and ORTHOGONAL LAURENT POLYNOMIALS

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Topological K-equivalence of analytic function-germs

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

On equivalence of Duffin-Kemmer-Petiau and Klein-Gordon equations

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Generalized squeezing operators, bipartite Wigner functions and entanglement via Wehrl's entropy functionals

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

On the value function for nonautonomous optimal control problems with infinite horizon

In this paper we consider nonautonomous optimal control problems of infinite horizon type, whose control actions are given by L-1-functions. We verify that the value function is locally Lipschitz. The equivalence between dynamic programming inequalities and Hamilton-Jacobi-Bellman (HJB) inequalities for proximal sub (super) gradients is proven. Using this result we show that the value function is a Dini solution of the HJB equation. We obtain a verification result for the class of Dini sub-solutions of the HJB equation and also prove a minimax property of the value function with respect to the sets of Dini semi-solutions of the HJB equation. We introduce the concept of viscosity solutions of the HJB equation in infinite horizon and prove the equivalence between this and the concept of Dini solutions. In the Appendix we provide an existence theorem. (c) 2006 Elsevier B.V. All rights reserved.