Imposing Rules in Process Discovery: an Inductive Mining Approach
Fuente:
arXiv
Saved in:
| Main Authors: | Norouzifar, Ali, Dees, Marcus, van der Aalst, Wil |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Computational Complexity of Alignments
by: Schwanen, Christopher T., et al.
Published: (2026)
by: Schwanen, Christopher T., et al.
Published: (2026)
Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets
by: Prinz, Thomas M., et al.
Published: (2026)
by: Prinz, Thomas M., et al.
Published: (2026)
Thin Coalgebraic Behaviours Are Inductive
by: Chernev, Anton, et al.
Published: (2025)
by: Chernev, Anton, et al.
Published: (2025)
Mining Diamonds in labeled Transition Systems
by: van Spaendonck, P. H. M., et al.
Published: (2025)
by: van Spaendonck, P. H. M., et al.
Published: (2025)
Automata Learning with an Incomplete but Inductive Teacher (Technical Report)
by: Stan, Daniel, et al.
Published: (2026)
by: Stan, Daniel, et al.
Published: (2026)
Time for Quiescence: Modelling quiescent behaviour in testing via time-outs in timed automata
by: Briones, Laura Brandán, et al.
Published: (2025)
by: Briones, Laura Brandán, et al.
Published: (2025)
Attack Tree Generation via Process Mining
by: Konsta, Alyzia-Maria, et al.
Published: (2024)
by: Konsta, Alyzia-Maria, et al.
Published: (2024)
Correctness Notions for Petri Nets with Identifiers
by: van der Werf, Jan Martijn E. M., et al.
Published: (2022)
by: van der Werf, Jan Martijn E. M., et al.
Published: (2022)
Standard Automata Theory and Process Algebra
by: Yodaiken, Victor
Published: (2022)
by: Yodaiken, Victor
Published: (2022)
WEX: Formal Specifications for Windows in Stream Processing
by: Hitarth, S, et al.
Published: (2022)
by: Hitarth, S, et al.
Published: (2022)
A Unifying Approach to Picture Automata
by: Meeres, Yvo Ad, et al.
Published: (2025)
by: Meeres, Yvo Ad, et al.
Published: (2025)
Mathematical Approach in Automata and Automata Association
by: Maciel, Sergio Henrique
Published: (2020)
by: Maciel, Sergio Henrique
Published: (2020)
Model Checking for Multi-Agent Systems Modeled By Epistemic Process Calculus
by: Yu, Qixian, et al.
Published: (2025)
by: Yu, Qixian, et al.
Published: (2025)
Chance and Mass Interpretations of Probabilities in Markov Decision Processes (Extended Version)
by: Tsai, Yun Chen, et al.
Published: (2025)
by: Tsai, Yun Chen, et al.
Published: (2025)
A Formal Approach for Tuning Stochastic Oscillators
by: Ballarini, Paolo, et al.
Published: (2024)
by: Ballarini, Paolo, et al.
Published: (2024)
Stochastic Directly-Follows Process Discovery Using Grammatical Inference
by: Alkhammash, Hanan, et al.
Published: (2023)
by: Alkhammash, Hanan, et al.
Published: (2023)
Hybrid Rebeca Revisited
by: Ghassemi, Fatemeh, et al.
Published: (2024)
by: Ghassemi, Fatemeh, et al.
Published: (2024)
Learning Weighted Automata over Number Rings, Concretely and Categorically
by: Aristote, Quentin, et al.
Published: (2025)
by: Aristote, Quentin, et al.
Published: (2025)
The Similarity Control Problem with Required Events
by: Wang, Yu, et al.
Published: (2026)
by: Wang, Yu, et al.
Published: (2026)
Backward Responsibility in Transition Systems Using General Power Indices
by: Baier, Christel, et al.
Published: (2024)
by: Baier, Christel, et al.
Published: (2024)
On-The-Fly Algorithm for Reachability in Parametric Timed Games (Extended Version)
by: Dahlsen-Jensen, Mikael Bisgaard, et al.
Published: (2024)
by: Dahlsen-Jensen, Mikael Bisgaard, et al.
Published: (2024)
Controller Synthesis for Parametric Timed Games
by: Dahlsen-Jensen, Mikael Bisgaard, et al.
Published: (2025)
by: Dahlsen-Jensen, Mikael Bisgaard, et al.
Published: (2025)
More on Maximally Permissive Similarity Control of Discrete Event Systems
by: Wang, Yu, et al.
Published: (2024)
by: Wang, Yu, et al.
Published: (2024)
On the Marriage of Theory and Practice in Data-Aware Business Processes via Low-Code
by: Eldin, Ali Nour, et al.
Published: (2025)
by: Eldin, Ali Nour, et al.
Published: (2025)
The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations
by: Bozga, Marius, et al.
Published: (2023)
by: Bozga, Marius, et al.
Published: (2023)
Rule-based Generation of de Bruijn Sequences: Memory and Learning
by: Muñoz, Francisco J., et al.
Published: (2025)
by: Muñoz, Francisco J., et al.
Published: (2025)
Unsupervised Hierarchical Skill Discovery
by: Harvey, Damion, et al.
Published: (2026)
by: Harvey, Damion, et al.
Published: (2026)
Finite Automata for Efficient Graph Recognition
by: Drewes, Frank, et al.
Published: (2024)
by: Drewes, Frank, et al.
Published: (2024)
MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm
by: Akshay, S., et al.
Published: (2024)
by: Akshay, S., et al.
Published: (2024)
A Tree Sampler for Bounded Context-Free Languages
by: Considine, Breandan
Published: (2024)
by: Considine, Breandan
Published: (2024)
Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology
by: Hausmann, Daniel, et al.
Published: (2024)
by: Hausmann, Daniel, et al.
Published: (2024)
Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata
by: Acharya, Rohan, et al.
Published: (2024)
by: Acharya, Rohan, et al.
Published: (2024)
Characterization of Isometric Words based on Swap and Mismatch Distance
by: Anselmo, M., et al.
Published: (2024)
by: Anselmo, M., et al.
Published: (2024)
$ω$-regular Expression Synthesis from Transition-Based Büchi Automata
by: Pert, Charles, et al.
Published: (2024)
by: Pert, Charles, et al.
Published: (2024)
Deterministic Parikh automata on infinite words
by: Grobler, Mario, et al.
Published: (2024)
by: Grobler, Mario, et al.
Published: (2024)
Information-flow Interfaces and Security Lattices
by: Bartocci, Ezio, et al.
Published: (2024)
by: Bartocci, Ezio, et al.
Published: (2024)
Synthesis from LTL with Reward Optimization in Sampled Oblivious Environments
by: Raskin, Jean-François, et al.
Published: (2024)
by: Raskin, Jean-François, et al.
Published: (2024)
Two-Way One-Counter Nets Revisited
by: Almagor, Shaull, et al.
Published: (2024)
by: Almagor, Shaull, et al.
Published: (2024)
5' -> 3' Watson-Crick Automata accepting Necklaces
by: Nagy, Benedek
Published: (2024)
by: Nagy, Benedek
Published: (2024)
Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
by: Bizière, Clotilde, et al.
Published: (2024)
by: Bizière, Clotilde, et al.
Published: (2024)
Similar Items
-
Computational Complexity of Alignments
by: Schwanen, Christopher T., et al.
Published: (2026) -
Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets
by: Prinz, Thomas M., et al.
Published: (2026) -
Thin Coalgebraic Behaviours Are Inductive
by: Chernev, Anton, et al.
Published: (2025) -
Mining Diamonds in labeled Transition Systems
by: van Spaendonck, P. H. M., et al.
Published: (2025) -
Automata Learning with an Incomplete but Inductive Teacher (Technical Report)
by: Stan, Daniel, et al.
Published: (2026)