Fokkink, Wan, 1965-
Fokkink, Wan, 19..-....
Fokkink, Wan
Fokkink, W.J. (Willem Jan), 1965-
Fokkink, Willem Jan, 1965-
Fokkink, Willem J. 1965-
Fokkink, Willem Jan
Wan J Fokkink Ph.D. Universiteit van Amsterdam 1994
VIAF ID: 51970334 ( Personal )
Permalink: http://viaf.org/viaf/51970334
Preferred Forms
- 200 _ | ‡a Fokkink ‡b Wan
-
-
-
-
- 100 1 _ ‡a Fokkink, Wan ‡d 19..-...
- 100 1 _ ‡a Fokkink, Wan, ‡d 19..-....
-
- 100 1 _ ‡a Fokkink, Wan, ‡d 1965-
-
-
- 100 1 _ ‡a Fokkink, Willem J. ‡d 1965-
-
-
- 100 0 _ ‡a Wan J Fokkink ‡c Ph.D. Universiteit van Amsterdam 1994
4xx's: Alternate Name Forms (14)
Works
Title | Sources |
---|---|
2-nested simulation is not finitely equationally axiomatizable | |
Algebra of timed frames | |
An axiomatization for the terminal cycle | |
Basic process algebra with iteration: completeness of its equational axioms : | |
Clocks, trees and stars in process theory | |
Cones and foci for protocol verification revisited | |
A conservative look at term deduction systems with variable binding | |
Distributed algorithms : an intuitive approach | |
An effective axiomatization for real time ACP : | |
From timed Xt to uCRL: combining performance and functional analysis | |
Idempotent most general unifiers for infinite sets | |
Introduction to process algebra / Wan Fokkink. - Berlin, 2000. | |
Modelling distributed systems | |
A note on K-state self-stabilization in a ring with K=N | |
On a question of A. Salomaa | |
On the axiomatizability of impossible futures : preorder versus equivalence | |
Process algebra needs proof methodology | |
Ready to preorder | |
Real time process algebra with prefixed integration | |
A reference model for teleconferencing systems | |
Regular processes with relative time and silent steps : | |
Safety criteria for Hoorn-Kersenboogerd railway station | |
A simple specification language combining processes, time and data | |
Simplifying Itai-Rodeh leader election for anonymous rings | |
Thee oor ree ties ze inf or ma ti-ka | |
The tyft/tyxt format reduces to tree rules : | |
Verifying a sliding window protocol in mCRL | |
An w-complete equational specification of interleaving | |
Within ARM's reach: compilation of left-linear rewrite systems via minimal rewrite systems | |
A ¤menagerie of non-finitely based process semantics over BPA* | |
A ¤note on an expressiveness hierachy for multi-exit iteration |