AbstractIn [15], processes represent incomplete specifications that guarantee proper behavior only under assumed constraints. Behaviors are represented as abstract executions. Here we define a corresponding notion of morphism, called process abstractions, as maps that preserve a composition operator on processes. We show that all process abstractions can be obtained from binary relations on execution sets, and we point out a ternary symmetry for process abstractions and the main composition operators. We rework and generalize correctness-preserving properties of commonly used process maps and we study new properties and maps of interest for verification
Given a system model and a predicate over current and new variables, the transition invariant checki...
We recall techniques, mainly based on the theory of process calculi, that we used to prove results i...
Abstract. With algebraic laws a process can be simpli¯ed before ver-ifying its equivalence with anot...
AbstractA language for defining fair asynchronous communicating processes is given. The main operato...
We present an algorithm for the decomposition of processes in a process algebraic framework. Decompo...
Software engineers constantly deal with problems of designing, analyzing, and improving process spec...
Software engineers constantly deal with problems of designing, analyzing, and improving process spec...
In this paper we present an algorithm for the decomposition of processes in a process algebraic fram...
In this paper we sketch a general framework within which a study of networks of processes can be con...
In recent years a wide variety of process algebras has been proposed in the literature. Often these ...
We introduce a new paradigm for concurrency, called behaviours-as-types. In this paradigm, types are...
We describe a framework to generate modal abstract approximations from process algebraic specificati...
Our topic is broadening a practical ”proofs-as-programs” method of program development to “proofs-as...
This paper aims to give a readable and reasonably accessible account of some ideas linking the curre...
We study two notions of expressiveness, which have appeared in abstraction theory for model checking...
Given a system model and a predicate over current and new variables, the transition invariant checki...
We recall techniques, mainly based on the theory of process calculi, that we used to prove results i...
Abstract. With algebraic laws a process can be simpli¯ed before ver-ifying its equivalence with anot...
AbstractA language for defining fair asynchronous communicating processes is given. The main operato...
We present an algorithm for the decomposition of processes in a process algebraic framework. Decompo...
Software engineers constantly deal with problems of designing, analyzing, and improving process spec...
Software engineers constantly deal with problems of designing, analyzing, and improving process spec...
In this paper we present an algorithm for the decomposition of processes in a process algebraic fram...
In this paper we sketch a general framework within which a study of networks of processes can be con...
In recent years a wide variety of process algebras has been proposed in the literature. Often these ...
We introduce a new paradigm for concurrency, called behaviours-as-types. In this paradigm, types are...
We describe a framework to generate modal abstract approximations from process algebraic specificati...
Our topic is broadening a practical ”proofs-as-programs” method of program development to “proofs-as...
This paper aims to give a readable and reasonably accessible account of some ideas linking the curre...
We study two notions of expressiveness, which have appeared in abstraction theory for model checking...
Given a system model and a predicate over current and new variables, the transition invariant checki...
We recall techniques, mainly based on the theory of process calculi, that we used to prove results i...
Abstract. With algebraic laws a process can be simpli¯ed before ver-ifying its equivalence with anot...