Theoretical Computer Science

Research Output 1993 2019

Filter
Article
2002

Four equivalent equivalences of reductions

van Oostrom, V. & de Vrijer, R. C., 2002, In : Electronic Notes in Theoretical Computer Science. 70

Research output: Contribution to JournalArticleAcademicpeer-review

Open Access
Term Rewriting Systems
Equivalence
Standardization
Labeling
Permutation

Refinement and Verification Applied to an In-Flight Data Acquisition Unit

Fokkink, W. J., Ioustinova, N., Kesseler, E., van de Pol, J. C., Usenko, Y. S. & Yushtein, Y. A., 2002, In : Lecture Notes in Computer Science. 2421, p. 1-23

Research output: Contribution to JournalArticleAcademicpeer-review

2000

A geometric proof of confluence by decreasing diagrams

Klop, J. W., van Oostrom, V. & de Vrijer, R. C., 2000, In : Journal of Logic and Computation. 10, 3, p. 437-460

Research output: Contribution to JournalArticleAcademicpeer-review

A transition system semantics for the control-driven coordination language MANIFOLD

Bonsanque, M. M., Arbab, F., de Bakker, J. W., Rutten, J. J. M. M., Scutella, A. & Zavattaro, G., 2000, In : Theoretical Computer Science. 240, 1, p. 3-47

Research output: Contribution to JournalArticleAcademicpeer-review

Open Access

Automated Proof Construction in Type Theory using Resolution

Bezem, M., Hendriks, R. D. A. & de Nivelle, H., 2000, In : Lecture Notes in Computer Science. 1831, p. 148-163

Research output: Contribution to JournalArticleAcademicpeer-review

Bisimilarity in term graph rewriting.

Ariola, Z. M., Klop, J. W. & Plump, D., 2000, In : Information and Computation. 156, p. 2-24

Research output: Contribution to JournalArticleAcademicpeer-review

Open Access
Graph Rewriting
Term Rewriting
Copying
Confluence
Modulo

Descendants and origins in term rewriting.

Bethke, I., Klop, J. W. & de Vrijer, R. C., 2000, In : Information and Computation. 159, p. 59-124

Research output: Contribution to JournalArticleAcademicpeer-review

Open Access
Term Rewriting
Calculus
Lemma
Theorem
First-order

Language preorder as a precongruence

Fokkink, W., 28 Jul 2000, In : Theoretical Computer Science. 243, 1-2, p. 391-408 18 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Open Access
Preorder
Bisimulation
Syntactics
Predicate
Congruence

Lazy rewriting on eager machinery

Fokkink, W. J., Kamperman, J. F. T. & Walters, P., 1 Jan 2000, In : ACM Transactions on Programming Languages and Systems. 22, 1, p. 45-86 42 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Machinery

Precongruence formats for decorated trace preorders

Bloom, B., Fokkink, W. & Van Glabbeek, R., 1 Jan 2000, In : Proceedings - Symposium on Logic in Computer Science. p. 107-118 12 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Preorder
Semantics
Trace
Concretes
Specifications

Rooted branching bisimulation as a congruence

Fokkink, W., 1 Jan 2000, In : Journal of Computer and System Sciences. 60, 1, p. 13-37 25 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Open Access
Structural Operational Semantics
Bisimulation
Recursion
Predicate
Congruence
1999

Approximating the bandwidth for asteroidal triple-free graphs.

Kloks, A. J. J., Kratsch, D. & Müller, H., 1999, In : Journal of Algorithms. 32, p. 41-57

Research output: Contribution to JournalArticleAcademicpeer-review

Bisimulation for probabilistic transition systems: a coalgebric approach

de Vink, E. P. & Rutten, J. J. M. M., 1999, In : Theoretical Computer Science. 221, p. 271-293

Research output: Contribution to JournalArticleAcademicpeer-review

Open Access

Conditional linearization.

de Vrijer, R. C., 1999, In : Indagationes Mathematicae. 10, 1, p. 145-159

Research output: Contribution to JournalArticleAcademicpeer-review

Open Access

Extending partial combinatory algebras.

Bethke, I., Klop, J. W. & de Vrijer, R. C., 1999, In : Mathematical Structures in Computer Science (MSCS). 9, 4, p. 483-506

Research output: Contribution to JournalArticleAcademicpeer-review

Open Access
File

Full Abstractness of a Metric Semantics for Action Refinement.

den Hartog, J. I., de Vink, E. P. & de Bakker, J. W., 1999, In : Fundamenta Informaticae. 40, p. 335-382

Research output: Contribution to JournalArticleAcademicpeer-review

Higher-Order Rewriting.

van Raamsdonk, F., 1999, In : Lecture Notes in Computer Science. 1631, p. 220-239

Research output: Contribution to JournalArticleAcademicpeer-review

Independent sets in asteroidal triple-free graphs.

Broersma, H., Kloks, A. J. J., Kratsch, D. & Müller, H., 1999, In : SIAM Journal on Discrete Mathematics. 12, p. 276-287

Research output: Contribution to JournalArticleAcademicpeer-review

New Branchwidth Territories.

Kloks, A. J. J., Kratochv, J. & Müller, H., 1999, In : Lecture Notes in Computer Science. 1563

Research output: Contribution to JournalArticleAcademicpeer-review

On the vertex ranking problem for trapezoid, circular-arc and other graphs.

Deogun, J. S., Kloks, A. J. J., Kratsch, D. & Müller, H., 1999, In : Discrete Applied Mathematics. 98, p. 39-63

Research output: Contribution to JournalArticleAcademicpeer-review

Open Access

Perpetual Reductions in Lambda Calculus.

van Raamsdonk, F., Severi, P., Sørensen, M. H. & Xi, H., 1999, In : Information and Computation. 149, 2, p. 173-225

Research output: Contribution to JournalArticleAcademicpeer-review

Open Access
1998

A Conservative Look at Operational Semantics with Variable Binding

Fokkink, W. & Verhoef, C., 10 Oct 1998, In : Information and Computation. 146, 1, p. 24-54 31 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Open Access
Operational Semantics
Semantics
Transition Systems
Specifications
Specification

A menagerie of non-finitely based process semantics over BPA* — from ready simulation to completed traces

Aceto, L., Fokkink, W. & Ingolfsdottir, A., 1 Jan 1998, In : Mathematical Structures in Computer Science. 8, 3, p. 193-230 38 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Semantics
Trace
Equivalence
Simulation
Preorder

On a question of A. Salomaa: The equational theory of regular expressions over a singleton alphabet is not finitely based

Aceto, L., Fokkink, W. & Ingólfsdóttir, A., 6 Dec 1998, In : Theoretical Computer Science. 209, 1-2, p. 163-178 16 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Open Access
Equational Theory
Regular Expressions
Model
Algebra
Equality

Within ARM's Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite Systems

Fokkink, W. J., Kamperman, J. F. T. & Walters, P., 1 Jan 1998, In : ACM Transactions on Programming Languages and Systems. 20, 3, p. 679-706 28 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Linear systems
1997

An Equational Axiomatization for Multi-exit Iteration

Aceto, L. & Fokkink, W., 15 Sep 1997, In : Information and Computation. 137, 2, p. 121-158 38 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Open Access
Basic Algebra
Process Algebra
Axiomatization
Algebra
Iteration

Termination modulo equations by abstract commutation with an application to iteration

Fokkink, W. & Zantema, H., 15 May 1997, In : Theoretical Computer Science. 177, 2, p. 407-423 17 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Open Access
Term Rewriting
Process Algebra
Electric commutation
Rewriting
Termination

Unification for infinite sets of equations between finite terms

Fokkink, W., 28 May 1997, In : Information Processing Letters. 62, 4, p. 183-188 6 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Unification
Substitution reactions
Infinite Domain
Term
Substitution
1996

A complete axiomatization for prefix iteration in branching bisimulation

Fokkink, W., 1 May 1996, In : Fundamenta Informaticae. 26, 2, p. 103-113 11 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Bisimulation
Axiomatization
Prefix
Algebra
Branching

Axiomatizing Prefix Iteration with Silent Steps

Aceto, L., Van Glabbeek, R., Fokkink, W. & Ingólfsdóttir, A., 25 May 1996, In : Information and Computation. 127, 1, p. 26-40 15 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Open Access
Prefix
Congruence
Stars
Byproducts
Completeness

Ntyft/ntyxt Rules Reduce to Ntree Rules

Fokkink, W. & Van Glabbeek, R., 10 Apr 1996, In : Information and Computation. 126, 1, p. 1-10 10 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Open Access
Transition Systems
Specification
Specifications
Congruence
Bisimulation
1995

An effective axiomatization for real time ACP

Fokkink, W. & Klusener, S., 1 Nov 1995, In : Information and Computation. 122, 2, p. 286-299 14 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Open Access
Axiomatization
Bisimulation
Uncountable
Prefix
Term
1994

A complete equational axiomatization for prefix iteration

Fokkink, W., 23 Dec 1994, In : Information Processing Letters. 52, 6, p. 333-337 5 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Axiomatization
Prefix
Algebra
Term Rewriting Systems
Iteration

Basic process algebra with iteration: Completeness of its equational axioms

Fokkink, W. & Zantema, H., 1 Jan 1994, In : Computer Journal. 37, 4, p. 259-267 9 p.

Research output: Contribution to JournalArticleAcademicpeer-review

Algebra
1993

General discussion

Balint-Kurti, G. G., Dalgarno, A., Simons, J. P., Flower, D., Millar, T. J., Smith, I. W. M., van Dishoeck, E. F., Williams, D. A., Ubachs, W., Eikema, K. S. E., Levelt, P. F., Stolte, S., Hogervorst, W., Rostas, F., Thaddeus, P., Black, J. H., Walmsley, C. M., Watson, J. K. G., Leach, S., Herbst, E. & 15 othersGerlich, D., Duke, B. J., Botschwina, P., Kroto, H., Husain, D., Clary, D. C., Papoular, R., Omont, A., Nenner, I., Kawaguchi, K., Howe, D. A., Oka, T., Tennyson, J., Allamandola, L. J. & Gray, M. D., 1993, In : Journal of the Chemical Society, Faraday Transactions. 89, 13, p. 2161-2173 13 p.

Research output: Contribution to JournalArticleAcademicpeer-review