СТ |
A Complete Theory of Deterministic Event Structures |
1995 |
Rensink A. |
Lecture Notes in Computer Science |
|
|
CONCUR 95: Concurrency Theory |
14.10.1995 |
СТ |
Compositional Testing with IOCO |
2004 |
Van Der Bijl M., Rensink A., Tretmans J. |
|
|
|
Lecture Notes in Computer Science |
11.03.2004 |
СТ |
Fair Testing |
1995 |
Brinksma E., Rensink A., Vogler W. |
Lecture Notes in Computer Science |
|
|
CONCUR 95: Concurrency Theory |
17.10.1995 |
СТ |
Model Checking Quantified Computation Tree Logic |
2006 |
Rensink A. |
Lecture Notes in Computer Science |
|
|
Lecture Notes in Computer Science |
28.09.2006 |
СТ |
On Syntactic and Semantic Action Refinement |
1994 |
Goltz U., Gorrieri R., Rensink A. |
|
|
|
Lecture Notes in Computer Science |
05.05.1994 |
СТ |
Posets for Configurations! |
1992 |
Rensink A. |
|
|
|
Lecture Notes in Computer Science |
16.10.1992 |
СТ |
Process Algebra with Action Dependencies |
2001 |
Rensink A., Wehrheim H. |
|
|
|
Acta Informatica |
11.01.2002 |
СТ |
Weak Sequential Composition in Process Algebras |
1994 |
Rensink A., Wehrheim H. |
|
|
|
Lecture Notes in Computer Science |
26.08.1994 |