#### Filter Results:

- Full text PDF available (192)

#### Publication Year

1991

2017

- This year (9)
- Last 5 years (49)
- Last 10 years (104)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Wan Fokkink
- Texts in Theoretical Computer Science. An EATCS…
- 2000

- Wan Fokkink
- Inf. Process. Lett.
- 1994

Prefix iteration a∗x is added to Minimal Process Algebra (MPAδ), which is a subalgebra of BPAδ equivalent to Milner’s basic CCS. We present a finite equational axiomatization for MPA∗ δ , and prove that this axiomatization is complete with respect to strong bisimulation equivalence. To obtain this result, we set up a term rewriting system, based on the… (More)

- Wan Fokkink, Chris Verhoef
- Inf. Comput.
- 1998

We set up a formal framework to describe transition system specifications in the style of Plotkin. This framework has the power to express many-sortedness, general binding mechanisms and substitutions, among other notions such as negative hypotheses and unary predicates on terms. The framework is used to present a conservativity format in operational… (More)

- Wan Fokkink, Rob J. van Glabbeek
- Inf. Comput.
- 1996

Groote and Vaandrager introduced the tyft/tyxt format for Transition System Speci cations (TSSs), and established that for each TSS in this format that is well-founded, the bisimulation equivalence it induces is a congruence. In this paper, we construct for each TSS in tyft/tyxt format an equivalent TSS that consists of tree rules only. As a corollary we… (More)

- Wan Fokkink, Hans Zantema
- Comput. J.
- 1994

Bergstra, Bethke and Ponse proposed an axiomatization for Basic Process Algebra extended with (binary) iteration. In this paper, we prove that this axiomatization is complete with respect to strong bisimulation equivalence. To obtain this result, we will set up a term rewriting system, based on the axioms, and prove that this term rewriting system is… (More)

- Wan Fokkink, Jasper Kamperman, Pum Walters
- ACM Trans. Program. Lang. Syst.
- 2000

The article introduces a novel notion of lazy rewriting. By annotating argument positions as lazy, redundant rewrite steps are avoided, and the termination behavior of a term-rewriting system can be improved. Some transformations of rewrite rules enable an implementation using the same primitives as an implementation of eager rewriting.

- Wan Fokkink
- TACS
- 1994

REPORTRAPPORT The tyft/tyxt format reduces to tree rules Abstract. Groote and Vaandrager 5] introduced the tyft/tyxt format for transition system speciications (TSSs), and established that for each TSS in this format that is well-founded, the strong bisimulation it induces is a congruence. In this paper, we construct for each TSS in tyft/tyxt format an… (More)

- Elena M. Bortnik, S. P. Luttik, J. M. van de Mortel-Fronczak, Wan Fokkink
- 2004

Nowadays, due to increasing system complexity and growing competition and costs, industry makes high demands on powerful techniques used to design and analyze manufacturing systems. One of the most popular techniques to do performance analysis is simulation. However, simulation-based analysis becomes insufficient since it cannot guarantee the correctness of… (More)

- Bard Bloom, Wan Fokkink, Rob J. van Glabbeek
- ACM Trans. Comput. Log.
- 2004

This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labeled transition systems, and formats of transition system specifications using Plotkin's structural approach. For several preorders in the linear time---branching time spectrum a format is given, as general as… (More)