Add to ORKGDI-algebra is a process algebra for delay-insensitive processes. Like in most process algebras, a normal form for finite expressions can be defined. Unlike most process algebras, however we show that we can also define a normal form for recursive expressions. This is done by first eliminating operators using the laws of the algebra and then minimizing cycles in a state graph
AbstractRefining techniques of previous works, we obtain a normal form arithmetical representation f...
In [7], an algebra for timed automata has been introduced. In this article, we introduce a syntactic...
Abstract. The paper introduces a new approach to define process algebras withquantified transitions....
DI-algebra is a process algebra for delay-insensitive processes. Like in most process algebras, a no...
A process algebra is given for specifying delay-insensitive processes. We show in two steps that exp...
A process algebra is given for specifying delay-insensitive processes. We show in two steps that exp...
Numerous formalisms exist to specify delay-insensitive computations and their implementations. It is...
We develop a (co)algebraic framework to study a family of process calculi with monadic branching str...
A classical while-program normal-form theorem is derived in demonic refinement algebra. In contrast ...
AbstractA classical while-program normal-form theorem is derived in demonic refinement algebra. In c...
© 2018 Association for Computing Machinery. Recursive programs can now be expressed as normal forms ...
The methods of constructing normal forms in the class of algebras are considered. Formulas of algebr...
Recently there has been a growing interest towards algebraic structures that are able to express for...
We provide rules for calculating with invariants in process algebra with data, and illustrate these ...
Process algebra is a device for analysing sequential processes, and has been studied in Amsterdam si...
AbstractRefining techniques of previous works, we obtain a normal form arithmetical representation f...
In [7], an algebra for timed automata has been introduced. In this article, we introduce a syntactic...
Abstract. The paper introduces a new approach to define process algebras withquantified transitions....
DI-algebra is a process algebra for delay-insensitive processes. Like in most process algebras, a no...
A process algebra is given for specifying delay-insensitive processes. We show in two steps that exp...
A process algebra is given for specifying delay-insensitive processes. We show in two steps that exp...
Numerous formalisms exist to specify delay-insensitive computations and their implementations. It is...
We develop a (co)algebraic framework to study a family of process calculi with monadic branching str...
A classical while-program normal-form theorem is derived in demonic refinement algebra. In contrast ...
AbstractA classical while-program normal-form theorem is derived in demonic refinement algebra. In c...
© 2018 Association for Computing Machinery. Recursive programs can now be expressed as normal forms ...
The methods of constructing normal forms in the class of algebras are considered. Formulas of algebr...
Recently there has been a growing interest towards algebraic structures that are able to express for...
We provide rules for calculating with invariants in process algebra with data, and illustrate these ...
Process algebra is a device for analysing sequential processes, and has been studied in Amsterdam si...
AbstractRefining techniques of previous works, we obtain a normal form arithmetical representation f...
In [7], an algebra for timed automata has been introduced. In this article, we introduce a syntactic...
Abstract. The paper introduces a new approach to define process algebras withquantified transitions....