Cover Image

Verifying Parameterized Networks Specified by Vertex-Replacement Graph Grammars

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Iosif, Radu, Sangnier, Arnaud, Villani, Neven
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Counting Abstraction for the Verification of Structured Parameterized Networks
by: Bozga, Marius, et al.
Published: (2025)

Tree-Verifiable Graph Grammars
by: Chimes, Mark, et al.
Published: (2024)

Regular Grammars for Sets of Graphs of Tree-Width 2
by: Bozga, Marius, et al.
Published: (2024)

Regular Grammars as Effective Representations of Recognizable Sets of Series-Parallel Graphs
by: Bozga, Marius, et al.
Published: (2026)

Iterating Non-Aggregative Structure Compositions
by: Bozga, Marius, et al.
Published: (2025)

Closure Properties of General Grammars -- Formally Verified
by: Dvorak, Martin, et al.
Published: (2023)

Uniform Membership for Hyperedge Replacement Grammars and Related Decision Problems
by: Pshenitsyn, Tikhon
Published: (2025)

Characterizations of Monadic Second Order Definable Context-Free Sets of Graphs
by: Iosif, Radu, et al.
Published: (2023)

Bonding Grammars
by: Pshenitsyn, Tikhon
Published: (2024)

Decidability Problems for Micro-Stipula
by: Delzanno, Giorgio, et al.
Published: (2025)

Tahr: The Generative Attribute Grammar Framework
by: Ciccaglione, Matteo, et al.
Published: (2025)

Forbidden-Context & Ordered Grammar Systems
by: Fernau, Henning, et al.
Published: (2026)

On Decidability and Expressive Power of Fusion Grammars
by: Pshenitsyn, Tikhon
Published: (2023)

Computational Model for Parsing Expression Grammars
by: Rubtsov, Alexander, et al.
Published: (2024)

Idefix-Closed Languages and Their Application in Contextual Grammars
by: Ködding, Marvin, et al.
Published: (2025)

Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations
by: Bueri, Lucas, et al.
Published: (2024)

Passive Model Learning of Visibly Deterministic Context-free Grammars
by: Muškardin, Edi, et al.
Published: (2025)

Characterizations of Controlled Generation of Right Linear Grammars with Unknown Behaviors
by: Ise, Daihei, et al.
Published: (2024)

Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction
by: Eichler, Paul, et al.
Published: (2024)

The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations
by: Bozga, Marius, et al.
Published: (2023)

Semiflows, Home Spaces, and Home States, Applications to the Analysis of Parameterized Petri Nets
by: Memmi, Gerard
Published: (2025)

A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity
by: Mengel, Stefan, et al.
Published: (2024)

V-Star: Learning Visibly Pushdown Grammars from Program Inputs
by: Jia, Xiaodong, et al.
Published: (2024)

Systems of Graph Formulas and their Equivalence to Alternating Graph Automata
by: Drewes, Frank, et al.
Published: (2025)

Automata on Graph Alphabets
by: Bazille, Hugo, et al.
Published: (2026)

Formally Verified Linear-Time Invertible Lexing
by: Chassot, Samuel, et al.
Published: (2025)

Finite Automata for Efficient Graph Recognition
by: Drewes, Frank, et al.
Published: (2024)

Fine-Grained Complexity of Ambiguity Problems on Automata and Directed Graphs
by: Drabik, Karolina, et al.
Published: (2025)

Efficient Construction of Reachability Graphs for Petri Net Product Lines
by: Gómez-Martínez, Elena, et al.
Published: (2026)

Distributional Learning of Graph Languages Generated by Fixed-Interface Clause Systems
by: Shoudai, Takayoshi, et al.
Published: (2026)

Networks of Moore Machines
by: Yodaiken, Victor
Published: (2015)

Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification
by: Hong, Chih-Duo, et al.
Published: (2025)

Alloy-Driven Verification of Object-Centric Event Data: From Temporal Logic to Knowledge Graphs
by: Latif, Saba, et al.
Published: (2025)

GrappaRE -- A Tool for Efficient Graph Recognition Based on Finite Automata and Regular Expressions
by: De Rosa, Mattia, et al.
Published: (2025)

Passive Learning of Lattice Automata from Recurrent Neural Networks
by: Slimi, Jaouhar, et al.
Published: (2025)

A Language and Methodology based on Scenarios, Grammars and Views, for Administrative Business Processes Modelling
by: Ndadji, Milliam Maxime Zekeng, et al.
Published: (2020)

BEAVER: An Efficient Deterministic LLM Verifier
by: Suresh, Tarun, et al.
Published: (2025)

On Computational Completeness of Semi-Conditional Matrix Grammars
by: Fernau, Henning, et al.
Published: (2024)

Detecting and Explaining (In-)equivalence of Context-Free Grammars
by: Schmellenkamp, Marko, et al.
Published: (2024)

HERMES: Towards Efficient and Verifiable Mathematical Reasoning in LLMs
by: Ospanov, Azim, et al.
Published: (2025)