Wan Fokkink
Wan Fokkink

homepage
w.j.fokkinkatvu.nl

  Affiliation history
Bibliometrics: publication history
Average citations per article5.15
Citation Count659
Publication count128
Publication years1992-2017
Available for download14
Average downloads per article233.79
Downloads (cumulative)3,273
Downloads (12 Months)140
Downloads (6 Weeks)19
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author




BOOKMARK & SHARE


127 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 127
Result page: 1 2 3 4 5 6 7

Sort by:

1
December 2017 Information and Computation: Volume 257 Issue C, December 2017
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 0

Earlier we presented a method to decompose modal formulas for processes with the internal action , and congruence formats for branching and -bisimilarity were derived on the basis of this decomposition method. The idea is that a congruence format for a semantics must ensure that the formulas in the modal ...
Keywords: Modal characterisation, Congruence formats, Weak bisimilarity, Structural operational semantics

2
March 2017 Discrete Event Dynamic Systems: Volume 27 Issue 1, March 2017
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0

We propose a new technique for controlled system synthesis on non-deterministic automata for requirements in modal logic. Synthesis, as defined in this paper, restricts a behavioral specification of the uncontrolled system such that it satisfies a given logical expression, while adhering to the rules dictated by supervisory control such as ...
Keywords: Controlled system synthesis, Non-determinism, Controllability, Modal logic, Partial bisimulation, Maximal permissiveness

3 published by ACM
January 2017 ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on LCETES 2015, Special Issue on ACSD 2015 and Special Issue on Embedded Devise Forensics and Security: Volume 16 Issue 2, April 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 15,   Downloads (Overall): 50

Full text available: PDFPDF
Abstractions can cause spurious results, which need to be verified in the concrete system to gain conclusive results. Verification based on a multi-valued logic can distinguish between conclusive and inconclusive results, provides increased precision, and allows for encoding additional information into the model. To ensure a correct abstraction, one can ...
Keywords: Bilattices, Kripke models, mixed simulation, multi-valued logics

4
December 2016 Formal Methods in System Design: Volume 49 Issue 3, December 2016
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0

Modeling arbitrary connectivity changes within mobile ad hoc networks (MANETs) makes application of automated formal verification challenging. We use constrained labeled transition systems as a semantic model to represent mobility. To model check MANET protocols with respect to the underlying topology and connectivity changes, we introduce a branching-time temporal logic. ...
Keywords: Mobile ad hoc networks, Multi-hop network constraints, Constrained labeled transition systems, Model checking

5 published by ACM
July 2016 LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 2,   Downloads (12 Months): 16,   Downloads (Overall): 37

Full text available: PDFPDF
Earlier we presented a method to decompose modal formulas for processes with the internal action τ; congruence formats for branching and η-bisimilarity were derived on the basis of this decomposition method. The idea is that a congruence format for a semantics must ensure that formulas in the modal characterisation of ...

6
March 2016 Science of Computer Programming: Volume 118 Issue C, March 2016
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 0

We formally verify that TCP satisfies its requirements when extended with the Window Scale Option. With the aid of our µCRL specification and the LTSmin toolset, we verify that our specification of unidirectional TCP Data Transfer extended with the Window Scale Option does not deadlock, and that its external behaviour ...
Keywords: Transmission control protocol, µCRL, Process algebra, Window scale option, Sliding window protocol

7 published by ACM
January 2016 Journal of Data and Information Quality (JDIQ) - Challenge Papers, Regular Papers and Experience Paper: Volume 7 Issue 1-2, June 2016
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 7,   Downloads (12 Months): 58,   Downloads (Overall): 331

Full text available: PDFPDF
Trust is a broad concept that in many systems is often reduced to user reputation alone. However, user reputation is just one way to determine trust. The estimation of trust can be tackled from other perspectives as well, including by looking at provenance. Here, we present a complete pipeline for ...
Keywords: Trust, uncertainty reasoning, machine learning, tags, provenance, subjective logic

8
June 2015 ACSD '15: Proceedings of the 2015 15th International Conference on Application of Concurrency to System Design
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1

In model checking, abstractions can cause spurious results, which need to be verified in the concrete system to gain conclusive results. Verification based on a multi-valued logic can distinguish between conclusive and inconclusive results, provides increased precision, and allows for encoding additional information into the model, which gives rise to ...
Keywords: model checking, abstraction, multi-valued, distributive lattice, quasi-boolean, de morgan, execution steering, mixed simulation

9 published by ACM
January 2015 ACM Transactions on Embedded Computing Systems (TECS): Volume 14 Issue 1, January 2015
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 7,   Downloads (Overall): 60

Full text available: PDFPDF
This article concerns the maximal synthesis for Hennessy-Milner Logic on Kripke structures with labeled transitions. We formally define, and prove the validity of, a theoretical framework that modifies a Kripke model to the least possible extent in order to satisfy a given HML formula. Applications of this work can be ...
Keywords: Hennessy-Milner Logic, Supervisory control, maximal permissiveness

10
October 2014 URSW'14: Proceedings of the 10th International Conference on Uncertainty Reasoning for the Semantic Web - Volume 1259
Publisher: CEUR-WS.org
Bibliometrics:
Citation Count: 1

This paper introduces an ontology for representing trust that extends existing ones by integrating them with recent trust theories. Then, we propose an extension of such an ontology, tailored for representing trust assessments of data, and we outline its specificity and its relevance.
Keywords: ontology, resource definition framework (RDF), trust, web data

11
October 2014 URSW'14: Proceedings of the 10th International Conference on Uncertainty Reasoning for the Semantic Web - Volume 1259
Publisher: CEUR-WS.org
Bibliometrics:
Citation Count: 0

Cultural heritage institutions are employing crowdsourcing techniques to enrich their collection. However, assessing the quality of crowdsourced annotations is a challenge for these institutions and manually evaluating all annotations is not feasible. We employ Support Vector Machines and feature set selectors to understand which annotator and annotation properties are relevant ...

12
October 2013 URSW'13: Proceedings of the 9th International Conference on Uncertainty Reasoning for the Semantic Web - Volume 1073
Publisher: CEUR-WS.org
Bibliometrics:
Citation Count: 1

Public authorities are increasingly sharing sets of open data. These data are often preprocessed (e.g. smoothened, aggregated) to avoid to expose sensible data, while trying to preserve their reliability. We present two procedures for tackling the lack of methods for measuring the open data reliability. The first procedure is based ...

13
October 2013 Revised Selected Papers of the ISWC International Workshops on Uncertainty Reasoning for the Semantic Web III - Volume 8816
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Web data often manifest high levels of uncertainty. We focus on categorical Web data and we represent these uncertainty levels as first- or second-order uncertainty. By means of concrete examples, we show how to quantify and handle these uncertainties using the Beta-Binomial and the Dirichlet-Multinomial models, as well as how ...
Keywords: Bayesian statistics, Dirichlet process, Non-parametric statistics, Bhattacharyya distance, Beta-Binomial, Uncertainty, Dirichlet-Multinomial

14
October 2013 Revised Selected Papers of the ISWC International Workshops on Uncertainty Reasoning for the Semantic Web III - Volume 8816
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Subjective logic is a powerful probabilistic logic which is useful to handle data in case of uncertainty. Subjective logic and the Semantic Web can mutually benefit from each other, since subjective logic is useful to handle the inner noisiness of the Semantic Web data, while the Semantic Web offers a ...
Keywords: Partial observations, Dirichlet process, Semantic similarity, Subjective logic

15
October 2013 Revised Selected Papers of the ISWC International Workshops on Uncertainty Reasoning for the Semantic Web III - Volume 8816
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

In many systems, the determination of trust is reduced to reputation estimation. However, reputation is just one way of determining trust. The estimation of trust can be tackled from a variety of other perspectives. In this chapter, we model trust relying on user reputation, user demographics and from provenance. We ...
Keywords: Tags, Machine learning, Provenance, Subjective logic, Trust, Uncertainty reasoning

16
July 2013 ACSD '13: Proceedings of the 2013 13th International Conference on Application of Concurrency to System Design
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1

We present a solution for the synthesis on Kripke structures with labelled transitions, with respect to Hennessy-Milner Logic. This encompasses the definition of a theoretical framework that is able to express how such a transition system should be modified in order to satisfy a given HMLformula. The transition system is ...

17
January 2013 The Computer Journal: Volume 56 Issue 1, January 2013
Publisher: Oxford University Press
Bibliometrics:
Citation Count: 0

An existing axiomatization strategy for process algebras modulo bisimulation semantics can be extended so that it can be applied to other behavioural semantics as well. We study term rewriting properties of the resulting axiomatizations.

18
November 2012 URSW'12: Proceedings of the 8th International Conference on Uncertainty Reasoning for the Semantic Web - Volume 900
Publisher: CEUR-WS.org
Bibliometrics:
Citation Count: 1

Subjective logic is a powerful probabilistic logic which is useful to handle data in case of uncertainty. Subjective logic and the Semantic Web can mutually benefit from each other, since subjective logic is useful to handle the inner noisiness of the Semantic Web data, while the Semantic Web offers a ...
Keywords: partial observations, subjective logic, semantic similarity, dirichlet process

19
November 2012 URSW'12: Proceedings of the 8th International Conference on Uncertainty Reasoning for the Semantic Web - Volume 900
Publisher: CEUR-WS.org
Bibliometrics:
Citation Count: 2

Trust is a broad concept which, in many systems, is reduced to reputation estimation. However, reputation is just one way of determining trust. The estimation of trust can be tackled from other perspectives as well, including by looking at provenance. In this work, we look at the combination of reputation ...
Keywords: provenance, subjective logic, uncertainty reasoning, trust, machine learning, tags

20
September 2012 ICTAC'12: Proceedings of the 9th international conference on Theoretical Aspects of Computing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

Motivated by Murray's work on the limits of refinement testing for CSP, we propose the use of ProB to check liveness properties under assumptions of strong and weak event fairness, whose refinement-closures cannot generally be expressed as refinement checks for FDR. Such properties are necessary for the analysis of fair ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us