182 research outputs found

    Linear Types and Approximation

    No full text
    Published versio

    On the Model of Computation of Place/Transition Petri Nets

    No full text
    In the last few years, the semantics of Petri nets has been investigated in several different ways. Apart from the classical "token game", one can model the behaviour of Petri nets via non-sequential processes, via unfolding constructions, which provide formal relationships between nets and domains, and via algebraic models, which view Petri nets as essentially algebraic theories whose models are monoidal categories. In this paper we show that these three points of view can be reconciled. More precisely, we introduce the new notion of decorated processes of Petri nets and we show that they induce on nets the same semantics as that of unfolding. In addition, we prove that the decorated processes of a net N can be axiomatized as the arrows of a symmetric monoidal category which, therefore, provides the aforesaid unification

    Process versus Unfolding Semantics for Place/Transition Petri Nets

    Get PDF
    In the last few years, the semantics of Petri nets has been investigated in several different ways. Apart from the classical "token game," one can model the behaviour of Petri nets via non-sequential processes, via unfolding constructions, which provide formal relationships between nets and domains, and via algebraic models, which view Petri nets as essentially algebraic theories whose models are monoidal categories. In this paper we show that these three points of view can be reconciled. In our formal development a relevant role is played by DecOcc, a category of occurrence nets appropriately decorated to take into account the history of tokens. The structure of decorated occurrence nets at the same time provides natural unfoldings for Place/Transition (PT) nets and suggests a new notion of processes, the decorated processes, which induce on Petri nets the same semantics as that of unfolding. In addition, we prove that the decorated processes of a net can be axiomatized as the arrows of a symmetric monoidal category which, therefore, provides the aforesaid unification

    Noncommutative localization in noncommutative geometry

    Full text link
    The aim of these notes is to collect and motivate the basic localization toolbox for the geometric study of ``spaces'', locally described by noncommutative rings and their categories of one-sided modules. We present the basics of Ore localization of rings and modules in much detail. Common practical techniques are studied as well. We also describe a counterexample for a folklore test principle. Localization in negatively filtered rings arising in deformation theory is presented. A new notion of the differential Ore condition is introduced in the study of localization of differential calculi. To aid the geometrical viewpoint, localization is studied with emphasis on descent formalism, flatness, abelian categories of quasicoherent sheaves and generalizations, and natural pairs of adjoint functors for sheaf and module categories. The key motivational theorems from the seminal works of Gabriel on localization, abelian categories and schemes are quoted without proof, as well as the related statements of Popescu, Watts, Deligne and Rosenberg. The Cohn universal localization does not have good flatness properties, but it is determined by the localization map already at the ring level. Cohn localization is here related to the quasideterminants of Gelfand and Retakh; and this may help understanding both subjects.Comment: 93 pages; (including index: use makeindex); introductory survey, but with few smaller new result

    Cubical Approximation for Directed Topology II

    Full text link
    The paper establishes an equivalence between localizations of (diagrams of) cubical sets and (diagrams of) directed topological spaces by those maps defining (natural) cubical homotopy equivalences after application of the directed singular functor and a directed analogue of fibrant replacement. This equivalence both lifts and extends an equivalence between classical homotopy categories of cubical sets and topological spaces. Some simple applications include combinatorial descriptions and subsequent calculations of directed homotopy monoids and directed singular 1-cohomology monoids. Another application is a characterization of isomorphisms between small categories up to zig-zags of natural transformations as directed homotopy equivalences between directed classifying spaces. Cubical sets throughout the paper are taken to mean presheaves over the minimal symmetric monoidal variant of the cube category. Along the way, the paper characterizes morphisms in this variant as the interval-preserving lattice homomorphisms between finite Boolean lattice and describes some of the test model structure on presheaves over this variant.Comment: 54 pages, 1 illustration, submissio

    Relating two Hopf algebras built from an operad

    Full text link
    Starting from an operad, one can build a family of posets. From this family of posets, one can define an incidence Hopf algebra. By another construction, one can also build a group directly from the operad. We then consider its Hopf algebra of functions. We prove that there exists a surjective morphism from the latter Hopf algebra to the former one. This is illustrated by the case of an operad built on rooted trees, the \NAP operad, where the incidence Hopf algebra is identified with the Connes-Kreimer Hopf algebra of rooted trees.Comment: 21 pages, use graphics, 12 figures Version 2 : references added, minor changes. This version has not been corrected after submission. The final and corrected version will appear in IMRN and can be obtained from the author

    Glueing and Orthogonality for Models of Linear Logic

    Get PDF
    We present the general theory of the method of glueing and associated technique of orthogonality for constructing categorical models of all the structure of linear logic: in particular we treat the exponentials in detail. We indicate simple applications of the methods and show that they cover familiar examples.
    • …
    corecore