English
Related papers

Related papers: Compositional Semantics of Finite Petri Nets

200 papers

In this short note, we are interested in discussing characteristics of finite generating sets for $\mathcal{F}$, the set of all semiflows with non negative coefficients of a Petri Net. By systematically positioning these results over semi…

Formal Languages and Automata Theory · Computer Science 2023-02-06 Gerard Memmi

We show that the EXPSPACE-hardness result for structural liveness of Petri nets [Jancar and Purser, 2019] holds even for a simple subclass of conservative nets. As our main result, we prove that for structurally live conservative nets, the…

Logic in Computer Science · Computer Science 2026-04-22 Petr Jančar , Jérôme Leroux , Jiří Valůšek

Biomolecular structure comparison not only reveals evolutionary relationships, but also sheds light on biological functional properties. However, traditional definitions of structure or sequence similarity always involve superposition or…

Quantitative Methods · Quantitative Biology 2017-07-13 Kelin Xia

Compositionality of denotational semantics is an important concern in programming semantics. Mathematical operational semantics in the sense of Turi and Plotkin guarantees compositionality, but seen from the point of view of stateful…

Logic in Computer Science · Computer Science 2022-05-12 Sergey Goncharov , Stefan Milius , Lutz Schröder , Stelios Tsampas , Henning Urbat

We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…

Logic in Computer Science · Computer Science 2014-01-24 Abhisekh Sankaran , Bharat Adsul , Supratik Chakraborty

We describe a basic correspondence between linear algebraic structures within vector embeddings in artificial neural networks and conditional independence constraints on the probability distributions modeled by these networks. Our framework…

Machine Learning · Computer Science 2024-07-15 Matthew Trager , Alessandro Achille , Pramuditha Perera , Luca Zancato , Stefano Soatto

Probabilistic transition system specifications using the rule format ntmuft-ntmuxt provide structural operational semantics for Segala-type systems and guarantee that probabilistic bisimilarity is a congruence. Probabilistic bisimilarity is…

Logic in Computer Science · Computer Science 2013-07-30 Daniel Gebler , Simone Tini

We present a model-theoretic property of finite structures, that can be seen to be a finitary analogue of the well-studied downward L\"owenheim-Skolem property from classical model theory. We call this property as the…

Logic in Computer Science · Computer Science 2017-05-15 Abhisekh Sankaran

Compositionality has traditionally been understood as a major factor in productivity of language and, more broadly, human cognition. Yet, recently, some research started to question its status, showing that artificial neural networks are…

Computation and Language · Computer Science 2022-06-13 Michal Auersperger , Pavel Pecina

This note considers the notion of divergence-preserving branching bisimilarity. It briefly surveys results pertaining to the notion that have been obtained in the past one-and-a-half decade, discusses its role in the study of expressiveness…

Logic in Computer Science · Computer Science 2020-09-01 Bas Luttik

In this paper we revisit some pioneering efforts to equip Petri nets with compact operational models for expressing causality. The models we propose have a bisimilarity relation and a minimal representative for each equivalence class, and…

Logic in Computer Science · Computer Science 2015-07-24 Roberto Bruni , Ugo Montanari , Matteo Sammartino

One of the basic sanity properties of a behavioural semantics is that it constitutes a congruence with respect to standard process operators. This issue has been traditionally addressed by the development of rule formats for transition…

Logic in Computer Science · Computer Science 2010-08-13 Maciej Gazda , Wan Fokkink

This paper presents a compositional conformance checking approach between nested Petri nets and event logs of multi-agent systems. By projecting an event log onto model components, one can perform conformance checking between each projected…

Software Engineering · Computer Science 2020-03-17 Khalil Mecheraoui , Julio C. Carrasquel , Irina A. Lomazova

Recent work by the authors equips Petri occurrence nets (PN) with probability distributions which fully replace nondeterminism. To avoid the so-called confusion problem, the construction imposes additional causal dependencies which restrict…

Logic in Computer Science · Computer Science 2018-07-18 Roberto Bruni , Hernán Melgratti , Ugo Montanari

In this paper we show that the dynamics of a class of kinetic compartmental models with bounded capacities, monotone reaction rates and a strongly connected interconnection structure is persistent. The result is based on the chemical…

Dynamical Systems · Mathematics 2022-01-25 G. Szederkenyi , B. Acs , Gy. Liptak , M. A. Vaghy

Digital circuits, despite having been studied for nearly a century and used at scale for about half that time, have until recently evaded a fully compositional theoretical in which arbitrary circuits may be freely composed together without…

Logic in Computer Science · Computer Science 2026-05-25 Dan R. Ghica , George Kaye , David Sprunger

For every finite Petri net, we construct a commutative polynomial in two variables and with coefficients from the semiring of natural numbers. We also present an inverse construction and show that multiplication of polynomials…

Logic in Computer Science · Computer Science 2017-06-27 Andrey Grinblat , Viktor Lopatkin

A recent line of work in NLP focuses on the (dis)ability of models to generalise compositionally for artificial languages. However, when considering natural language tasks, the data involved is not strictly, or locally, compositional.…

Computation and Language · Computer Science 2023-02-01 Verna Dankers , Ivan Titov

It is known for decades that computer-based systems cannot be understood without a concept of modularization and decomposition. We suggest a universal, expressive, intuitively attractive composition operator for Petri nets, combined with a…

Software Engineering · Computer Science 2022-02-07 Peter Fettke , Wolfgang Reisig

This paper studies the existence of finite equational axiomatisations of the interleaving parallel composition operator modulo the behavioural equivalences in van Glabbeek's linear time-branching time spectrum. In the setting of the process…

Logic in Computer Science · Computer Science 2023-06-22 Luca Aceto , Valentina Castiglioni , Anna Ingolfsdottir , Bas Luttik , Mathias R. Pedersen