|
СТ |
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 |
|
СТ |
A Truly Concurrent Semantics for a Simple Parallel Programming Language |
1999 |
Gastin P., Mislove M. |
|
|
|
Lecture Notes in Computer Science |
12.11.1999 |
|
СТ |
A (Non-elementary) Modular Decision Procedure for LTrL |
1998 |
Gastin P., Meyer R., Petit A. |
|
|
|
Lecture Notes in Computer Science |
02.09.1998 |
|
СТ |
Approximating Traces |
1998 |
Diekert V., Gastin P. |
|
|
|
Acta Informatica |
11.08.1998 |
|
СТ |
On Congruences and Partial Orders |
1995 |
Bauget S., Gastin P. |
Lecture Notes in Computer Science |
|
|
Mathematical Foundations of Computer Science 1995 |
24.10.1995 |
|
СТ |
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 |
|
СТ |
Poset Properties of Complex Traces |
1992 |
Gastin P., Petit A. |
|
|
|
Lecture Notes in Computer Science |
17.09.1992 |
|
СТ |
A Survey of Recognizable Languages of Infinite Traces |
1992 |
Gastin P., Petit A. |
|
|
|
Lecture Notes in Computer Science |
09.07.1992 |
|
СТ |
A Kleene theorem for infinite trace languages |
1991 |
Gastin P., Petit A., Zielonka W. |
|
|
|
Lecture Notes in Computer Science |
12.09.1991 |
