AbstractThis paper is an attempt to apply the reasoning principles and calculational style underlying the so-called Bird-Meertens formalism to the design of process calculi, parametrized by a behaviour model. In particular, basically equational and pointfree proofs of process properties are given, relying on the universal characterisation of anamorphisms and therefore avoiding the explicit construction of bisimulations. The developed calculi can be directly implemented on a functional language supporting coinductive types, which provides a convenient way to prototype processes and assess alternative design decisions
AbstractConditionals of some form are incorporated in various algebraic process calculi. What is con...
Induction is a pervasive tool in computer science and mathematics for defining objects and reasoning...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics a...
This paper is an attempt to apply the reasoning principles and calculational style underlying the so...
AbstractThis paper is an attempt to apply the reasoning principles and calculational style underlyin...
This paper suggests functional programming languages with coinductive types as suitable devices for ...
Emerging interaction paradigms, such as service-oriented computing, and new technological challenges...
AbstractThis talk offers a survey of negative results on the existence of finite equational axiomati...
Labelled transition systems admit different but equivalent characterizations either as relational st...
AbstractLabelled transition systems admit different but equivalent characterizations either as relat...
Every day we witness the fast development of the hardware and software technology. This, of course, ...
We develop a (co)algebraic framework to study a family of process calculi with monadic branching str...
AbstractA review is given of the design rationale for ACP style process algebras. An outline of futu...
We present a coinductive proof system for bisimilarity in transition systems specifiable in the de ...
Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which...
AbstractConditionals of some form are incorporated in various algebraic process calculi. What is con...
Induction is a pervasive tool in computer science and mathematics for defining objects and reasoning...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics a...
This paper is an attempt to apply the reasoning principles and calculational style underlying the so...
AbstractThis paper is an attempt to apply the reasoning principles and calculational style underlyin...
This paper suggests functional programming languages with coinductive types as suitable devices for ...
Emerging interaction paradigms, such as service-oriented computing, and new technological challenges...
AbstractThis talk offers a survey of negative results on the existence of finite equational axiomati...
Labelled transition systems admit different but equivalent characterizations either as relational st...
AbstractLabelled transition systems admit different but equivalent characterizations either as relat...
Every day we witness the fast development of the hardware and software technology. This, of course, ...
We develop a (co)algebraic framework to study a family of process calculi with monadic branching str...
AbstractA review is given of the design rationale for ACP style process algebras. An outline of futu...
We present a coinductive proof system for bisimilarity in transition systems specifiable in the de ...
Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which...
AbstractConditionals of some form are incorporated in various algebraic process calculi. What is con...
Induction is a pervasive tool in computer science and mathematics for defining objects and reasoning...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics a...