Non-deterministic Finite Automata (NFA) represent regular languages concisely, increasing their appeal for applications such as word recognition. This paper proposes a new approach to generate NFA from an interaction language such as UML Sequence Diagrams or Message Sequence Charts. Via an operational semantics, we generate a NFA from a set of interactions reachable using the associated execution relation. In addition, by applying simplifications on reachable interactions to merge them, it is possible to obtain reduced NFA without relying on costly NFA reduction techniques. Experimental results regarding NFA generation and their application in trace analysis are also presented.

翻译：非确定性有限自动机（NFA）能简洁地表示正则语言，从而增强了其在单词识别等应用中的吸引力。本文提出一种新方法，从交互语言（如UML时序图或消息序列图）生成NFA。通过操作语义，我们从一组使用关联执行关系可达的交互中生成NFA。此外，通过对可达交互应用简化操作以合并它们，可在不依赖昂贵的NFA约简技术的情况下获得简化的NFA。文中还给出了NFA生成及其在轨迹分析中应用的实验结果。