|
СТ |
Refining Interfaces of Communicating Systems |
1991 |
Brinksma E., Jonsson B., Orava F. |
|
|
|
Lecture Notes in Computer Science |
21.05.1991 |
|
СТ |
Specification styles in distributed systems design and verification |
1991 |
Vissers C., Scollo G., Sinderen M., Brinksma E. |
|
|
|
Theoretical Computer Science |
28.11.1991 |
|
СТ |
On the Uniqueness of Fixpoints Modulo Observation Congruence |
1992 |
Brinksma E. |
|
|
|
Lecture Notes in Computer Science |
16.10.1992 |
|
СТ |
Functionality Decomposition by Compositional Correctness Preserving Transformation |
1993 |
Brinksma E., Langerak R., Broekroelofs P. |
|
|
|
Lecture Notes in Computer Science |
20.08.1993 |
|
СТ |
Fair Testing |
1995 |
Brinksma E., Rensink A., Vogler W. |
Lecture Notes in Computer Science |
|
|
CONCUR 95: Concurrency Theory |
17.10.1995 |
|
СТ |
A Complete Finite Prefix for Process Algebra |
1999 |
Langerak R., Brinksma E. |
|
|
|
Lecture Notes in Computer Science |
16.07.1999 |
|
СТ |
Verification Is Experimentation! |
2000 |
Brinksma E. |
|
|
|
Lecture Notes in Computer Science |
15.09.2000 |
|
СТ |
Verification and Optimization of a PLC Control Schedule |
2000 |
Brinksma E., Mader A. |
|
|
|
Lecture Notes in Computer Science |
26.09.2000 |
|
СТ |
Testing Transition Systems: An Annotated Bibliography |
2001 |
Brinksma E., Tretmans J. |
|
|
|
Lecture Notes in Computer Science |
04.11.2001 |
|
П |
As Cheap as Possible: Linearly Priced Timed Automata |
2002 |
Behrmann G., Brinksma E., Fehnker A., Larsen K., Pettersson P., Romijn J., Vaandrager F. |
|
|
Techn.Univ.Munchen |
|
24.08.2002 |
|
СТ |
Factorized test generation for multi-input/output transition systems |
1998 |
Brinksma E., Heerink L., Tretmans J. |
|
|
|
Testing of Communicating Systems (IFIP) |
29.01.2005 |
