Polynomials, fragments of temporal logic and the variety DA over traces
暂无分享,去创建一个
[1] Edward Ochmanski. Recognizable Trace Languages , 1995, The Book of Traces.
[2] Robert M. Keller,et al. Parallel program schemata and maximal parallelism , 1972 .
[3] Pascal Weil,et al. Polynomial closure and unambiguous product , 1995, Theory of Computing Systems.
[4] Jean-Eric Pin,et al. A variety theorem without complementation , 1995 .
[5] Jean-Eric Pin,et al. Profinite Semigroups, Mal'cev Products, and Identities☆ , 1996 .
[6] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.
[7] Wojciech Zielonka,et al. The Book of Traces , 1995 .
[8] Paul Gastin,et al. An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces , 2002, ICALP.
[9] A. Mazurkiewicz. Concurrent Program Schemes and their Interpretations , 1977 .
[10] Raymond E. Miller,et al. Varieties of Formal Languages , 1986 .
[11] Antoni W. Mazurkiewicz,et al. Trace Theory , 1986, Advances in Petri Nets.
[12] Robert M. Keller,et al. Parallel Program Schemata and Maximal Parallelism I. Fundamental Results , 1973, JACM.
[13] Denis Thérien,et al. DIAMONDS ARE FOREVER: THE VARIETY DA , 2002 .
[14] Wolfgang Reisig,et al. Petri Nets: Applications and Relationships to Other Models of Concurrency , 1986, Lecture Notes in Computer Science.
[15] Howard Straubing,et al. Locally trivial categories and unambiguous concatenation , 1988 .