Imagen de Portada

Consistency of P-time event graphs is decidable in polynomial time (extended version)

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zorzenon, Davide, Raisch, Jörg
Formato:	Preprint
Publicado:	2023
Materias:	Logic in Computer Science Discrete Mathematics Systems and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Weak consistency of P-time event graphs
por: Zorzenon, Davide, et al.
Publicado: (2022)

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

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

The domino problem is decidable for robust tilesets
por: Aubrun, Nathalie, et al.
Publicado: (2024)

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

Some remarks on the uncolored versions of the original CFI-graphs
por: Chen, Yijia, et al.
Publicado: (2025)

Statistical Model Checking Beyond Means: Quantiles, CVaR, and the DKW Inequality (extended version)
por: Budde, Carlos E., et al.
Publicado: (2025)

Computability of extender sets in multidimensional subshifts: asymptotic growths, dynamical constraints
por: Callard, Antonin, et al.
Publicado: (2024)

On first-order transductions of classes of graphs
por: Braunfeld, Samuel, et al.
Publicado: (2022)

Epsilon-saturation for stable graphs and Littlestone classes
por: Malliaris, Maryanthe, et al.
Publicado: (2025)

Efficient reversal of transductions of sparse graph classes
por: Dreier, Jan, et al.
Publicado: (2026)

Decomposition horizons and a characterization of stable hereditary classes of graphs
por: Braunfeld, Samuel, et al.
Publicado: (2022)

On Piecewise Affine Reachability with Bellman Operators
por: Varonka, Anton, et al.
Publicado: (2025)

FO logic on cellular automata orbits equals MSO logic
por: Theyssier, Guillaume
Publicado: (2024)

First order distinguishability of sparse random graphs
por: Hershko, Tal, et al.
Publicado: (2024)

First-order transducibility among classes of sparse graphs
por: Gajarský, Jakub, et al.
Publicado: (2025)

3D-grids are not transducible from planar graphs
por: Gajarský, Jakub, et al.
Publicado: (2025)

First-order logic axiomatization of metric graph theory
por: Chalopin, Jérémie, et al.
Publicado: (2022)

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
por: Fuchser, Janne, et al.
Publicado: (2025)

Nested Sequents for Intuitionistic Grammar Logics via Structural Refinement
por: Lyon, Tim S.
Publicado: (2022)

Logic-based analogical proportions
por: Antić, Christian
Publicado: (2024)

Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
por: Adler, Isolde, et al.
Publicado: (2025)

Boolean Variation and Boolean Logic BackPropagation
por: Nguyen, Van Minh
Publicado: (2023)

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
por: Roberson, David E., et al.
Publicado: (2023)

Advances in Algorithmic Meta Theorems
por: Siebertz, Sebastian, et al.
Publicado: (2024)

Separability Properties of Monadically Dependent Graph Classes
por: Bonnet, Édouard, et al.
Publicado: (2025)

Existential Positive Transductions of Sparse Graphs
por: Mählmann, Nikolas, et al.
Publicado: (2026)

Characterizations of monadically dependent tree-ordered weakly sparse structures
por: Buffière, Hector, et al.
Publicado: (2026)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
por: Mählmann, Nikolas
Publicado: (2025)

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
por: Dreier, Jan, et al.
Publicado: (2024)

Learning Foundations Beneath the Stars
por: Cardone, Felice, et al.
Publicado: (2026)

On the Subspace Orbit Problem and the Simultaneous Skolem Problem
por: Bacik, Piotr, et al.
Publicado: (2026)

Home Spaces and Invariants to Analyze Parameterized Petri Nets
por: Memmi, Gerard
Publicado: (2024)

SAT-Solving the Poset Cover Problem
por: Yuan, Chih-Cheng Rex, et al.
Publicado: (2025)

Continuous Petri Nets Faithfully Fluidify Most Permissive Boolean Networks
por: Haar, Stefan, et al.
Publicado: (2025)

Verifying Sampling Algorithms via Distributional Invariants
por: Zilken, Daniel, et al.
Publicado: (2025)

On the number of asynchronous attractors in AND-NOT Boolean networks
por: Trinh, Van-Giang, et al.
Publicado: (2025)

Hypergraph rewriting and Causal structure of $λ-$calculus
por: Bajaj, Utkarsh
Publicado: (2024)

Incremental SAT-Based Enumeration of Solutions to the Yang-Baxter Equation
por: Van Caudenberg, Daimy, et al.
Publicado: (2025)