Gebruikersprofielen voor "Bergstra, J.A. "
 | Jan Aldert Bergstraprofessor of informatics, Institute of Informatics, University of Amsterdam NL Geverifieerd e-mailadres voor uva.nl Geciteerd door 15826 |
Algebra of communicating processes with abstraction
JA Bergstra, JW Klop - Theoretical computer science, 1985 - Elsevier
We present an axiom system ACP, for communicating processes with silent actions (‘τ-steps’).
The system is an extension of ACP, Algebra of Communicating Processes, with Milner's τ-…
The system is an extension of ACP, Algebra of Communicating Processes, with Milner's τ-…
Process algebra for synchronous communication
JA Bergstra, JW Klop - Information and control, 1984 - Elsevier
Within the context of an algebraic theory of processes, an equational specification of process
cooperation is provided. Four cases are considered: free merge or interleaving, merging …
cooperation is provided. Four cases are considered: free merge or interleaving, merging …
[BOEK][B] Handbook of process algebra
Process Algebra is a formal description technique for complex computer systems, especially
those involving communicating, concurrently executing components. It is a subject that …
those involving communicating, concurrently executing components. It is a subject that …
Real time process algebra
JCM Baeten, JA Bergstra - Formal Aspects of Computing, 1991 - Springer
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 …
provided in order to explain the intuitive contents of the notation. ACP p is a generalisation …
[BOEK][B] Algebraic specification
JA Bergstra - 1989 - dl.acm.org
Algebraic specification | ACM Other Books skip to main content ACM Digital Library home ACM
home Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced …
home Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced …
Module algebra
JA Bergstra, J Heering, P Klint - Journal of the ACM (JACM), 1990 - dl.acm.org
Module Algebra Page 1 Module Algebra JA BERGSTRA University of Amsterdam,
Amsterdam, The Netherlands University of Utrecht, Utrecht, The Netherlands J. HEERING …
Amsterdam, The Netherlands University of Utrecht, Utrecht, The Netherlands J. HEERING …
Syntax and defining equations for an interrupt mechanism in process algebra
A mechanism is introduced to describe priorities in ACP, the algebra of communicating
processes, whereby some actions have priority over others in a non-deterministic choice (or sum)…
processes, whereby some actions have priority over others in a non-deterministic choice (or sum)…
Conditional rewrite rules: Confluence and termination
JA Bergstra, JW Klop - Journal of Computer and System Sciences, 1986 - Elsevier
Algebraic specifications of abstract data types can often be viewed as systems of rewrite
rules. Here we consider rewrite rules with conditions, such as they arise, eg, from algebraic …
rules. Here we consider rewrite rules with conditions, such as they arise, eg, from algebraic …
A characterisation of computable data types by means of a finite equational specification method
JA Bergstra, JV Tucker - International Colloquium on Automata …, 1980 - Springer
By redefining the construction of finite equational hidden function specifications of data types,
as these are made with the initial algebra methodology of the ADJ Group, we are able to …
as these are made with the initial algebra methodology of the ADJ Group, we are able to …
Decidability of bisimulation equivalence for process generating context-free languages
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, …
a system of guarded recursion equations in Basic Process. $ dgebrzd. Hence, to each CFG, …