🤖 AI Summary
This study addresses the problem of automatically generating event sequences with specified dependencies. To this end, the authors propose a formal method that integrates deterministic finite automata (DFA) with finite-state transducers, presenting the first systematic framework that combines these two formalisms for synthesizing dependency-aware event sequences driven by multiple inputs. The approach is implemented in AGDES, a configurable tool capable of automatically producing output sequences that adhere to given dependency constraints. Empirical evaluation demonstrates that AGDES exhibits strong applicability and practical utility in scenarios involving formal verification and testing, offering a robust solution for generating semantically coherent and constraint-compliant event traces.
📝 Abstract
This note presents AGDES, a tool for Automatic Generation of Dependent Event Sequences. Each event sequence is either generated as the output word of a deterministic finite automaton (DFA), or produced as the output word of a DFA called transducer that reads events from one or more input sequences, and produces an output sequence.