Hybrid Rebeca Revisited
Fuente:
arXiv
Guardado en:
| Autores principales: | Ghassemi, Fatemeh, Zhiany, Saeed, Abbasimoghadam, Nesa, Hodaei, Ali, Ataollahi, Ali, Kovács, József, Ábrahám, Erika, Sirjani, Marjan |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Two-Way One-Counter Nets Revisited
por: Almagor, Shaull, et al.
Publicado: (2024)
por: Almagor, Shaull, et al.
Publicado: (2024)
Well-Formed Free-Choice Petri Nets Revisited
por: Jancar, Petr, et al.
Publicado: (2026)
por: Jancar, Petr, et al.
Publicado: (2026)
Imposing Rules in Process Discovery: an Inductive Mining Approach
por: Norouzifar, Ali, et al.
Publicado: (2024)
por: Norouzifar, Ali, et al.
Publicado: (2024)
Minimum Reachability Probabilities in Rectangular Automata with Random Clocks
por: Delicaris, Joanna, et al.
Publicado: (2026)
por: Delicaris, Joanna, et al.
Publicado: (2026)
Learn, Check, Test -- Security Testing Using Automata Learning and Model Checking
por: Marksteiner, Stefan, et al.
Publicado: (2025)
por: Marksteiner, Stefan, et al.
Publicado: (2025)
On the Marriage of Theory and Practice in Data-Aware Business Processes via Low-Code
por: Eldin, Ali Nour, et al.
Publicado: (2025)
por: Eldin, Ali Nour, et al.
Publicado: (2025)
Finite Automata for Efficient Graph Recognition
por: Drewes, Frank, et al.
Publicado: (2024)
por: Drewes, Frank, et al.
Publicado: (2024)
MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm
por: Akshay, S., et al.
Publicado: (2024)
por: Akshay, S., et al.
Publicado: (2024)
A Formal Approach for Tuning Stochastic Oscillators
por: Ballarini, Paolo, et al.
Publicado: (2024)
por: Ballarini, Paolo, et al.
Publicado: (2024)
A Tree Sampler for Bounded Context-Free Languages
por: Considine, Breandan
Publicado: (2024)
por: Considine, Breandan
Publicado: (2024)
Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology
por: Hausmann, Daniel, et al.
Publicado: (2024)
por: Hausmann, Daniel, et al.
Publicado: (2024)
Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata
por: Acharya, Rohan, et al.
Publicado: (2024)
por: Acharya, Rohan, et al.
Publicado: (2024)
Characterization of Isometric Words based on Swap and Mismatch Distance
por: Anselmo, M., et al.
Publicado: (2024)
por: Anselmo, M., et al.
Publicado: (2024)
$ω$-regular Expression Synthesis from Transition-Based Büchi Automata
por: Pert, Charles, et al.
Publicado: (2024)
por: Pert, Charles, et al.
Publicado: (2024)
Deterministic Parikh automata on infinite words
por: Grobler, Mario, et al.
Publicado: (2024)
por: Grobler, Mario, et al.
Publicado: (2024)
Information-flow Interfaces and Security Lattices
por: Bartocci, Ezio, et al.
Publicado: (2024)
por: Bartocci, Ezio, et al.
Publicado: (2024)
Synthesis from LTL with Reward Optimization in Sampled Oblivious Environments
por: Raskin, Jean-François, et al.
Publicado: (2024)
por: Raskin, Jean-François, et al.
Publicado: (2024)
5' -> 3' Watson-Crick Automata accepting Necklaces
por: Nagy, Benedek
Publicado: (2024)
por: Nagy, Benedek
Publicado: (2024)
Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
por: Bizière, Clotilde, et al.
Publicado: (2024)
por: Bizière, Clotilde, et al.
Publicado: (2024)
The complexity of separability for semilinear sets and Parikh automata
por: Collins, Elias Rojas, et al.
Publicado: (2024)
por: Collins, Elias Rojas, et al.
Publicado: (2024)
QuAK: Quantitative Automata Kit
por: Chalupa, Marek, et al.
Publicado: (2024)
por: Chalupa, Marek, et al.
Publicado: (2024)
Development of parallel programs on shared data-structures -- Revised version
por: Stølen, Ketil
Publicado: (2024)
por: Stølen, Ketil
Publicado: (2024)
Exact descriptional complexity of determinization of input-driven pushdown automata
por: Martynova, Olga
Publicado: (2024)
por: Martynova, Olga
Publicado: (2024)
Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids
por: Aristote, Quentin
Publicado: (2024)
por: Aristote, Quentin
Publicado: (2024)
Extended time Petri nets
por: Radom, Marcin, et al.
Publicado: (2024)
por: Radom, Marcin, et al.
Publicado: (2024)
A short survey around the pumping lemma for context-free languages
por: Gullà, Gabriele
Publicado: (2024)
por: Gullà, Gabriele
Publicado: (2024)
Non-deterministic asynchronous automata games and their undecidability
por: Adsul, Bharat, et al.
Publicado: (2024)
por: Adsul, Bharat, et al.
Publicado: (2024)
Unveiling the connection between the Lyndon factorization and the Canonical Inverse Lyndon factorization via a border property
por: Bonizzoni, Paola, et al.
Publicado: (2024)
por: Bonizzoni, Paola, et al.
Publicado: (2024)
On the piecewise complexity of words
por: Schnoebelen, Philippe, et al.
Publicado: (2024)
por: Schnoebelen, Philippe, et al.
Publicado: (2024)
Learning EFSM Models with Registers in Guards
por: Vega, Germán, et al.
Publicado: (2024)
por: Vega, Germán, et al.
Publicado: (2024)
State estimation of timed automata under partial observation [Draft version]
por: Gao, Chao, et al.
Publicado: (2024)
por: Gao, Chao, et al.
Publicado: (2024)
Greybox Learning of Languages Recognizable by Event-Recording Automata
por: Majumdar, Anirban, et al.
Publicado: (2024)
por: Majumdar, Anirban, et al.
Publicado: (2024)
On Shuffling and Splitting Automata
por: Cunningham, Ignacio Mollo
Publicado: (2024)
por: Cunningham, Ignacio Mollo
Publicado: (2024)
Verification and Enforcement of Strong State-Based Opacity for Discrete-Event Systems
por: Han, Xiaoguang, et al.
Publicado: (2024)
por: Han, Xiaoguang, et al.
Publicado: (2024)
Scalable Tree-based Register Automata Learning
por: Dierl, Simon, et al.
Publicado: (2024)
por: Dierl, Simon, et al.
Publicado: (2024)
Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction
por: Eichler, Paul, et al.
Publicado: (2024)
por: Eichler, Paul, et al.
Publicado: (2024)
Collaboration Miner: Discovering Collaboration Petri Nets (Extended Version)
por: Benzin, Janik-Vasily, et al.
Publicado: (2024)
por: Benzin, Janik-Vasily, et al.
Publicado: (2024)
More on Maximally Permissive Similarity Control of Discrete Event Systems
por: Wang, Yu, et al.
Publicado: (2024)
por: Wang, Yu, et al.
Publicado: (2024)
Navigational hierarchies of regular languages
por: Place, Thomas, et al.
Publicado: (2024)
por: Place, Thomas, et al.
Publicado: (2024)
On the Separability Problem of VASS Reachability Languages
por: Keskin, Eren, et al.
Publicado: (2024)
por: Keskin, Eren, et al.
Publicado: (2024)
Ejemplares similares
-
Two-Way One-Counter Nets Revisited
por: Almagor, Shaull, et al.
Publicado: (2024) -
Well-Formed Free-Choice Petri Nets Revisited
por: Jancar, Petr, et al.
Publicado: (2026) -
Imposing Rules in Process Discovery: an Inductive Mining Approach
por: Norouzifar, Ali, et al.
Publicado: (2024) -
Minimum Reachability Probabilities in Rectangular Automata with Random Clocks
por: Delicaris, Joanna, et al.
Publicado: (2026) -
Learn, Check, Test -- Security Testing Using Automata Learning and Model Checking
por: Marksteiner, Stefan, et al.
Publicado: (2025)