Cover Image

Weak consistency of P-time event graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zorzenon, Davide, Balun, Jiří, Raisch, Jörg
Format:	Preprint
Published:	2022
Subjects:	Systems and Control Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Infinite precedence graphs for consistency verification in P-time event graphs
by: Zorzenon, Davide, et al.
Published: (2025)

Consistency of P-time event graphs is decidable in polynomial time (extended version)
by: Zorzenon, Davide, et al.
Published: (2023)

Periodic trajectories in P-time event graphs and the non-positive circuit weight problem
by: Zorzenon, Davide, et al.
Published: (2021)

Switched max-plus linear-dual inequalities: cycle time analysis and applications
by: Zorzenon, Davide, et al.
Published: (2023)

Controlled Invariance in Fully Actuated Max-plus Linear Systems with Precedence Semimodules
by: Zorzenon, Davide, et al.
Published: (2025)

Brute-force search and Warshall algorithms for matrix-weighted graphs
by: Trinh, Minh Hoang, et al.
Published: (2025)

Switched max-plus linear-dual inequalities for makespan minimization: the case study of an industrial bakery shop
by: Zorzenon, Davide, et al.
Published: (2022)

Switched Max-Plus Linear-Dual Inequalities: Application in Scheduling of Multi-Product Processing Networks
by: Zorzenon, Davide, et al.
Published: (2022)

A Method for Constructing Wavelet Functions on the Real Number Field
by: Li, Ning, et al.
Published: (2024)

Characterizing Flow Complexity in Transportation Networks using Graph Homology
by: Deshpande, Shashank A, et al.
Published: (2024)

Economic Dispatch of a Single Micro-Gas Turbine Under CHP Operation with Uncertain Demands
by: Sharf, Miel, et al.
Published: (2021)

Low Complexity Method for Simulation of Epidemics Based on Dijkstra's Algorithm
by: Zorzenon, Davide, et al.
Published: (2020)

Online Algorithm for Node Feature Forecasting in Temporal Graphs
by: Rahman, Aniq Ur, et al.
Published: (2024)

Cluster Assignment in Multi-Agent Systems
by: Sharf, Miel, et al.
Published: (2022)

The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory
by: Zorzenon, Davide, et al.
Published: (2021)

Data-Driven Nonlinear Regulation: Gaussian Process Learning
by: Harry, Telema, et al.
Published: (2025)

Filling in pattern designs for incomplete pairwise comparison matrices: (quasi-)regular graphs with minimal diameter
by: Bozóki, Sándor, et al.
Published: (2020)

Fixed Point Certificates for Reachability and Expected Rewards in MDPs
by: Chatterjee, Krishnendu, et al.
Published: (2025)

Topological Graph Simplification Solutions to the Street Intersection Miscount Problem
by: Boeing, Geoff
Published: (2024)

Scheduling on identical machines with conflicts to minimize the mean flow time
by: Tellache, Nour ElHouda, et al.
Published: (2025)

Analysis and Mitigation of Cascading Failures Using a Stochastic Interaction Graph with Eigen-analysis
by: Guo, Zhenping, et al.
Published: (2025)

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
by: Moldenhauer, Carsten, et al.
Published: (2025)

A Bilevel Integer Programming Approach for the Synchronous Attractor Control Problem
by: Moon, Kyungduk, et al.
Published: (2026)

On the Performance of Linear Adaptive Filters driven by the Ergodic Chaotic Logistic Map
by: Mueller, Andreas
Published: (2025)

Conformally rigid graphs
by: Steinerberger, Stefan, et al.
Published: (2024)

Integer Traffic Assignment Problem: Algorithms and Insights on Random Graphs
by: Harfouche, Rayan, et al.
Published: (2024)

Two-person Positive Shortest Path Games Have Nash Equilibria in Pure Stationary Strategies
by: Boros, Endre, et al.
Published: (2024)

A Copositive Framework for Analysis of Hybrid Ising-Classical Algorithms
by: Brown, Robin, et al.
Published: (2022)

Weak coloring numbers of minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

Weakly and Strongly Aperiodic Subshifts of Finite Type on Baumslag-Solitar Groups
by: Esnay, Solène J., et al.
Published: (2020)

An SDP Relaxation for the Sparse Integer Least Squares Problem
by: Del Pia, Alberto, et al.
Published: (2022)

Rank-one Boolean tensor factorization and the multilinear polytope
by: Del Pia, Alberto, et al.
Published: (2022)

Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
by: Lozano, Leonardo, et al.
Published: (2022)

Minimum Cut Representability of Stable Matching Problems
by: Faenza, Yuri, et al.
Published: (2025)

Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions
by: Alidaee, Bahram, et al.
Published: (2024)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
by: Proença, Nathan Benedetto, et al.
Published: (2026)

Geoffrion's theorem beyond finiteness and rationality
by: Dey, Santanu S., et al.
Published: (2025)

Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
by: Wang, Changjun, et al.
Published: (2026)

On the Virtual Network Embedding polytope
by: Benhamiche, Amal, et al.
Published: (2026)

Facet-Defining Inequalities for the Angle-Based DC Optimal Transmission Switching Formulation
by: Jabbari-Marand, Behnam, et al.
Published: (2026)