Image de couverture de livre

Checking Timed Bisimilarity with Virtual Clocks

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lieb, Alexander, Göttmann, Hendrik, Luthmann, Lars, Lochau, Malte, Schürr, Andy
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory F.1.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Reachability for Multi-Priced Timed Automata with Positive and Negative Rates
par: Scoones, Andrew, et autres
Publié: (2024)

Deterministic Suffix-reading Automata
par: Keerthan, R, et autres
Publié: (2024)

Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities
par: Baumann, Pascal, et autres
Publié: (2024)

Equivalence of Deterministic Weighted Real-time One-Counter Automata
par: Mathew, Prince, et autres
Publié: (2024)

Flattability of Priority Vector Addition Systems
par: Guttenberg, Roland
Publié: (2024)

Exploring VASS Parameterised by Geometric Dimension
par: Czerwiński, Wojciech, et autres
Publié: (2026)

On Constructing Finite Automata by Relational Programming
par: Egri-Nagy, Attila, et autres
Publié: (2025)

Geometric Characterization of Context-Free Intersections via the Inner Segment Dichotomy
par: Silva, Jorge Miguel
Publié: (2026)

On Direct Product and Quotient of Strongly Connected Automata
par: Hu, Zino H.
Publié: (2011)

A Uniform Framework for Problems on Context-Free Grammars
par: Esparza, Javier, et autres
Publié: (2024)

On the Boolean Closure of Deterministic Top-Down Tree Automata
par: Löding, Christof, et autres
Publié: (2024)

Probabilistic Finite Automaton Emptiness is undecidable
par: Rote, Günter
Publié: (2024)

Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton
par: Rote, Günter
Publié: (2024)

On Repetitive Finite Automata with Translucent Words
par: Mráz, František, et autres
Publié: (2025)

On Minimization and Learning of Deterministic $ω$-Automata in the Presence of Don't Care Words
par: Löding, Christof, et autres
Publié: (2022)

Recognizing Numbers
par: Gaba, Pranshu, et autres
Publié: (2025)

Lexicographic transductions of finite words
par: Filiot, Emmanuel, et autres
Publié: (2025)

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
par: Bojańczyk, Mikołaj, et autres
Publié: (2021)

Edit Distance of Finite State Transducers
par: Aiswarya, C., et autres
Publié: (2024)

Exploring Complexity: An Extended Study of Formal Properties for Process Model Complexity Measures
par: Schalk, Patrizia, et autres
Publié: (2024)

Edit Distance of Finite-Valued Transducers
par: Mathew, Prince, et autres
Publié: (2026)

Deterministic Suffix-reading Automata
par: Keerthan, R, et autres
Publié: (2025)

PVASS Reachability is Decidable
par: Guttenberg, Roland, et autres
Publié: (2025)

List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata
par: Volkov, Mikhail V.
Publié: (2025)

Learning Tree Automata with Term Rewriting
par: Kopystiański, Jakub, et autres
Publié: (2026)

Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests
par: Guttenberg, Roland, et autres
Publié: (2025)

Construction of Minkowski Sums by Cellular Automata
par: Tahay, Pierre-Adrien
Publié: (2024)

Input-Erasing Two-Way Finite Automata
par: Meduna, Alexander, et autres
Publié: (2025)

Parameterized Verification of Timed Networks with Clock Invariants
par: André, Étienne, et autres
Publié: (2024)

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework
par: Lee, Changryeol
Publié: (2026)

Identity Testing for Stochastic Languages
par: Agarwal, Smayan, et autres
Publié: (2025)

On Transition Constructions for Automata -- A Categorical Perspective
par: Cruchten, Mike
Publié: (2024)

Kleene Theorems for Lasso Languages and $ω$-Languages
par: Cruchten, Mike
Publié: (2024)

Finitely Presentable Higher-Dimensional Automata and the Irrationality of Process Replication
par: Basold, Henning, et autres
Publié: (2023)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
par: Guillon, Bruno, et autres
Publié: (2025)

How Concise are Chains of co-Büchi Automata?
par: Ehlers, Rüdiger
Publié: (2025)

A Decision Procedure for Probabilistic Kleene Algebra with Angelic Nondeterminism
par: Ong, Shawn, et autres
Publié: (2025)

Decidability Issues for Petri Nets -- a survey
par: Esparza, Javier, et autres
Publié: (2024)

Composition Machines: Programming Self-Organising Software Models for the Emergence of Sequential Program Spaces
par: Arellanes, Damian
Publié: (2021)

Satisfiability of Context-free String Constraints with Subword-ordering and Transducers
par: Aiswarya, C, et autres
Publié: (2024)