Forkable Regular Expressions

被引:4
作者
Sulzmann, Martin [1 ]
Thiemann, Peter [2 ]
机构
[1] Karlsruhe Univ Appl Sci, Fac Comp Sci & Business Informat Syst, Moltkestr 30, D-76133 Karlsruhe, Germany
[2] Univ Freiburg, Fac Engn, Georges Kohler Allee 079, D-79110 Freiburg, Germany
来源
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, LATA 2016 | 2016年 / 9618卷
关键词
Automata and logic; Forkable expressions; Derivatives; ITERATED SHUFFLE; PETRI NETS;
D O I
10.1007/978-3-319-30000-9_15
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We consider forkable regular expressions, which enrich regular expressions with a fork operator, to establish a formal basis for static and dynamic analysis of the communication behavior of concurrent programs. We define a novel compositional semantics for forkable expressions, establish their fundamental properties, and define derivatives for them as a basis for the generation of automata, for matching, and for language containment tests. Forkable expressions may give rise to non-regular languages, in general, but we identify sufficient conditions on expressions that guarantee finiteness of the automata construction via derivatives.
引用
收藏
页码:194 / 206
页数:13
相关论文
共 14 条