Cover Image

Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	André, Étienne, Lime, Didier, Roux, Olivier H.
Format:	Preprint
Published:	2023
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On-The-Fly Symbolic Algorithm for Timed ATL with Abstractions
by: Jensen, Nicolaj Ø., et al.
Published: (2025)

Parametric disjunctive timed networks
by: André, Étienne, et al.
Published: (2025)

Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
by: Lommen, Nils, et al.
Published: (2023)

Compositional Reasoning for Parametric Probabilistic Automata
by: Mertens, Hannah, et al.
Published: (2025)

Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic (Technical Report)
by: Habermehl, Peter, et al.
Published: (2024)

Intersecting Dense Automata
by: Chistikov, Dmitry, et al.
Published: (2026)

Targeting Completeness: Automated Complexity Analysis of Integer Programs
by: Lommen, Nils, et al.
Published: (2024)

Sound Conflict Analysis for Timed Contract Automata
by: Azzopardi, Shaun, et al.
Published: (2024)

Lower Bounds on Inverse Cellular Automata via Proof Complexity
by: Kapytka, Maryia
Published: (2026)

Automata-Theoretic Characterisations of Branching-Time Temporal Logics
by: Benerecetti, Massimo, et al.
Published: (2024)

Technical Report: Time-Bounded Resilience
by: Kirigin, Tajana Ban, et al.
Published: (2024)

Overview and Roadmap of Team Automata
by: ter Beek, Maurice H., et al.
Published: (2025)

Step Automata
by: Wang, Yong
Published: (2026)

Decidability of Quasi-Dense Modal Logics
by: Ostropolski-Nalewaja, Piotr, et al.
Published: (2024)

Complexity of Verification and Synthesis of Threshold Automata
by: Balasubramanian, A. R., et al.
Published: (2020)

On the Completeness of Interpolation Algorithms
by: Hetzl, Stefan, et al.
Published: (2024)

Automata for Enriched Trees and Applications
by: Blumensath, Achim
Published: (2025)

Complete Test Suites for Automata in Monoidal Closed Categories
by: Kocsis, Bálint, et al.
Published: (2024)

Completions of Kleene's second model
by: Terwijn, Sebastiaan A.
Published: (2023)

Complete Dynamic Logic of Communicating Hybrid Programs
by: Brieger, Marvin, et al.
Published: (2024)

Completeness of Synthesis under Realizability Assumptions using Superposition
by: Hajdu, Márton, et al.
Published: (2026)

Runtime Verification of Interactions Using Automata
by: Weil-Kennedy, Chana, et al.
Published: (2025)

Compositional Reasoning for Probabilistic Automata with Uncertainty
by: Mertens, Hannah, et al.
Published: (2026)

Petri Nets and Higher-Dimensional Automata
by: Amrane, Amazigh, et al.
Published: (2025)

Complete and Terminating Tableau Calculus for Undirected Graph
by: Nishimura, Yuki, et al.
Published: (2024)

An Expressive Coalgebraic Modal Logic for Cellular Automata
by: Basold, Henning, et al.
Published: (2025)

Small Test Suites for Active Automata Learning
by: Kruger, Loes, et al.
Published: (2024)

Automata Linear Dynamic Logic on Finite Traces
by: Smith, Kevin W., et al.
Published: (2021)

Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic
by: Gokaj, Geri, et al.
Published: (2025)

History-deterministic Timed Automata
by: Bose, Sougata, et al.
Published: (2023)

Proof-Theoretic Functional Completeness for the Connexive Logic C
by: Ayhan, Sara, et al.
Published: (2025)

Satisfiability Modulo Exponential Integer Arithmetic
by: Frohn, Florian, et al.
Published: (2024)

The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
by: Daviaud, Laure, et al.
Published: (2023)

Formal State-Machine Models for Uniswap v3 Concentrated-Liquidity AMMs: Priced Timed Automata, Finite-State Transducers, and Provable Rounding Bounds
by: Tranquilli, Julius, et al.
Published: (2025)

POPACheck: A Model Checker for Probabilistic Pushdown Automata
by: Pontiggia, Francesco, et al.
Published: (2025)

Non-Termination of Logic Programs Using Patterns
by: Payet, Etienne
Published: (2025)

Unknown Biases and Timing Constraints in Timed Automata
by: Haase, Darion, et al.
Published: (2024)

Complete representation by partial functions for signatures containing antidomain restriction
by: McLean, Brett
Published: (2023)

Some General Completeness Results for Propositionally Quantified Modal Logics
by: Ding, Yifeng, et al.
Published: (2024)

On proving consistency of equational theories in Bounded Arithmetic
by: Beckmann, Arnold, et al.
Published: (2022)