Cover Image

Taking Complete Finite Prefixes To High Level, Symbolically

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Würdemann, Nick, Chatain, Thomas, Haar, Stefan, Panneke, Lukas
Format:	Preprint
Published:	2023
Subjects:	Logic in Computer Science Formal Languages and Automata Theory F.m
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Attractor Basins in Concurrent Systems
by: Samboni, Giann Karlo Aguirre, et al.
Published: (2024)

Certified Knowledge Compilation with Application to Formally Verified Model Counting
by: Bryant, Randal E., et al.
Published: (2025)

On Complementation of Nondeterministic Finite Automata without Full Determinization (Technical Report)
by: Holík, Lukáš, et al.
Published: (2025)

Inferring Symbolic Automata
by: Fisman, Dana, et al.
Published: (2021)

Edit Distance of Finite-Valued Transducers
by: Mathew, Prince, et al.
Published: (2026)

Edit Distance of Finite State Transducers
by: Aiswarya, C., et al.
Published: (2024)

Parikh's Theorem Made Symbolic
by: Hague, Matthew, et al.
Published: (2023)

Symbolic ω-automata with obligations
by: Di Stefano, Luca
Published: (2025)

High-Level Message Sequence Charts: Satisfiability and Realizability Revisited
by: Bollig, Benedikt, et al.
Published: (2025)

Dynamic Programming for Symbolic Boolean Realizability and Synthesis
by: Lin, Yi, et al.
Published: (2024)

Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2024)

A Completeness Theorem for Probabilistic Regular Expressions
by: Różowski, Wojciech, et al.
Published: (2023)

Parikh Automata on Finite and Infinite Words
by: Grobler, Mario, et al.
Published: (2023)

Complete Compositional Syntax for Finite Transducers on Finite and Bi-Infinite Words
by: Carette, Titouan, et al.
Published: (2025)

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

A Complete Propositional Dynamic Logic for Regular Expressions with Lookahead
by: Nakamura, Yoshiki
Published: (2026)

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

Complexity of Model Checking Second-Order Hyperproperties on Finite Structures
by: Finkbeiner, Bernd, et al.
Published: (2026)

Image Reflection on Process Graphs -- A Novel Approach for the Completeness of an Axiomatization of 1-Free Regular Expressions Modulo Bisimilarity
by: Zhang, Yuanrui, et al.
Published: (2023)

Finitely Presentable Higher-Dimensional Automata and the Irrationality of Process Replication
by: Basold, Henning, et al.
Published: (2023)

Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems
by: Lin, Deren, et al.
Published: (2014)

Negated String Containment is Decidable (Technical Report)
by: Havlena, Vojtěch, et al.
Published: (2025)

Minimising the Probabilistic Bisimilarity Distance
by: Kiefer, Stefan, et al.
Published: (2024)

String Solving with Stabilization and Transducers (Technical Report)
by: Chocholatý, David, et al.
Published: (2026)

Towards Efficient Matching of Regexes with Backreferences using Register Set Automata (Technical Report)
by: Havlena, Vojtěch, et al.
Published: (2022)

A Uniform Framework for Handling Position Constraints in String Solving (Technical Report)
by: Chen, Yu-Fang, et al.
Published: (2025)

Kofola 1.0: A Modular Approach to ω-Regular Complementation and Inclusion Checking (Technical Report)
by: Alexaj, Ondrej, et al.
Published: (2026)

Weighted GKAT: Completeness and Complexity
by: Van Koevering, Spencer, et al.
Published: (2025)

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

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

Expregular functions
by: Colcombet, Thomas, et al.
Published: (2026)

Resolving Nondeterminism with Randomness
by: Henzinger, Thomas A., et al.
Published: (2025)

Algebraic Characterizations of Classes of Regular Languages in DynFO
by: Barloy, Corentin, et al.
Published: (2026)

Automating the Analysis of Quantitative Automata with QuAK
by: Chalupa, Marek, et al.
Published: (2025)

Extending QuAK with Nested Quantitative Automata
by: Henzinger, Thomas A., et al.
Published: (2026)

Monitoring Timed Properties (Revisited)
by: Grosen, Thomas Møller, et al.
Published: (2022)

The complexity of downward closures of indexed languages
by: Mandel, Richard, et al.
Published: (2026)

Visualising CTL Witnesses and Counterexamples -- Extended Version
by: Rensink, Arend
Published: (2026)

Inquisitive Team Semantics of LTL
by: Bozzelli, Laura, et al.
Published: (2025)

PVASS Reachability is Decidable
by: Guttenberg, Roland, et al.
Published: (2025)