Image de couverture de livre

Learning EFSM Models with Registers in Guards

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Vega, Germán, Groz, Roland, Oriat, Catherine, Foster, Michael, Walkinshaw, Neil, Simão, Adenilso
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Active Inference of Extended Finite State Machine Models with Registers and Guards
par: Groz, Roland, et autres
Publié: (2026)

Scalable Tree-based Register Automata Learning
par: Dierl, Simon, et autres
Publié: (2024)

Unambiguisability and Register Minimisation of Min-Plus Models
par: Almagor, Shaull, et autres
Publié: (2025)

Hyper-Minimization for Deterministic Register Automata
par: Li, Yong, et autres
Publié: (2026)

Minimizing Cost Register Automata over a Field
par: Benalioua, Yahia Idriss, et autres
Publié: (2023)

Automated Formal Verification of Area-Optimized Safety Registers in Automotive SoCs
par: Zhang, Shuhang, et autres
Publié: (2025)

Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata
par: Mazowiecki, Filip, et autres
Publié: (2025)

Exact Accepting-State Spectrum for Reversal of Permutation Automata
par: German, Samuel
Publié: (2026)

On the Separability Problem of VASS Reachability Languages
par: Keskin, Eren, et autres
Publié: (2024)

Passive Model Learning of Visibly Deterministic Context-free Grammars
par: Muškardin, Edi, et autres
Publié: (2025)

Automated Formal Verification of a Highly-Configurable Register Generator
par: Zhang, Shuhang, et autres
Publié: (2024)

Separability and Non-Determinizability of WSTS
par: Czerwiński, Wojciech, et autres
Publié: (2023)

Multihead Finite-State Compression
par: Lutz, Neil
Publié: (2025)

Reachability in VASS Extended with Integer Counters
par: Bizière, Clotilde, et autres
Publié: (2026)

Unconditional Time and Space Complexity Lower Bounds for Intersection Non-Emptiness
par: Wehar, Michael
Publié: (2025)

Temporal Causal Models as a Model of Computation
par: Gladyshev, Maksim, et autres
Publié: (2026)

Query Learning of Advice and Nominal Automata
par: Zhou, Kevin
Publié: (2024)

Learning Event-recording Automata Passively
par: Majumdar, Anirban, et autres
Publié: (2025)

Behaviorally Correct Learning from Informants
par: Mohrin, Niklas
Publié: (2025)

Active Learning of Symbolic Mealy Automata
par: Irie, Kengo, et autres
Publié: (2025)

Learning Deterministic Multi-Clock Timed Automata
par: Teng, Yu, et autres
Publié: (2024)

Efficient Learning of Weak Deterministic Büchi Automata
par: Alluwayma, Mona, et autres
Publié: (2025)

Model Checking for Multi-Agent Systems Modeled By Epistemic Process Calculus
par: Yu, Qixian, et autres
Publié: (2025)

Polyregular Model Checking
par: Lopez, Aliaume, et autres
Publié: (2025)

Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids
par: Aristote, Quentin
Publié: (2024)

Greybox Learning of Languages Recognizable by Event-Recording Automata
par: Majumdar, Anirban, et autres
Publié: (2024)

Componentwise Automata Learning for System Integration (Extended Version)
par: Fujinami, Hiroya, et autres
Publié: (2025)

Automata Learning with an Incomplete but Inductive Teacher (Technical Report)
par: Stan, Daniel, et autres
Publié: (2026)

Passive Learning of Lattice Automata from Recurrent Neural Networks
par: Slimi, Jaouhar, et autres
Publié: (2025)

Formalized Run-Time Analysis of Active Learning -- Coalgebraically in Agda
par: Wißmann, Thorsten
Publié: (2026)

Learning Weighted Automata over Number Rings, Concretely and Categorically
par: Aristote, Quentin, et autres
Publié: (2025)

Two-Way One-Counter Nets Revisited
par: Almagor, Shaull, et autres
Publié: (2024)

Shuffles of Context-Free Languages along Regular Trajectories
par: Barloy, Corentin, et autres
Publié: (2026)

A Factorization Theorem for Forest Algebras
par: Almagor, Shaull, et autres
Publié: (2026)

Computational Model for Parsing Expression Grammars
par: Rubtsov, Alexander, et autres
Publié: (2024)

Regular Languages in the Sliding Window Model
par: Ganardi, Moses, et autres
Publié: (2024)

Conservative Perception Models for Probabilistic Verification
par: Cleaveland, Matthew, et autres
Publié: (2025)

Distributional Learning of Graph Languages Generated by Fixed-Interface Clause Systems
par: Shoudai, Takayoshi, et autres
Publié: (2026)

Distributional Learning of Context-Free Languages under Fixed Finite-Monoid Typing
par: Kuriyama, Takayuki
Publié: (2014)

The rIC3 Hardware Model Checker
par: Su, Yuheng, et autres
Publié: (2025)