Imagen de Portada

Algorithmic analysis of systems with affine input and polynomial state

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Clemente, Lorenzo
Formato:	Preprint
Publicado:	2025
Materias:	Formal Languages and Automata Theory Logic in Computer Science Systems and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Safety Verification of Stochastic Systems under Signal Temporal Logic Specifications
por: Ma, Liqian, et al.
Publicado: (2025)

sweap: Reactive Synthesis for Infinite-State Integer Problems
por: Azzopardi, Shaun, et al.
Publicado: (2026)

Full LTL Synthesis over Infinite-state Arenas
por: Azzopardi, Shaun, et al.
Publicado: (2023)

The commutativity problem for effective varieties of formal series, and applications
por: Clemente, Lorenzo
Publicado: (2025)

The structure of polynomial growth for tree automata/transducers and MSO set queries
por: Gallot, Paul, et al.
Publicado: (2025)

Module checking of pushdown multi-agent systems
por: Bozzelli, Laura, et al.
Publicado: (2020)

Integrating Graceful Degradation and Recovery through Requirement-driven Adaptation
por: Chu, Simon, et al.
Publicado: (2024)

Data-Driven Abstractions via Binary-Tree Gaussian Processes for Formal Verification
por: Schön, Oliver, et al.
Publicado: (2024)

Cyclic system for an algebraic theory of alternating parity automata
por: Das, Anupam, et al.
Publicado: (2025)

Improved Algorithm for Reachability in $d$-VASS
por: Fu, Yuxi, et al.
Publicado: (2024)

Weighted basic parallel processes and combinatorial enumeration
por: Clemente, Lorenzo
Publicado: (2024)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
por: Rooduijn, Jan, et al.
Publicado: (2024)

Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise
por: Ye, Lina, et al.
Publicado: (2023)

A GLR-like Parsing Algorithm for Three-Valued Interpretations of Boolean Grammars with Strong Negation
por: Adrián, Patrik, et al.
Publicado: (2024)

Message complexity for unary multiautomata systems
por: Choffrut, Christian
Publicado: (2024)

The role of counting quantifiers in laminar set systems
por: Campbell, Rutger, et al.
Publicado: (2025)

STL-GO: Spatio-Temporal Logic with Graph Operators for Distributed Systems with Multiple Network Topologies
por: Zhao, Yiqi, et al.
Publicado: (2025)

Monitoring Spatially Distributed Cyber-Physical Systems with Alternating Finite Automata
por: Balakrishnan, Anand, et al.
Publicado: (2025)

The SCAN Statistical Model Checker
por: Ghiorzi, Enrico, et al.
Publicado: (2026)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
por: Barloy, Corentin, et al.
Publicado: (2025)

An algebraic theory of ω-regular languages, via μν-expressions
por: Das, Anupam, et al.
Publicado: (2025)

A proof theory of right-linear (omega-)grammars via cyclic proofs
por: Das, Anupam, et al.
Publicado: (2024)

Positive First-order Logic on Words and Graphs
por: Kuperberg, Denis
Publicado: (2022)

Function spaces for orbit-finite sets
por: Bojańczyk, Mikołaj, et al.
Publicado: (2024)

An efficient quantifier elimination procedure for Presburger arithmetic
por: Haase, Christoph, et al.
Publicado: (2024)

Policy Synthesis for Interval MDPs via Polyhedral Lyapunov Functions
por: Monir, Negar, et al.
Publicado: (2026)

Solvability of orbit-finite systems of linear equations
por: Ghosh, Arka, et al.
Publicado: (2022)

A Unifying Framework for Global Optimization: From Theory to Formalization
por: Serré, Gaëtan, et al.
Publicado: (2025)

The Queue Automaton Revisited
por: Baeten, Jos C. M., et al.
Publicado: (2025)

Simplifying LTL Model Checking Given Prior Knowledge
por: Duret-Lutz, Alexandre, et al.
Publicado: (2025)

Determinization of Min-Plus Weighted Automata is Decidable
por: Almagor, Shaull, et al.
Publicado: (2025)

Unreliability in Practical Subclasses of Communicating Systems
por: Suresh, Amrita, et al.
Publicado: (2025)

Proceedings of the Combined 32nd International Workshop on Expressiveness in Concurrency and 22nd Workshop on Structural Operational Semantics
por: Di Giusto, Cinzia, et al.
Publicado: (2025)

Parameterized Verification of Quantum Circuits (Technical Report)
por: Abdulla, Parosh Aziz, et al.
Publicado: (2025)

Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework
por: Li, Junle, et al.
Publicado: (2025)

DTMC Model Checking by Path Abstraction Revisited (extended version)
por: Hartmanns, Arnd, et al.
Publicado: (2025)

Robust Probabilistic Bisimilarity for Labelled Markov Chains
por: Fatmi, Syyeda Zainab, et al.
Publicado: (2025)

Learning Verified Monitors for Hidden Markov Models
por: van der Maas, Luko, et al.
Publicado: (2025)

MightyPPL: Verification of MITL with Past and Pnueli Modalities
por: Ho, Hsi-Ming, et al.
Publicado: (2025)

General Decidability Results for Systems with Continuous Counters
por: Balasubramanian, A. R., et al.
Publicado: (2025)