#### Filter Results:

- Full text PDF available (62)

#### Publication Year

1980

2017

- This year (0)
- Last 5 years (8)
- Last 10 years (30)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

Process algebra is a widely accepted and much used technique in the specification and verification of parallel and distributed software systems. This book sets the standard for the field. Itâ€¦ (More)

- Jos C. M. Baeten, Jan A. Bergstra
- Formal Aspects of Computing
- 1991

We describe an axiom system ACP p that incorporates real timed actions. Many examples are provided in order to explain the intuitive contents of the notation. ACP p is a generalisation of ACP. Thisâ€¦ (More)

- Jos C. M. Baeten
- Theor. Comput. Sci.
- 2005

This note addresses the history of process algebra as an area of research in concurrency theory, the theory of parallel and distributed systems in computer science. Origins are traced back to theâ€¦ (More)

- Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka
- Inf. Comput.
- 1995

This paper is concerned with finding complete axiomatizations of probabilistic processes. We examine this problem within the context of the process algebra ACP and obtain as our end-result the axiomâ€¦ (More)

- Jos C. M. Baeten, Jan A. Bergstra
- Formal Aspects of Computing
- 1992

The axiom system ACP of [BeK84a] was extended with real time features in [BaB91]. Here we proceed to define a discrete time extension of ACP, along the lines of ATP [NiS94]. We present versions basedâ€¦ (More)

- Jos C. M. Baeten, Kees Middelburg
- Monographs in Theoretical Computer Science. Anâ€¦
- 2002

ion from certain actions is an important notion in process algebras. Frequently, a system is specified at a high level of abstraction, and then refined as a system of interacting components. Theâ€¦ (More)

- Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
- PARLE
- 1987

A context-free grammar (CFG) in Greibach Normal Form coincides, in another notation, with a system of guarded recursion equations in Basic Process .$dgebrzd. Hence, to each CFG, aprocess can beâ€¦ (More)

- Jos C. M. Baeten, D. A. van Beek, Bas Luttik, Jasen Markovski, J. E. Rooda
- Proceedings of the 2011 American Controlâ€¦
- 2011

We revisit the central notion of controllability in supervisory control theory from process-theoretic perspective. To this end, we investigate partial bisimulation preorder, a behavioral preorderâ€¦ (More)

- Jos C. M. Baeten, Jan A. Bergstra
- Theor. Comput. Sci.
- 1997

We consider processes that have transitions labeled with atomic actions, and states labeled with formulas over a propositional logic. These state labels are called signals. A process in a parallelâ€¦ (More)

- Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
- Theor. Comput. Sci.
- 1987

We construct a graph model for ACP,, the algebra of communicating processes w%h silent steps, in which Koomenâ€™s Fair Abstraction Rule (KFAR) holds, and also versions of the Approximation Inductionâ€¦ (More)