#### Filter Results:

- Full text PDF available (140)

#### Publication Year

1971

2017

- This year (6)
- Last 5 years (31)
- Last 10 years (59)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jan Friso Groote
- 1997

We deene a speciication language called`timed CRL'. This language is designed to describe communicating processes employing data and time. Timed CRL is the successor of CRL 17]. It diiers in two main aspects. It is possible to make explicit reference to time using a newàt' operator; p,t is the process p where the rst action must take place at time t.… (More)

- Jan Friso Groote, Frits W. Vaandrager
- Inf. Comput.
- 1992

In this paper the question is considered in which cases a transition system specification in Plotkin style has 'good' properties and deserves the predicate 'structured'. The discussion takes place in a setting of labelled transition systems. The states of the transition systems are terms generated by a single sorted signature and the transitions between… (More)

- Jan Friso Groote
- Theor. Comput. Sci.
- 1993

- Roland N. Bol, Jan Friso Groote
- J. ACM
- 1990

We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in order to be meaningful, that is, to unequivocally define a transition relation. We also provide powerful techniques for proving that a TSS satisfies this criterion, meanwhile… (More)

- Jan Friso Groote, Frits W. Vaandrager
- ICALP
- 1990

This chapter addresses the question how to verify distributed and communicating systems in an effective way from an explicit process algebraic standpoint. This means that all calculations are based on the axioms and principles of the process algebras. The first step towards such verifications is to extend process algebra (ACP) with equational data types… (More)

- Marc Bezem, Jan Friso Groote
- CONCUR
- 1994

- Jan Friso Groote, Joost P. Warners
- Journal of Automated Reasoning
- 2000

HeerHugo is a propositional formula checker that determines whether a given formula is satisfiable or not. The underlying algorithm is based on a specific breadth-first search procedure, with several enhancements including unit resolution and 2-satisfiability tests. Its main ingredient is the branch/merge rule inspired by an algorithm proposed by… (More)

- Jan Friso Groote, Alban Ponse
- Semantics of Specification Languages
- 1993