|
СТ |
Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids |
2002 |
Diekert V., Gastin P. |
|
|
|
Lecture Notes in Computer Science |
14.03.2002 |
|
СТ |
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces |
1999 |
Diekert V., Gastin P. |
|
|
|
Lecture Notes in Computer Science |
12.11.1999 |
|
СТ |
Approximating Traces |
1998 |
Diekert V., Gastin P. |
|
|
|
Acta Informatica |
11.08.1998 |
|
СТ |
A Remark on Trace Equations |
1997 |
Diekert V. |
|
|
|
Lecture Notes in Computer Science |
28.11.1997 |
|
СТ |
A Domain for Concurrent Termination A Generalization of Mazurkiewicz Traces |
1995 |
Diekert V., Gastin P. |
Lecture Notes in Computer Science |
|
|
Automata, Languages and Programming |
10.09.1995 |
|
СТ |
On Efficient Reduction Algorithms for Some Trace Rewriting Systems |
1995 |
Bertol M., Diekert V. |
|
|
|
Lecture Notes in Computer Science |
15.06.1995 |
|
СТ |
Deterministic Asynchronous Automata for Infinite Traces |
1994 |
Diekert V., Muscholl A. |
|
|
|
Acta Informatica |
20.10.1994 |
|
СТ |
Complex and Complex-Like Traces |
1993 |
Diekert V. |
|
|
|
Lecture Notes in Computer Science |
20.10.1993 |
|
СТ |
Rewriting, Mobius Functions and Semi-Communications |
1993 |
Diekert V. |
|
|
|
Lecture Notes in Computer Science |
16.09.1993 |
|
СТ |
On "inherently context-sensitive" languages - An application of complexity cores |
1991 |
Diekert V., Book R. |
|
|
|
Information Processing Letters |
16.02.1992 |
|
СТ |
On Confluent Semi-Communications- Decidability and Complexity Results |
1991 |
Diekert V., Ochmanski E., Reinhardt K. |
|
|
|
Lecture Notes in Computer Science |
12.09.1991 |
