1,026 research outputs found

    On the generalized continuity equation

    Full text link
    A generalized continuity equation extending the ordinary continuity equation has been found using quanternions. It is shown to be compatible with Dirac, Schrodinger, Klein-Gordon and diffusion equations. This generalized equation is Lorentz invariant. The transport properties of electrons are found to be governed by Schrodinger-like equation and not by the diffusion equation.Comment: 9 Latex pages, no figure

    Coordination via Interaction Constraints I: Local Logic

    Full text link
    Wegner describes coordination as constrained interaction. We take this approach literally and define a coordination model based on interaction constraints and partial, iterative and interactive constraint satisfaction. Our model captures behaviour described in terms of synchronisation and data flow constraints, plus various modes of interaction with the outside world provided by external constraint symbols, on-the-fly constraint generation, and coordination variables. Underlying our approach is an engine performing (partial) constraint satisfaction of the sets of constraints. Our model extends previous work on three counts: firstly, a more advanced notion of external interaction is offered; secondly, our approach enables local satisfaction of constraints with appropriate partial solutions, avoiding global synchronisation over the entire constraints set; and, as a consequence, constraint satisfaction can finally occur concurrently, and multiple parts of a set of constraints can be solved and interact with the outside world in an asynchronous manner, unless synchronisation is required by the constraints. This paper describes the underlying logic, which enables a notion of local solution, and relates this logic to the more global approach of our previous work based on classical logic

    Statefinder Parameter for Varying G in Three Fluid System

    Full text link
    In this work, we have considered variable G in flat FRW universe filled with the mixture of dark energy, dark matter and radiation. If there is no interaction between the three fluids, the deceleration parameter and statefinder parameters have been calculated in terms of dimensionless density parameters which can be fixed by observational data. Also the interaction between three fluids has been analyzed due to constant GG. The statefinder parameters also calculated in two cases: pressure is constant and pressure is variable.Comment: 5 pages, Accepted for publication in "Astrophysics and Space Science

    Integrated Structure and Semantics for Reo Connectors and Petri Nets

    Full text link
    In this paper, we present an integrated structural and behavioral model of Reo connectors and Petri nets, allowing a direct comparison of the two concurrency models. For this purpose, we introduce a notion of connectors which consist of a number of interconnected, user-defined primitives with fixed behavior. While the structure of connectors resembles hypergraphs, their semantics is given in terms of so-called port automata. We define both models in a categorical setting where composition operations can be elegantly defined and integrated. Specifically, we formalize structural gluings of connectors as pushouts, and joins of port automata as pullbacks. We then define a semantical functor from the connector to the port automata category which preserves this composition. We further show how to encode Reo connectors and Petri nets into this model and indicate applications to dynamic reconfigurations modeled using double pushout graph transformation

    A Component-oriented Framework for Autonomous Agents

    Get PDF
    The design of a complex system warrants a compositional methodology, i.e., composing simple components to obtain a larger system that exhibits their collective behavior in a meaningful way. We propose an automaton-based paradigm for compositional design of such systems where an action is accompanied by one or more preferences. At run-time, these preferences provide a natural fallback mechanism for the component, while at design-time they can be used to reason about the behavior of the component in an uncertain physical world. Using structures that tell us how to compose preferences and actions, we can compose formal representations of individual components or agents to obtain a representation of the composed system. We extend Linear Temporal Logic with two unary connectives that reflect the compositional structure of the actions, and show how it can be used to diagnose undesired behavior by tracing the falsification of a specification back to one or more culpable components

    Quantitative analysis of reo- based service coordination

    Get PDF
    Quality of Service analysis of composed software systems is an active research area, with the goal of evaluating and improving performance and resource allocation in serviceoriented applications, namely, in the glue code –coordination layer– of such systems. Stochastic Reo offers constructs for service coordination and allows the specification of stochastic values for channels. But its state-of-the-art semantic models fail in several (important) ways. In this paper, we will see how Interactive Markov chains (IMC), proposed as astochastic compositional model of concurrency, can be effectively used to serve as a compositional semantic model for Stochastic Reo. Treating IMC as a direct semantic model, gives rise to more faithful models and has obvious efficiency advantages. Moreover, tool support that exists for IMC is made available, without significant effort, to verify and reason about the coordination layer modelled as Reo connectors.(undefined

    Bigraphical modelling of architectural patterns

    Get PDF
    Selected for publication in FACS'2011 post-proceedings, to appear in Springer Lecture Notes in Computer ScienceArchery is a language for behavioural modelling of architectural patterns, supporting hierarchical composition and a type discipline. This paper extends Archery to cope with the patterns' structural dimension through a set of (re-)configuration combinators and constraints that all instances of a pattern must obey. Both types and instances of architectural patterns are semantically represented as bigraphical reactive systems and operations upon them as reaction rules. Such a bigraphical semantics provides a rigorous model for Archery patterns and reduces constraint verification in architectures to a type-checking problem.(undefined

    Total Widths And Slopes From Complex Regge Trajectories

    Get PDF
    Maximally complex Regge trajectories are introduced for which both Re α(s)\alpha(s) and Im α(s)\alpha(s) grow as s1ϵs^{1-\epsilon} (ϵ\epsilon small and positive). Our expression reduces to the standard real linear form as the imaginary part (proportional to ϵ\epsilon) goes to zero. A scaling formula for the total widths emerges: ΓTOT/M\Gamma_{TOT}/M\to constant for large M, in very good agreement with data for mesons and baryons. The unitarity corrections also enhance the space-like slopes from their time-like values, thereby resolving an old problem with the ρ\rho trajectory in πN\pi N charge exchange. Finally, the unitarily enhanced intercept, αρ0.525\alpha_{\rho}\approx 0.525, \nolinebreak is in good accord with the Donnachie-Landshoff total cross section analysis.Comment: 9 pages, 3 Figure

    Nets, relations and linking diagrams

    Full text link
    In recent work, the author and others have studied compositional algebras of Petri nets. Here we consider mathematical aspects of the pure linking algebras that underly them. We characterise composition of nets without places as the composition of spans over appropriate categories of relations, and study the underlying algebraic structures.Comment: 15 pages, Proceedings of 5th Conference on Algebra and Coalgebra in Computer Science (CALCO), Warsaw, Poland, 3-6 September 201
    corecore