Travelled to:1 × Austria
1 × Poland
1 × South Africa
1 × Spain
1 × Switzerland
2 × France
2 × Italy
2 × Portugal
2 × USA
3 × The Netherlands
Collaborated with:S.Nain T.Chen L.Aceto A.Ingólfsdóttir J.Pang S.Blom S.P.Luttik C.Verhoef ∅ F.Ghassemi A.Movaghar B.Bloom R.J.v.Glabbeek N.Bonzanni K.A.Feenstra E.Krepska B.Luttik J.F.Groote I.v.Langevelde B.Lisser J.v.d.Pol D.A.v.Beek D.Hendriks A.Hofkamp J.Markovski J.M.v.d.Mortel-Fronczak M.A.Reniers
Talks about:readi (4) finit (4) base (4) axiomatiz (3) trace (3) equat (3) preorder (2) alphabet (2) process (2) infinit (2)
Person: Wan Fokkink
DBLP: Fokkink:Wan
Contributed to:
2014
2009
2008
2008
2006
20062005200420032003
200120002000
199919981997Wrote 17 papers:
- TACAS-2014-BeekFHHMMR #modelling
- CIF 3: Model-Based Engineering of Supervisory Controllers (DAvB, WF, DH, AH, JM, JMvdMF, MAR), pp. 575–580.
- FM-2009-BonzanniFFK #biology #formal method #question #what
- What Can Formal Methods Bring to Systems Biology? (NB, KAF, WF, EK), pp. 16–22.
- LICS-2008-ChenF #axiom #equivalence #on the
- On the Axiomatizability of Impossible Futures: Preorder versus Equivalence (TC, WF), pp. 156–165.
- SEFM-2008-GhassemiFM #process #strict
- Restricted Broadcast Process Theory (FG, WF, AM), pp. 345–354.
- FoSSaCS-2006-ChenFN #finite #infinity #on the #simulation
- On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation (TC, WF, SN), pp. 1–15.
- ICALP-v2-2006-AcetoCFI #axiom #on the
- On the Axiomatizability of Priority (LA, TC, WF, AI), pp. 480–491.
- ICALP-v2-2006-AcetoFIL #communication #equation #finite
- A Finite Equational Base for CCS with Left Merge and Communication Merge (LA, WF, AI, BL), pp. 492–503.
- ICALP-2005-FokkinkN #finite #semantics
- A Finite Basis for Failure Semantics (WF, SN), pp. 755–765.
- FoSSaCS-2004-FokkinkN #finite #infinity #on the
- On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds (WF, SN), pp. 182–194.
- FoSSaCS-2003-FokkinkP #protocol #revisited #verification
- Cones and Foci for Protocol Verification Revisited (WF, JP), pp. 267–281.
- ICALP-2003-BlomFN #axiom #on the #simulation
- On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces (SB, WF, SN), pp. 109–118.
- CAV-2001-BlomFGLLP #algebra #named #specification #tool support
- µCRL: A Toolset for Analysing Algebraic Specifications (SB, WF, JFG, IvL, BL, JvdP), pp. 250–254.
- ICALP-2000-FokkinkL #equation #specification
- An ω-Complete Equational Specification of Interleaving (WF, SPL), pp. 729–743.
- LICS-2000-BloomFG
- Precongruence Formats for Decorated Trace Preorders (BB, WF, RJvG), pp. 107–118.
- FASE-1999-FokkinkV #legacy #term rewriting
- Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories (WF, CV), pp. 98–113.
- FoSSaCS-1998-AcetoFI #axiom #equation
- A Cook’s Tour of Equational Axiomatizations for Prefix Iteration (LA, WF, AI), pp. 20–34.
- ICALP-1997-Fokkink #algebra #axiom #process
- Axiomatizations for the Perpetual Loop in Process Algebra (WF), pp. 571–581.