Related papers: A Categorical Semantics for Bounded Petri Nets
Metatheorems about type theories are often proven by interpreting the syntax into models constructed using categorical gluing. We propose to use only sconing (gluing along a global section functor) instead of general gluing. The sconing is…
We consider special quantum systems containing both distinguishable and identical constituents. It is shown that for these systems the Freudenthal construction based on cubic Jordan algebras naturally defines entanglement measures invariant…
We propose a framework for reasoning about unbounded dynamic networks of infinite-state processes. We propose Constrained Petri Nets (CPN) as generic models for these networks. They can be seen as Petri nets where tokens (representing…
We present a unified categorical framework that connects the syntactic Henkin construction for the first-order Completeness Theorem with Lawvere's Fixed-Point Theorem. Concretely, we define two canonical functors from the category of…
The notion of proof-net category defined in this paper is closely related to graphs implicit in proof nets for the multiplicative fragment without constant propositions of linear logic. Analogous graphs occur in Kelly's and Mac Lane's…
We show how to treat families of $\infty$-categories fibered in categorical patterns (e.g., $\infty$-operads and monoidal $\infty$-categories) in terms of fibrations by relativizing the Grothendieck construction. As applications, we…
In this article we give new examples of models in boundary quantum field theory, i.e. local time-translation covariant nets of von Neumann algebras, using a recent construction of Longo and Witten, which uses a local conformal net A on the…
This paper explores the relationship amongst the various simplicial and pseudo-simplicial objects characteristically associated to any bicategory C. It proves the fact that the geometric realizations of all of these possible candidate…
The execution of an event in a complex and distributed system where the dependencies vary during the evolution of the system can be represented in many ways, and one of them is to use Context-Dependent Event structures. Event structures are…
This paper is a sequel to "Logical systems I: Lambda calculi through discreteness". It provides a general 2-categorical setting for extensional calculi and shows how intensional and extensional calculi can be related in logical systems. We…
Locality is implemented in an arbitrary category using Grothendieck topologies. We explore how different Grothendieck topologies on one category can be related, and, more general, how functors between categories can preserve them. As…
We start from two closure operators defined on the elements of a special kind of partially ordered sets, called causal nets. Causal nets are used to model histories of concurrent processes, recording occurrences of local states and of…
In our paper we seek to address a shortcoming in the scientometric literature, namely that, given the proliferation of algorithmic approaches to topic detection from bibliometric data, there is a relative lack of studies that validate and…
Capturing stochastic behaviors in business and work processes is essential to quantitatively understand how nondeterminism is resolved when taking decisions within the process. This is of special interest in process mining, where event data…
Behaviors of many engineering systems are described by lumped parameter models that encapsulate the spatially distributed nature of the system into networks of lumped elements; the dynamics of such a network is governed by a system of…
We formalise a general concept of distributed systems as sequential components interacting asynchronously. We define a corresponding class of Petri nets, called LSGA nets, and precisely characterise those system specifications which can be…
We propose an extension with deterministically timed multiactions of discrete time stochastic and immediate Petri box calculus (dtsiPBC), previously presented by I.V. Tarasyuk, H. Maci\`a and V. Valero. In dtsdPBC, non-negative integers…
We formalise a general concept of distributed systems as sequential components interacting asynchronously. We define a corresponding class of Petri nets, called LSGA nets, and precisely characterise those system specifications which can be…
Let $k$ be a field. We show that locally presentable, $k$-linear categories $\mathcal{C}$ dualizable in the sense that the identity functor can be recovered as $\coprod_i x_i\otimes f_i$ for objects $x_i\in \mathcal{C}$ and left adjoints…
We prove that $\omega$-languages of (non-deterministic) Petri nets and $\omega$-languages of (non-deterministic) Turing machines have the same topological complexity: the Borel and Wadge hierarchies of the class of $\omega$-languages of…