37 research outputs found

    Dynamic Evolution of a Quasi-Spherical General Polytropic Magnetofluid with Self-Gravity

    Full text link
    In various astrophysical contexts, we analyze self-similar behaviours of magnetohydrodynamic (MHD) evolution of a quasi-spherical polytropic magnetized gas under self-gravity with the specific entropy conserved along streamlines. In particular, this MHD model analysis frees the scaling parameter nn in the conventional polytropic self-similar transformation from the constraint of n+γ=2n+\gamma=2 with γ\gamma being the polytropic index and therefore substantially generalizes earlier analysis results on polytropic gas dynamics that has a constant specific entropy everywhere in space at all time. On the basis of the self-similar nonlinear MHD ordinary differential equations, we examine behaviours of the magnetosonic critical curves, the MHD shock conditions, and various asymptotic solutions. We then construct global semi-complete self-similar MHD solutions using a combination of analytical and numerical means and indicate plausible astrophysical applications of these magnetized flow solutions with or without MHD shocks.Comment: 21 pages, 7 figures, accepted for publication in APS

    Probabilistic Chemical Abstract Machine and the Expressiveness of Linda Languages

    No full text
    The Chemical Abstract Machine of Berry and Boudol provides a commonly accepted, uniform framework for describing the operational semantics of various process calculi and languages, such as for example CCS, the pi-calculus and coordination languages like Linda. In its original form the CHAM is purely non-deterministic and thus only describes what reactions are `possible' but not how long it will take (in the average) before a certain reaction takes place or its probability. Such quantitative information is however often vital for ``real world'' applications such as systems biology or performance analysis. We propose a probabilistic version of the CHAM. We then define a linear operator semantics for the probabilistic CHAM which exploits a tensor product representation for distributions over possible solutions. Based on this we propose a novel approach towards comparing the expressive power of different calculi via their encoding in the probabilistic CHAM. We illustrate our approach by comparing the expressiveness of various Linda Languages
    corecore