English
Related papers

Related papers: Structural Liveness of Conservative Petri Nets

200 papers

This paper studies network resilience against structured additive perturbations to its topology. We consider dynamic networks modeled as linear time-invariant systems subject to perturbations of bounded energy satisfying specific sparsity…

Systems and Control · Electrical Eng. & Systems 2021-05-18 Shenyu Liu , Sonia Martinez , Jorge Cortes

Event structures have emerged as a foundational model for concurrent computation, explaining computational processes by outlining the events and the relationships that dictate their execution. They play a pivotal role in the study of key…

Computation and Language · Computer Science 2023-12-29 Hernán Melgratti , Claudio Antares Mezzina , G. Michele Pinna

Components in many real-world complex systems depend on each other for the resources required for survival, and may die of a shortage. These patterns of dependencies often take the form of a complex network whose structure potentially…

Physics and Society · Physics 2022-02-04 Madhusudan Ingale , Snehal M. Shekatkar

We introduce the concept of natural connectivity as a robustness measure of complex networks. The natural connectivity has a clear physical meaning and a simple mathematical formulation. It characterizes the redundancy of alternative paths…

Statistical Mechanics · Physics 2008-02-20 Jun Wu , Yue-Jin Tan , Hong-Zhong Deng , Yong Li , Bin Liu , Xin Lv

Research on the vulnerability of electric networks with a complex network approach has produced significant results in the last decade, especially for transmission networks. These studies have shown that there are causal relations between…

Physics and Society · Physics 2024-09-11 Bálint Hartmann , Tamás Soha , Michelle T. Cirunay , Tímea Erdei

In this paper, we study the structure of set-multilinear arithmetic circuits and set-multilinear branching programs with the aim of showing lower bound results. We define some natural restrictions of these models for which we are able to…

Computational Complexity · Computer Science 2015-11-10 V. Arvind , S. Raja

We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…

Data Structures and Algorithms · Computer Science 2019-02-15 Zeev Dvir , Alexander Golovnev , Omri Weinstein

In 1987 Ernst-R\"udiger Olderog provided an operational Petri net semantics for a subset of CCSP, the union of Milner's CCS and Hoare's CSP. It assigns to each process term in the subset a labelled, safe place/transition net. To demonstrate…

Logic in Computer Science · Computer Science 2015-09-22 Rob van Glabbeek

Place/Transition Petri nets with inhibitor arcs (PTI nets for short), which are a well-known Turing-complete, distributed model of computation, are equipped with a decidable, behavioral equivalence, called pti-place bisimilarity, that…

Logic in Computer Science · Computer Science 2022-11-03 Arnaldo Cesco , Roberto Gorrieri

The coverability problem for Petri nets plays a central role in the verification of concurrent shared-memory programs. However, its high EXPSPACE-complete complexity poses a challenge when encountered in real-world instances. In this paper,…

Logic in Computer Science · Computer Science 2017-03-24 Michael Blondin , Alain Finkel , Christoph Haase , Serge Haddad

Complex networks are ubiquitous: a cell, the human brain, a group of people and the Internet are all examples of interconnected many-body systems characterized by macroscopic properties that cannot be trivially deduced from those of their…

After rapidly recalling basic notations relatively to semiflows and Petri nets, we define F, the set of semiflows over Z that we associate with a specific class of invariants. We then focus on F+, the set of semiflows with non-negative…

Formal Languages and Automata Theory · Computer Science 2025-11-13 Gerard Memmi

Persistent homology is a fundamental tool in topological data analysis; however, it lacks methods to quantify the fragility or fineness of cycles, anticipate their formation or disappearance, or evaluate their stability beyond persistence.…

Algebraic Topology · Mathematics 2025-05-16 Pablo Hernández-García , Daniel Hernández Serrano , Darío Sánchez Gómez

Inspired by Anderson et al. [J. R. Soc. Interface, 2014] we study the long-term behavior of discrete chemical reaction networks (CRNs). In particular, using techniques from both Petri net theory and CRN theory, we provide a powerful…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-06-16 Robert Brijder

The analysis of biological networks has benefited from the richness of Boolean networks (BNs) and the associated theory. These results have been further fortified in recent years by the emergence of Most Permissive (MP) semantics, combining…

Discrete Mathematics · Computer Science 2025-05-26 Stefan Haar , Juri Kolčák

Classical conditions for ensuring the robust stability of a linear system in feedback with a sector-bounded nonlinearity include small gain, circle, passivity, and conicity theorems. In this work, we present a similar stability condition,…

Optimization and Control · Mathematics 2019-09-18 Saman Cyrus , Laurent Lessard

Elementary Object Systems (EOS) are a form of Petri Net (PN) where tokens carry internal PN. This model has been recently proposed for analysis of robustness of Multi Agent Systems. While EOS reachability is known to be undecidable, the…

Computational Complexity · Computer Science 2025-04-07 Francesco Di Cosmo , Soumodev Mal , Tephilla Prince

A classic measure of ecological stability describes the tendency of a community to return to equilibrium after small perturbation. While many advances show how the network structure of these communities severely constrains such tendencies,…

Populations and Evolution · Quantitative Biology 2015-06-09 Gang Yan , Neo D. Martinez , Yang-Yu Liu

We consider a damped linear hyperbolic system modelling the propagation of pressure waves in a network of pipes. Well-posedness is established via semi-group theory and the existence of a unique steady state is proven in the absence of…

Numerical Analysis · Mathematics 2016-05-11 Herbert Egger , Thomas Kugler

We build on the correspondence between Petri nets and free symmetric strict monoidal categories already investigated in the literature, and present a categorical semantics for Petri nets with guards. This comes in two flavors: Deterministic…

Category Theory · Mathematics 2020-12-14 Fabrizio Genovese , David I. Spivak
‹ Prev 1 3 4 5 6 7 10 Next ›