default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWan J. Fokkink
Willem Jan Fokkink
Person information
- affiliation: VU University Amsterdam, Department of Computer Science, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c117]Maarten Schröder, Machiel van der Bijl, Wan J. Fokkink:
From LTL to Scenarios: Automatic Test Case Generation for Axini Modeling Language. Rebeca for Actor Analysis in Action 2025: 236-265- [c116]Samina Kanwal
, Wan J. Fokkink:
A Framework for Model-Based Specification and Verification in Feature-Oriented Software Product Lines. FSEN 2025: 61-79 - 2024
- [j84]Wan J. Fokkink, Martijn A. Goorden:
Offline supervisory control synthesis: taxonomy and recent developments. Discret. Event Dyn. Syst. 34(4): 605-657 (2024) - 2023
- [j83]Lars Moormann, Reinier H. J. Schouten, Joanna M. van de Mortel-Fronczak, Wan J. Fokkink, Jacobus E. Rooda:
Synthesis and Implementation of Distributed Supervisory Controllers With Communication Delays. IEEE Trans Autom. Sci. Eng. 20(3): 1591-1606 (2023) - [c115]J. J. Verbakel, Jeroen van Meurs, Joanna M. van de Mortel-Fronczak, Wan J. Fokkink, Jacobus E. Rooda:
Legend Pattern Calculation for Dynamic Traffic Management Using ILP. CASE 2023: 1-7 - [c114]J. J. Verbakel, Wan J. Fokkink, Joanna M. van de Mortel-Fronczak, Jacobus E. Rooda:
Validating communication of a dynamic traffic management system. ICECCS 2023: 207-215 - [c113]Wan J. Fokkink, Martijn A. Goorden, Dennis Hendriks, D. A. van Beek, Albert T. Hofkamp, Ferdie F. H. Reijnen, L. F. P. Etman, Lars Moormann, Joanna M. van de Mortel-Fronczak, Michel A. Reniers, Jacobus E. Rooda, Bram van der Sanden, Ramon R. H. Schiffelers, Sander Thuijsman, J. J. Verbakel, J. A. Vogel:
Eclipse ESCET™: The Eclipse Supervisory Control Engineering Toolkit. TACAS (2) 2023: 44-52 - 2022
- [j82]Wan J. Fokkink, Martijn A. Goorden, Joanna M. van de Mortel-Fronczak, Ferdie F. H. Reijnen, Jacobus E. Rooda:
Supervisor Synthesis: Bridging Theory and Practice. Computer 55(10): 48-54 (2022) - [j81]Luca Aceto, Valentina Castiglioni, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? ACM Trans. Comput. Log. 23(4): 22:1-22:56 (2022) - [c112]Saidgani Musaev, Wan J. Fokkink:
A Note on the Message Complexity of Cidon's Distributed Depth-First Search Algorithm. A Journey from Process Algebra via Timed Automata to Model Learning 2022: 467-471 - 2021
- [j80]Ferdie F. H. Reijnen, Eva-Britt Leliveld, Joanna M. van de Mortel-Fronczak, John van Dinther, Jacobus E. Rooda, Wan J. Fokkink:
Synthesized fault-tolerant supervisory controllers, with an application to a rotating bridge. Comput. Ind. 130: 103473 (2021) - [j79]Martijn A. Goorden, Martin Fabian, Joanna M. van de Mortel-Fronczak, Michel A. Reniers, Wan J. Fokkink, Jacobus E. Rooda:
Compositional coordinator synthesis of extended finite automata. Discret. Event Dyn. Syst. 31(3): 317-348 (2021) - [j78]Evangelos Chatzikalymnios, Wan J. Fokkink, Dick Grune, Brinio Hond, Peter Rutgers:
Detecting useless transitions in pushdown automata. Inf. Comput. 279: 104612 (2021) - [c111]J. J. Verbakel, M. E. W. Vos de Wael, Joanna M. van de Mortel-Fronczak, Wan J. Fokkink, Jacobus E. Rooda:
A configurator for supervisory controllers of roadside systems. CASE 2021: 784-791 - [c110]Lars Moormann, Reinier H. J. Schouten, Joanna M. van de Mortel-Fronczak, Wan J. Fokkink, Jacobus E. Rooda:
Synthesis and Implementation of Distributed Supervisory Controllers with Communication Delays. CASE 2021: 1268-1275 - [c109]Luca Aceto, Valentina Castiglioni, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition? CSL 2021: 8:1-8:17 - [c108]Georgios Karlos, Wan J. Fokkink, Per Fuchs:
Fault-Tolerant Termination Detection with Safra's Algorithm. NETYS 2021: 71-87 - 2020
- [j77]Maciej Gazda, Wan J. Fokkink, Vittorio Massaro:
Congruence from the operator's point of view. Acta Informatica 57(3-5): 329-351 (2020) - [j76]Martijn A. Goorden, Joanna M. van de Mortel-Fronczak, Michel A. Reniers, Wan J. Fokkink, Jacobus E. Rooda:
Structuring Multilevel Discrete-Event Systems With Dependence Structure Matrices. IEEE Trans. Autom. Control. 65(4): 1625-1639 (2020) - [c107]Lars Moormann, Joanna M. van de Mortel-Fronczak, Wan J. Fokkink, Jacobus E. Rooda:
Exploiting Symmetry in Dependency Graphs for Model Reduction in Supervisor Synthesis. CASE 2020: 659-666 - [c106]Radhesh Krishnan Konoth, Björn Fischer, Wan J. Fokkink, Elias Athanasopoulos, Kaveh Razavi, Herbert Bos:
SecurePay: Strengthening Two-Factor Authentication for Arbitrary Transactions. EuroS&P 2020: 569-586 - [c105]Clemens Grabmayer, Wan J. Fokkink:
A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity. LICS 2020: 465-478 - [c104]Martijn A. Goorden, Lars Moormann, Ferdie F. H. Reijnen, J. J. Verbakel, D. A. van Beek, Albert T. Hofkamp, Joanna M. van de Mortel-Fronczak, Michel A. Reniers, Wan J. Fokkink, Jacobus E. Rooda, L. F. P. Etman:
The Road Ahead for Supervisor Synthesis. SETTA 2020: 1-16 - [i15]Clemens Grabmayer, Wan J. Fokkink:
A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity. CoRR abs/2004.12740 (2020) - [i14]Martijn A. Goorden, Joanna M. van de Mortel-Fronczak, Michel A. Reniers, Martin Fabian, Wan J. Fokkink, Jacobus E. Rooda:
Model Properties for Efficient Synthesis of Nonblocking Modular Supervisors. CoRR abs/2007.05795 (2020) - [i13]Luca Aceto, Valentina Castiglioni, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition? CoRR abs/2010.01943 (2020)
2010 – 2019
- 2019
- [j75]Maurits J. J. Dijkstra, Atze van der Ploeg, K. Anton Feenstra, Wan J. Fokkink, Sanne Abeln, Jaap Heringa:
Tailor-made multiple sequence alignments using the PRALINE 2 alignment toolkit. Bioinform. 35(24): 5315-5317 (2019) - [j74]Fatemeh Ghassemi, Wan J. Fokkink:
Reliable Restricted Process Theory. Fundam. Informaticae 165(1): 1-41 (2019) - [j73]Wan J. Fokkink, Rob van Glabbeek, Bas Luttik:
Divide and congruence III: From decomposition of modal formulas to preservation of stability and divergence. Inf. Comput. 268 (2019) - [c103]Wan J. Fokkink, Guus Samsom:
Variations of the Itai-Rodeh Algorithm for Computing Anonymous Ring Size. The Art of Modelling Computational Systems 2019: 3-13 - [c102]Lennart Swartjes, Michel A. Reniers, Wan J. Fokkink:
Deducing causes for the absence of states in supervised systems. CoDIT 2019: 144-149 - [c101]Martijn A. Goorden, Calvin Dingemans, Michel A. Reniers, Joanna M. van de Mortel-Fronczak, Wan J. Fokkink, Jacobus E. Rooda:
Supervisory Control of Multilevel Discrete-Event Systems with a Bus Structure. ECC 2019: 3204-3211 - [c100]Martijn A. Goorden, Joanna M. van de Mortel-Fronczak, Michel A. Reniers, Wan J. Fokkink, Jacobus E. Rooda:
Modeling Guidelines for Component-Based Supervisory Control Synthesis. FACS 2019: 3-24 - [c99]Martijn A. Goorden, Joanna M. van de Mortel-Fronczak, Michel A. Reniers, Wan J. Fokkink, Jacobus E. Rooda:
The Impact of Requirement Splitting on the Efficiency of Supervisory Control Synthesis. FMICS 2019: 76-92 - [e3]Wan J. Fokkink, Rob van Glabbeek:
30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands. LIPIcs 140, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-121-4 [contents] - [i12]Wan J. Fokkink, Rob van Glabbeek, Bas Luttik:
Divide and Congruence III: From Decomposition of Modal Formulas to Preservation of Stability and Divergence. CoRR abs/1908.06550 (2019) - 2018
- [j72]Maurits J. J. Dijkstra, Punto Bawono, Sanne Abeln, K. Anton Feenstra, Wan J. Fokkink, Jaap Heringa:
Motif-Aware PRALINE: Improving the alignment of motif regions. PLoS Comput. Biol. 14(11) (2018) - 2017
- [j71]A. C. van Hulst, Michel A. Reniers, Wan J. Fokkink:
Maximally permissive controlled system synthesis for non-determinism and modal logic. Discret. Event Dyn. Syst. 27(1): 109-142 (2017) - [j70]Wan J. Fokkink, Rob J. van Glabbeek:
Divide and congruence II: From decomposition of modal formulas to preservation of delay and weak bisimilarity. Inf. Comput. 257: 79-113 (2017) - [j69]Lennart Swartjes, D. A. van Beek, Wan J. Fokkink, J. A. W. M. van Eekelen:
Model-based design of supervisory controllers for baggage handling systems. Simul. Model. Pract. Theory 78: 28-50 (2017) - [j68]Stefan Vijzelaar, Wan J. Fokkink:
Multi-valued Simulation and Abstraction Using Lattice Operations. ACM Trans. Embed. Comput. Syst. 16(2): 42:1-42:26 (2017) - [c98]Wan J. Fokkink, Rob J. van Glabbeek, Bas Luttik:
Divide and Congruence III: Stability & Divergence. CONCUR 2017: 15:1-15:16 - [c97]Wan J. Fokkink, Rob J. van Glabbeek:
Precongruence Formats with Lookahead through Modal Decomposition. CSL 2017: 25:1-25:20 - [c96]Stefan J. J. Vijzelaar, Wan J. Fokkink:
Creating Büchi Automata for Multi-valued Model Checking. FORTE 2017: 210-224 - [c95]Dick Grune, Wan J. Fokkink, Evangelos Chatzikalymnios, Brinio Hond, Peter Rutgers:
Detecting Useless Transitions in Pushdown Automata. LATA 2017: 421-434 - [i11]Fatemeh Ghassemi, Wan J. Fokkink:
Reliable Restricted Process Theory. CoRR abs/1705.02600 (2017) - 2016
- [j67]Fatemeh Ghassemi, Wan J. Fokkink:
Model checking mobile ad hoc networks. Formal Methods Syst. Des. 49(3): 159-189 (2016) - [j66]Davide Ceolin, Paul Groth, Valentina Maccatrozzo, Wan J. Fokkink, Willem Robert van Hage, Archana Nottamkandath:
Combining User Reputation and Provenance Analysis for Trust Assessment. ACM J. Data Inf. Qual. 7(1-2): 6:1-6:28 (2016) - [j65]Lars Lockefeer, David M. Williams, Wan J. Fokkink:
Formal specification and verification of TCP extended with the Window Scale Option. Sci. Comput. Program. 118: 3-23 (2016) - [c94]Wan J. Fokkink, Rob J. van Glabbeek:
Divide and Congruence II: Delay and Weak Bisimilarity. LICS 2016: 778-787 - [c93]Lennart Swartjes, Michel A. Reniers, D. A. van Beek, Wan J. Fokkink:
Why is my supervisor empty? Finding causes for the unreachability of states in synthesized supervisors. WODES 2016: 14-21 - [i10]Wan J. Fokkink, Rob J. van Glabbeek:
Divide and Congruence II: From Decomposition of Modal Formulas to Preservation of Delay and Weak Bisimilarity. CoRR abs/1604.07530 (2016) - 2015
- [j64]Taolue Chen, Wan J. Fokkink, Rob J. van Glabbeek:
On the Axiomatizability of Impossible Futures. Log. Methods Comput. Sci. 11(3) (2015) - [j63]Allan C. van Hulst, Michel A. Reniers, Wan J. Fokkink:
Maximal Synthesis for Hennessy-Milner Logic. ACM Trans. Embed. Comput. Syst. 14(1): 10:1-10:21 (2015) - [c92]Stefan Vijzelaar, Wan J. Fokkink:
Multi-valued Abstraction Using Lattice Operations. ACSD 2015: 70-79 - [c91]Archana Nottamkandath, Jasper Oosterman, Davide Ceolin, Gerben Klaas Dirk de Vries, Wan J. Fokkink:
Predicting Quality of Crowdsourced Annotations Using Graph Kernels. IFIPTM 2015: 134-148 - [c90]Allan van Hulst, Michel A. Reniers, Wan J. Fokkink:
Maximally Permissive Controlled System Synthesis for Modal Logic. SOFSEM 2015: 230-241 - 2014
- [c89]Stefan Vijzelaar, Kees Verstoep, Wan J. Fokkink, Henri E. Bal:
Bonsai: Cutting Models Down to Size. Ershov Memorial Conference 2014: 361-375 - [c88]Lars Lockefeer, David M. Williams, Wan J. Fokkink:
Formal Specification and Verification of TCP Extended with the Window Scale Option. FMICS 2014: 63-77 - [c87]Nicola Bonzanni, K. Anton Feenstra, Wan J. Fokkink, Jaap Heringa:
Petri Nets Are a Biologist's Best Friend. FMMB 2014: 102-116 - [c86]Davide Ceolin, Luc Moreau, Kieron O'Hara, Wan J. Fokkink, Willem Robert van Hage, Valentina Maccatrozzo, Alistair Sackley, Guus Schreiber, Nigel Shadbolt:
Two Procedures for Analyzing the Reliability of Open Government Data. IPMU (1) 2014: 15-24 - [c85]Archana Nottamkandath, Jasper Oosterman, Davide Ceolin, Wan J. Fokkink:
Automated Evaluation of Crowdsourced Annotations in the Cultural Heritage Domain. URSW 2014: 25-36 - [c84]Davide Ceolin, Archana Nottamkandath, Wan J. Fokkink, Valentina Maccatrozzo:
Towards the Definition of an Ontology for Trust in (Web) Data. URSW 2014: 73-78 - [c83]Davide Ceolin, Paul Groth, Archana Nottamkandath, Wan J. Fokkink, Willem Robert van Hage:
Analyzing User Demographics and User Behavior for Trust Assessment. URSW (LNCS Vol.) 2014: 219-241 - [c82]Davide Ceolin, Archana Nottamkandath, Wan J. Fokkink:
Bridging Gaps Between Subjective Logic and Semantic Web. URSW (LNCS Vol.) 2014: 242-264 - [c81]Davide Ceolin, Willem Robert van Hage, Wan J. Fokkink, Guus Schreiber:
Uncertainty Estimation and Analysis of Categorical Web Data. URSW (LNCS Vol.) 2014: 265-288 - [c80]D. A. van Beek, Wan J. Fokkink, Dennis Hendriks, Albert T. Hofkamp, Jasen Markovski, Joanna M. van de Mortel-Fronczak, Michel A. Reniers:
CIF 3: Model-Based Engineering of Supervisory Controllers. TACAS 2014: 575-580 - [c79]Allan van Hulst, Michel A. Reniers, Wan J. Fokkink:
Maximal Synthesis for Hennessy-Milner Logic with the Box Modality. WODES 2014: 278-285 - [i9]Allan van Hulst, Michel A. Reniers, Wan J. Fokkink:
Maximally Permissive Controlled System Synthesis for Modal Logic. CoRR abs/1408.3317 (2014) - 2013
- [j62]Maciej Gazda, Wan J. Fokkink:
Turning GSOS Rules into Equations for Linear Time-Branching Time Semantics. Comput. J. 56(1): 34-44 (2013) - [c78]A. C. van Hulst, Michel A. Reniers, Wan J. Fokkink:
Maximal Synthesis for Hennessy-Milner Logic. ACSD 2013: 1-10 - [c77]Fatemeh Ghassemi, Saeide Ahmadi, Wan J. Fokkink, Ali Movaghar:
Model Checking MANETs with Arbitrary Mobility. FSEN 2013: 217-232 - [c76]Davide Ceolin, Archana Nottamkandath, Wan J. Fokkink:
Semi-automated assessment of annotation trustworthiness. PST 2013: 325-332 - [c75]Davide Ceolin, Luc Moreau, Kieron O'Hara, Guus Schreiber, Alistair Sackley, Wan J. Fokkink, Willem Robert van Hage, Nigel Shadbolt:
Reliability Analyses of Open Government Data. URSW 2013: 34-39 - [c74]Chris Dijkshoorn, Mieke H. R. Leyssen, Archana Nottamkandath, Jasper Oosterman, Myriam C. Traub, Lora Aroyo, Alessandro Bozzon, Wan J. Fokkink, Geert-Jan Houben, Henrike Hovelmann, Lizzy Jongma, Jacco van Ossenbruggen, Guus Schreiber, Jan Wielemaker:
Personalized Nichesourcing: Acquisition of Qualitative Annotations from Niche Communities. UMAP Workshops 2013 - [p4]Davide Ceolin, Willem Robert van Hage, Guus Schreiber, Wan J. Fokkink:
Assessing Trust for Determining the Reliability of Information. Situation Awareness with Systems of Systems 2013: 209-228 - [i8]Wan J. Fokkink, Dick Grune, Brinio Hond, Peter Rutgers:
Detecting Useless Transitions in Pushdown Automata. CoRR abs/1306.1947 (2013) - 2012
- [j61]Wan J. Fokkink, Rob J. van Glabbeek, Paulien de Wind:
Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity. Inf. Comput. 214: 59-85 (2012) - [j60]Maciej Gazda, Wan J. Fokkink:
Modal logic and the approximation induction principle. Math. Struct. Comput. Sci. 22(2): 175-201 (2012) - [c73]Daniela Remenska, Tim A. C. Willemse, Kees Verstoep, Wan J. Fokkink, Jeff Templon, Henri E. Bal:
Using Model Checking to Analyze the System Behavior of the LHC Production Grid. CCGRID 2012: 335-343 - [c72]Daniel Gebler, Wan J. Fokkink:
Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics. CONCUR 2012: 395-409 - [c71]David M. Williams, Joeri de Ruiter, Wan J. Fokkink:
Model Checking under Fairness in ProB and Its Application to Fair Exchange Protocols. ICTAC 2012: 168-182 - [c70]Davide Ceolin, Archana Nottamkandath, Wan J. Fokkink:
Automated Evaluation of Annotators for Museum Collections Using Subjective Logic. IFIPTM 2012: 232-239 - [c69]Davide Ceolin, Paul Groth, Willem Robert van Hage, Archana Nottamkandath, Wan J. Fokkink:
Trust Evaluation through User Reputation and Provenance Analysis. URSW 2012: 15-26 - [c68]Davide Ceolin, Archana Nottamkandath, Wan J. Fokkink:
Subjective Logic Extensions for the Semantic Web. URSW 2012: 27-38 - 2011
- [j59]Rena Bakhshi, Jörg Endrullis, Wan J. Fokkink, Jun Pang:
Fast leader election in anonymous rings with bounded expected delay. Inf. Process. Lett. 111(17): 864-870 (2011) - [j58]Rena Bakhshi, Lucia Cloth, Wan J. Fokkink, Boudewijn R. Haverkort:
Mean-field framework for performance evaluation of push-pull gossip protocols. Perform. Evaluation 68(2): 157-179 (2011) - [j57]Elzbieta Krepska, Thilo Kielmann, Wan J. Fokkink, Henri E. Bal:
HipG: parallel processing of large-scale graphs. ACM SIGOPS Oper. Syst. Rev. 45(2): 3-13 (2011) - [j56]Fatemeh Ghassemi, Wan J. Fokkink, Ali Movaghar:
Verification of mobile ad hoc networks: An algebraic approach. Theor. Comput. Sci. 412(28): 3262-3282 (2011) - [c67]Fatemeh Ghassemi, Mahmoud Talebi, Ali Movaghar, Wan J. Fokkink:
Stochastic Restricted Broadcast Process Theory. EPEW 2011: 72-86 - [c66]Abolhassan Shamsaie, Wan J. Fokkink, Jafar Habibi:
Analysis of Gossip-Based Information Propagation in Wireless Mesh Networks. EPEW 2011: 174-188 - [c65]Elzbieta Krepska, Thilo Kielmann, Wan J. Fokkink, Henri E. Bal:
A High-Level Framework for Distributed Processing of Large-Scale Graphs. ICDCN 2011: 155-166 - [c64]Rena Bakhshi, Daniela Gavidia, Wan J. Fokkink, Maarten van Steen:
A Modeling Framework for Gossip-based Information Spread. QEST 2011: 245-254 - [c63]Davide Ceolin, Willem Robert van Hage, Wan J. Fokkink, Guus Schreiber:
Estimating Uncertainty of Categorical Web Data. URSW 2011: 15-26 - [c62]Stefan Vijzelaar, Kees Verstoep, Wan J. Fokkink, Henri E. Bal:
Distributed MAP in the SpinJa Model Checker. PDMC 2011: 84-90 - [i7]Rena Bakhshi, Daniela Gavidia, Wan J. Fokkink, Maarten van Steen:
A Modeling Framework for Gossip-based Information Spread. CoRR abs/1105.5986 (2011) - 2010
- [j55]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Mohammad Reza Mousavi:
Lifting non-finite axiomatizability results to extensions of process algebras. Acta Informatica 47(3): 147-177 (2010) - [j54]Fatemeh Ghassemi, Wan J. Fokkink, Ali Movaghar:
Equational Reasoning on Mobile Ad Hoc Networks. Fundam. Informaticae 105(4): 375-415 (2010) - [c61]Fatemeh Ghassemi, Ali Movaghar, Wan J. Fokkink:
Towards Performance Evaluation of Mobile Ad Hoc Network Protocols. ACSD 2010: 85-92 - [c60]Wan J. Fokkink, Mohammad Torabi Dashti, Anton Wijs:
Partial Order Reduction for Branching Security Protocols. ACSD 2010: 191-200 - [c59]Despo Galataki, Andrei Radulescu, Kees Verstoep, Wan J. Fokkink:
Embedded Network Protocols for Mobile Devices. FMICS 2010: 164-179 - [c58]Stefan Vijzelaar, Herbert Bos, Wan J. Fokkink:
Brief announcement: a shared disk on distributed storage. PODC 2010: 79-80 - [c57]Rena Bakhshi, Jörg Endrullis, Wan J. Fokkink, Jun Pang:
Brief announcement: asynchronous bounded expected delay networks. PODC 2010: 392-393 - [c56]Rena Bakhshi, Jörg Endrullis, Stefan Endrullis, Wan J. Fokkink, Boudewijn R. Haverkort:
Automating the Mean-Field Method for Large Dynamic Gossip Networks. QEST 2010: 241-250 - [c55]Maciej Gazda, Wan J. Fokkink:
Congruence from the Operator's Point of View: Compositionality Requirements on Process Semantics. SOS 2010: 15-25 - [i6]Rena Bakhshi, Jörg Endrullis, Wan J. Fokkink, Jun Pang:
Asynchronous Bounded Expected Delay Networks. CoRR abs/1003.2084 (2010)
2000 – 2009
- 2009
- [j53]Nicola Bonzanni, Elzbieta Krepska, K. Anton Feenstra, Wan J. Fokkink, Thilo Kielmann, Henri E. Bal, Jaap Heringa:
Executing multicellular differentiation: quantitative predictive modelling of C.elegans vulval development. Bioinform. 25(16): 2049-2056 (2009) - [j52]Nicola Bonzanni, Elzbieta Krepska, K. Anton Feenstra, Wan J. Fokkink, Thilo Kielmann, Henri E. Bal, Jaap Heringa:
Executing multicellular differentiation: quantitative predictive modelling of C.elegans vulval development. Bioinform. 25(19): 2624 (2009) - [j51]Rena Bakhshi, Daniela Gavidia, Wan J. Fokkink, Maarten van Steen:
An analytical model of information dissemination for a gossip-based protocol. Comput. Networks 53(13): 2288-2303 (2009) - [j50]Luca Aceto, Jos C. M. Baeten, Wan J. Fokkink, Anna Ingólfsdóttir, Uwe Nestmann:
Preface. J. Log. Algebraic Methods Program. 78(4) (2009) - [j49]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
A finite equational base for CCS with left merge and communication merge. ACM Trans. Comput. Log. 10(1): 6:1-6:26 (2009) - [c54]Wan J. Fokkink:
Process Algebra: An Algebraic Theory of Concurrency. CAI 2009: 47-77 - [c53]Nicola Bonzanni, K. Anton Feenstra, Wan J. Fokkink, Elzbieta Krepska:
What Can Formal Methods Bring to Systems Biology? FM 2009: 16-22 - [c52]Fatemeh Ghassemi, Wan J. Fokkink, Ali Movaghar:
Equational Reasoning on Ad Hoc Networks. FSEN 2009: 113-128 - [c51]Wan J. Fokkink, Paul Klint, Bert Lisser, Yaroslav S. Usenko:
Automated Translation and Analysis of a ToolBus Script for Auctions. FSEN 2009: 308-323 - [c50]Rena Bakhshi, Daniela Gavidia, Wan J. Fokkink, Maarten van Steen:
An Analytical Model of Information Dissemination for a Gossip-Based Protocol. ICDCN 2009: 230-242 - [c49]Ana-Maria Oprescu, Thilo Kielmann, Wan J. Fokkink:
FTRepMI: Fault-Tolerant, Sequentially-Consistent Object Replication for Grid Applications. ICDCN 2009: 368-376 - [c48]Rena Bakhshi, Lucia Cloth, Wan J. Fokkink, Boudewijn R. Haverkort:
Mean-Field Analysis for the Evaluation of Gossip Protocols. QEST 2009: 247-256 - [c47]Taolue Chen, Wan J. Fokkink, Rob J. van Glabbeek:
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures. SOFSEM 2009: 167-180 - [c46]Maciej Gazda, Wan J. Fokkink:
Modal Logic and the Approximation Induction Principle. EXPRESS 2009: 41-50 - 2008
- [j48]Luca Aceto, Jos C. M. Baeten, Wan J. Fokkink, Anna Ingólfsdóttir, Uwe Nestmann:
Applying Concurrency Research in Industry Report on a Strategic Workshop. Bull. EATCS 94: 113-129 (2008) - [j47]Wan J. Fokkink, Jun Pang, Anton Wijs:
Is Timed Branching Bisimilarity a Congruence Indeed? Fundam. Informaticae 87(3-4): 287-311 (2008) - [j46]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir:
A Cancellation Theorem for BCCSP. Fundam. Informaticae 88(1-2): 1-21 (2008) - [j45]Taolue Chen, Wan J. Fokkink, Bas Luttik, Sumit Nain:
On finite alphabets and infinite bases. Inf. Comput. 206(5): 492-519 (2008) - [j44]Taolue Chen, Wan J. Fokkink, Rob J. van Glabbeek:
Ready to preorder: The case of weak process semantics. Inf. Process. Lett. 109(2): 104-111 (2008) - [j43]Luca Aceto, Mario Bravetti, Wan J. Fokkink, Andrew D. Gordon:
Guest Editors' Foreword. J. Log. Algebraic Methods Program. 75(1): 1-2 (2008) - [j42]Luca Aceto, Taolue Chen, Wan J. Fokkink, Anna Ingólfsdóttir:
On the axiomatisability of priority. Math. Struct. Comput. Sci. 18(1): 5-28 (2008) - [j41]Rena Bakhshi, Lucia Cloth, Wan J. Fokkink, Boudewijn R. Haverkort:
MeanField analysis for the evaluation of gossip protocols. SIGMETRICS Perform. Evaluation Rev. 36(3): 31-39 (2008) - [c45]Wan J. Fokkink, Paul Klint, Bert Lisser, Yaroslav S. Usenko:
Towards Formal Verification of ToolBusScripts. AMAST 2008: 160-166 - [c44]Elzbieta Krepska, Nicola Bonzanni, K. Anton Feenstra, Wan J. Fokkink, Thilo Kielmann, Henri E. Bal, Jaap Heringa:
Design Issues for Qualitative Modelling of Biological Cells with Petri Nets. FMSB 2008: 48-62 - [c43]Rena Bakhshi, Wan J. Fokkink, Jun Pang, Jaco van de Pol:
Leader Election in Anonymous Rings: Franklin Goes Probabilistic. IFIP TCS 2008: 57-72 - [c42]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Mohammad Reza Mousavi:
Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras. IFIP TCS 2008: 301-316 - [c41]Taolue Chen, Wan J. Fokkink:
On the Axiomatizability of Impossible Futures: Preorder versus Equivalence. LICS 2008: 156-165 - [c40]Fatemeh Ghassemi, Wan J. Fokkink, Ali Movaghar:
Restricted Broadcast Process Theory. SEFM 2008: 345-354 - [c39]Bahareh Badban, Wan J. Fokkink, Jaco van de Pol:
Mechanical Verification of a Two-Way Sliding Window Protocol. CPA 2008: 179-202 - [i5]Rena Bakhshi, Daniela Gavidia, Wan J. Fokkink, Maarten van Steen:
An Analytical Model of Information Dissemination for a Gossip-based Protocol. CoRR abs/0810.1571 (2008) - [i4]Taolue Chen, Wan J. Fokkink, Rob J. van Glabbeek:
On Finite Bases for Weak Semantics: Failures versus Impossible Futures. CoRR abs/0810.4904 (2008) - 2007
- [b3]Wan J. Fokkink:
Modelling Distributed Systems. Texts in Theoretical Computer Science. An EATCS Series, Springer 2007, ISBN 978-3-540-73937-1, pp. 1-151 - [j40]Luca Aceto, Mario Bravetti, Wan J. Fokkink, Andrew D. Gordon:
Guest Editors' Foreword. J. Log. Algebraic Methods Program. 70(2): 119-120 (2007) - [j39]Jun Pang, Wan J. Fokkink, Rutger F. H. Hofman, Ronald Veldema:
Model checking a cache coherence protocol of a Java DSM implementation. J. Log. Algebraic Methods Program. 71(1): 1-43 (2007) - [j38]Luca Aceto, Mario Bravetti, Wan J. Fokkink, Andrew D. Gordon:
Guest Editors' Foreword. J. Log. Algebraic Methods Program. 72(1): 1-2 (2007) - [j37]Rena Bakhshi, François Bonnet, Wan J. Fokkink, Boudewijn R. Haverkort:
Formal analysis techniques for gossiping protocols. ACM SIGOPS Oper. Syst. Rev. 41(5): 28-36 (2007) - [c38]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir:
Ready to Preorder: Get Your BCCSP Axiomatization for Free! CALCO 2007: 65-79 - [c37]Wan J. Fokkink, Allard Kakebeen, Jun Pang:
Adapting the UPPAAL Model of a Distributed Lift System. FSEN 2007: 81-97 - 2006
- [j36]Wan J. Fokkink, Jun Pang, Jaco van de Pol:
Cones and foci: A mechanical framework for protocol verification. Formal Methods Syst. Des. 29(1): 1-31 (2006) - [j35]Wan J. Fokkink, Jun Pang:
Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM. J. Univers. Comput. Sci. 12(8): 981-1006 (2006) - [j34]Wan J. Fokkink, Rob J. van Glabbeek, Paulien de Wind:
Compositionality of Hennessy-Milner logic by structural operational semantics. Theor. Comput. Sci. 354(3): 421-440 (2006) - [j33]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Sumit Nain:
Bisimilarity is not finitely based over BPA with interrupt. Theor. Comput. Sci. 366(1-2): 60-81 (2006) - [c36]Taolue Chen, Wan J. Fokkink:
On Finite Alphabets and Infinite Bases III: Simulation. CONCUR 2006: 421-434 - [c35]Taolue Chen, Wan J. Fokkink, Sumit Nain:
On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation. FoSSaCS 2006: 1-15 - [c34]Luca Aceto, Taolue Chen, Wan J. Fokkink, Anna Ingólfsdóttir:
On the Axiomatizability of Priority. ICALP (2) 2006: 480-491 - [c33]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
A Finite Equational Base for CCS with Left Merge and Communication Merge. ICALP (2) 2006: 492-503 - [i3]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
A Finite Equational Base for CCS with Left Merge and Communication Merge. CoRR abs/cs/0608001 (2006) - 2005
- [j32]Bahareh Badban, Wan J. Fokkink, Jan Friso Groote, Jun Pang, Jaco van de Pol:
Verification of a sliding window protocol in µCRL and PVS. Formal Aspects Comput. 17(3): 342-388 (2005) - [j31]Elena M. Bortnik, Nikola Trcka, Anton Wijs, Bas Luttik, Joanna M. van de Mortel-Fronczak, Jos C. M. Baeten, Wan J. Fokkink, Jacobus E. Rooda:
Analyzing a chi model of a turntable system using Spin, CADP and Uppaal. J. Log. Algebraic Methods Program. 65(2): 51-104 (2005) - [j30]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge. Log. Methods Comput. Sci. 1(1) (2005) - [j29]Wan J. Fokkink, Jaap-Henk Hoepman, Jun Pang:
A Note on K-State Self-stabilization in a Ring with K=N. Nord. J. Comput. 12(1): 18-26 (2005) - [j28]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
CCS with Hennessy's merge has no finite-equational axiomatization. Theor. Comput. Sci. 330(3): 377-405 (2005) - [j27]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Zoltán Ésik:
Guest editors' foreword: Process Algebra. Theor. Comput. Sci. 335(2-3): 127-129 (2005) - [c32]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
Finite Equational Bases in Process Algebra: Results and Open Questions. Processes, Terms and Cycles 2005: 338-367 - [c31]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Sumit Nain:
Bisimilarity Is Not Finitely Based over BPA with Interrupt. CALCO 2005: 52-66 - [c30]Wan J. Fokkink, Rob J. van Glabbeek, Paulien de Wind:
Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation. FMCO 2005: 195-218 - [c29]Wan J. Fokkink, Jun Pang, Anton Wijs:
Is Timed Branching Bisimilarity an Equivalence Indeed?. FORMATS 2005: 258-272 - [c28]Wan J. Fokkink, Sumit Nain:
A Finite Basis for Failure Semantics. ICALP 2005: 755-765 - [c27]Anton Wijs, Wan J. Fokkink:
From chi-t to µCRL: Combining Performance and Functional Analysis. ICECCS 2005: 184-193 - [c26]Luca Aceto, Wan J. Fokkink:
The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems. APC 25 2005: 43-48 - [c25]Wan J. Fokkink, Rob J. van Glabbeek, Paulien de Wind:
Divide and Congruence Applied to eta-Bisimulation. SOS@ICALP 2005: 97-113 - [e2]Luca Aceto, Wan J. Fokkink, Irek Ulidowski:
Proceedings of the Workshop on Structural Operational Semantics, SOS 2004, London, UK, August 30, 2004. Electronic Notes in Theoretical Computer Science 128(1), Elsevier 2005 [contents] - [i2]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge. CoRR abs/cs/0501040 (2005) - 2004
- [j26]Wan J. Fokkink, Jan Friso Groote, Michel A. Reniers:
Process Algebra Needs Proof Methodology (Columns: Concurrency). Bull. EATCS 82: 109-125 (2004) - [j25]Luca Aceto, Wan J. Fokkink, Rob J. van Glabbeek, Anna Ingólfsdóttir:
Nested semantics over finite trees are equationally hard. Inf. Comput. 191(2): 203-232 (2004) - [j24]Luca Aceto, Wan J. Fokkink:
Guesteditors'introduction: Special issue on Structural Operational Semantics. J. Log. Algebraic Methods Program. 60-61: 1-2 (2004) - [j23]Bard Bloom, Wan J. Fokkink, Rob J. van Glabbeek:
Precongruence formats for decorated trace semantics. ACM Trans. Comput. Log. 5(1): 26-78 (2004) - [c24]Wan J. Fokkink, Jan Friso Groote, Jun Pang, Bahareh Badban, Jaco van de Pol:
Verifying a Sliding Window Protocol in µCRL. AMAST 2004: 148-163 - [c23]Wan J. Fokkink, Sumit Nain:
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds. FoSSaCS 2004: 182-194 - [c22]Luca Aceto, Wan J. Fokkink, Irek Ulidowski:
Preface. SOS@CONCUR 2004: 1 - [c21]Wan J. Fokkink, Jun Pang:
Simplifying Itai-Rodeh Leader Election for Anonymous Rings. AVoCS 2004: 53-68 - [c20]Wan J. Fokkink, Jun Pang:
Formal Verification of Timed Systems Using Cones and Foci. ARTS 2004: 105-122 - 2003
- [j22]Wan J. Fokkink, Thuy Duong Vu:
Structural operational semantics and bounded nondeterminism. Acta Informatica 39(6-7): 501-516 (2003) - [j21]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir:
A note on an expressiveness hierarchy for multi-exit iteration. Inf. Process. Lett. 87(1): 17-23 (2003) - [c19]Wan J. Fokkink, Rob J. van Glabbeek, Paulien de Wind:
Compositionality of Hennessy-Milner Logic through Structural Operational Semantics. FCT 2003: 412-422 - [c18]Wan J. Fokkink, Jun Pang:
Cones and Foci for Protocol Verification Revisited. FoSSaCS 2003: 267-281 - [c17]Stefan Blom, Wan J. Fokkink, Sumit Nain:
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces. ICALP 2003: 109-118 - [c16]Jun Pang, Bart Karstens, Wan J. Fokkink:
Analyzing the Redesign of a Distributed Lift System in UPPAAL. ICFEM 2003: 504-522 - [c15]Jun Pang, Wan J. Fokkink, Rutger F. H. Hofman, Ronald Veldema:
Model Checking a Cache Coherence Protocol for a Java DSM Implementation. IPDPS 2003: 238 - [c14]Thomas Arts, Wan J. Fokkink:
Preface. FMICS 2003: 310-311 - [e1]Thomas Arts, Wan J. Fokkink:
Eighth International Workshop on Formal Methods for Industrial Critical Systems, FMICS 2003, Roros, Norway, June 5-7, 2003. Electronic Notes in Theoretical Computer Science 80, Elsevier 2003 [contents] - 2002
- [c13]Wan J. Fokkink, Natalia Ioustinova, Ernst Kesseler, Jaco van de Pol, Yaroslav S. Usenko, Yuri A. Yushtein:
Refinement and Verification Applied to an In-Flight Data Acquisition Unit. CONCUR 2002: 1-23 - [i1]Bard Bloom, Wan J. Fokkink, Rob J. van Glabbeek:
Precongruence Formats for Decorated Trace Semantics. CoRR cs.LO/0204039 (2002) - 2001
- [j20]Luca Aceto, Wan J. Fokkink:
Preface: Process Algebra. Inf. Process. Lett. 80(1): 1 (2001) - [c12]Stefan Blom, Wan J. Fokkink, Jan Friso Groote, Izak van Langevelde, Bert Lisser, Jaco van de Pol:
µCRL: A Toolset for Analysing Algebraic Specifications. CAV 2001: 250-254 - [c11]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir:
2-Nested Simulation Is Not Finitely Equationally Axiomatizable. STACS 2001: 39-50 - [p3]Luca Aceto, Wan J. Fokkink, Chris Verhoef:
Structural Operational Semantics. Handbook of Process Algebra 2001: 197-292 - [p2]Jan A. Bergstra, Wan J. Fokkink, Alban Ponse:
Process Algebra with Recursive Operations. Handbook of Process Algebra 2001: 333-389 - [p1]Luca Aceto, Wan J. Fokkink, Chris Verhoef:
Conservative Extension in Structural Operational Semantics. Current Trends in Theoretical Computer Science 2001: 504-524 - 2000
- [b2]Wan J. Fokkink, Jan Friso Groote, Marco Hollenberg, Bas van Vlijmen:
LARIS 1.0 - LAnguage for Railway Interlooking Specifications. CWI 2000, ISBN 978-90-6196-489-6, pp. I-VI, 1-129 - [b1]Wan J. Fokkink:
Introduction to Process Algebra. Texts in Theoretical Computer Science. An EATCS Series, Springer 2000, ISBN 978-3-540-66579-3, pp. I-VIII, 1-163 - [j19]Wan J. Fokkink:
Rooted Branching Bisimulation as a Congruence. J. Comput. Syst. Sci. 60(1): 13-37 (2000) - [j18]Wan J. Fokkink:
Language preorder as a precongruence. Theor. Comput. Sci. 243(1-2): 391-408 (2000) - [j17]Wan J. Fokkink, Jasper Kamperman, Pum Walters:
Lazy rewriting on eager machinery. ACM Trans. Program. Lang. Syst. 22(1): 45-86 (2000) - [c10]Wan J. Fokkink, S. P. Luttik:
An omega-Complete Equational Specification of Interleaving. ICALP 2000: 729-743 - [c9]Bard Bloom, Wan J. Fokkink, Rob J. van Glabbeek:
Precongruence Formats for Decorated Trace Preorders. LICS 2000: 107-118
1990 – 1999
- 1999
- [j16]Luca Aceto, Wan J. Fokkink, Chris Verhoef:
Conservative Extension in Structural Operational Semantics. Bull. EATCS 69: 110-132 (1999) - [c8]Wan J. Fokkink, Chris Verhoef:
Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories. FASE 1999: 98-113 - 1998
- [j15]Wan J. Fokkink, Chris Verhoef:
A Conservative Look at Operational Semantics with Variable Binding. Inf. Comput. 146(1): 24-54 (1998) - [j14]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir:
A Menagerie of NonFfinitely Based Process Semantics over BPA* - From Ready Simulation to Completed Traces. Math. Struct. Comput. Sci. 8(3): 193-230 (1998) - [j13]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir:
On a Question of A. Salomaa: The Equational Theory of Regular Expressions Over a Singleton Alphabet is not Finitely Based. Theor. Comput. Sci. 209(1-2): 163-178 (1998) - [j12]Wan J. Fokkink, Jasper Kamperman, Pum Walters:
Within ARM's Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite Systems. ACM Trans. Program. Lang. Syst. 20(3): 679-706 (1998) - [c7]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir:
A Cook's Tour of Equational Axiomatizations for Prefix Iteration. FoSSaCS 1998: 20-34 - [c6]Fokko van Dijk, Wan J. Fokkink, Gea Kolk, Paul van de Ven, Bas van Vlijmen:
EURIS, a Specification Method for Distributed Interlockings. SAFECOMP 1998: 296-305 - 1997
- [j11]Wan J. Fokkink:
An Axiomatization for Regular Processes in Times Branching Bisimulation. Fundam. Informaticae 32(3-4): 329-340 (1997) - [j10]Luca Aceto, Wan J. Fokkink:
An Equational Axiomatization for Multi-Exit Iteration. Inf. Comput. 137(2): 121-158 (1997) - [j9]Wan J. Fokkink:
Unification for Infinite Sets of Equations Between Finite Terms. Inf. Process. Lett. 62(4): 183-188 (1997) - [j8]Wan J. Fokkink, Hans Zantema:
Termination Modulo Equations by Abstract Commutation with an Application to Iteration. Theor. Comput. Sci. 177(2): 407-423 (1997) - [c5]Wan J. Fokkink:
Axiomatizations for the Perpetual Loop in Process Algebra. ICALP 1997: 571-581 - [c4]Wan J. Fokkink, Jaco van de Pol:
Simulation as a Correct Transformation of Rewrite Systems. MFCS 1997: 249-258 - 1996
- [j7]Wan J. Fokkink:
A Complete Axiomatization for Prefix Iteration in Branching Bisimulation. Fundam. Informaticae 26(2): 103-113 (1996) - [j6]Wan J. Fokkink, Rob J. van Glabbeek:
Ntyft/Ntyxt Rules Reduce to Ntree Rules. Inf. Comput. 126(1): 1-10 (1996) - [j5]Luca Aceto, Rob J. van Glabbeek, Wan J. Fokkink, Anna Ingólfsdóttir:
Axiomatizing Prefix Iteration with Silent Steps. Inf. Comput. 127(1): 26-40 (1996) - [j4]Jan A. Bergstra, Wan J. Fokkink, Cornelis A. Middelburg:
Algebra of timed frames. Int. J. Comput. Math. 61(3-4): 227-255 (1996) - [c3]Wan J. Fokkink:
On the Completeness of the Euations for the Kleene Star in Bisimulation. AMAST 1996: 180-194 - 1995
- [j3]Wan J. Fokkink, Steven Klusener:
An Effective Axiomatization for Real Time ACP. Inf. Comput. 122(2): 286-299 (1995) - 1994
- [j2]Wan J. Fokkink, Hans Zantema:
Basic Process Algebra with Iteration: Completeness of its Equational Axioms. Comput. J. 37(4): 259-268 (1994) - [j1]Wan J. Fokkink:
A Complete Equational Axiomatization for Prefix Iteration. Inf. Process. Lett. 52(6): 333-337 (1994) - [c2]Wan J. Fokkink:
The Tyft/Tyxt Format Reduces to Tree Rules. TACS 1994: 440-453 - 1993
- [c1]Wan J. Fokkink:
An Elimination Theorem for Regular Behaviours with Integration. CONCUR 1993: 432-446
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-06-16 23:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
