Nederlands
Contact
Sitemap
Search
OrganisationEEMCS EPrints Service
 |
|
|
||||||||||||||
|
|
|
|
|
||||||||||||
|
|
|
||||||||||||||
|
|
|
|
|
||||||||||||
|
|
Number of items: 5. 1997
Gehrke, T. and Rensink, A.
(1997)
Process Creation and Full Sequential Composition in a Name-Passing Calculus.
In: Expressiveness in Concurrency.
pp. 141-160.
Electronic Notes in Theoretical Computer Science 7.
Elsevier.
ISSN 1571-0661
Rensink, A.
(1997)
Bisimilarity of Open Terms.
In: Expressiveness in Concurrency.
pp. 262-285.
Electronic Notes in Theoretical Computer Science 7.
Elsevier.
ISSN 1571-0661
1996
D'Argenio, P.R. and Brinksma, H.
(1996)
A Calculus for Timed Automata (Extended Abstract).
In: Formal Techniques in Real-Time and Fault-Tolerant Systems, 4th International Symposium, FTRTFT'96, September 9-13, 1996, Uppsala, Sweden.
pp. 110-129.
Lecture Notes in Computer Science 1135.
Springer Verlag.
ISBN 3-540-61648-9
Katoen, J.P. and Latella, D. and Langerak, R. and Brinksma, H.
(1996)
On specifying real-time systems in a causality-based setting.
In: Formal Techniques in Real-Time and Fault-Tolerant Systems, September 9-13, 1996, Uppsala, Sweden.
pp. 385-405.
Lecture Notes in Computer Science 1135.
Springer-Verlag.
ISBN 3-540-61648-9
1994
Rensink, A. and Wehrheim, H.
(1994)
Weak Sequential Composition in Process Algebras.
In: Concurrency Theory (CONCUR), Uppsala, Sweden.
pp. 226-241.
Lecture Notes in Computer Science 836.
Springer Verlag.
ISSN 0302-9743
ISBN 978-3-540-58328-8
This list was generated on Thu May 24 07:41:33 CEST 2012. |
|
|
||||||||||||
|
|
|
||||||||||||||
|
|
|
|
|
||||||||||||
|
|
|
||||||||||||||