Most fairness assumptions used for verifying liveness properties are criticised for being too strong or unrealistic. On the other hand, justness, arguably the minimal fairness assumption required for the verification of liveness properties, is not preserved by classical semantic equivalences, such as strong bisimilarity. To overcome this deficiency, we introduce a finer alternative to strong bisimilarity, called enabling preserving bisimilarity. We prove that this equivalence is justness-preserving and a congruence for all standard operators, including parallel composition
Abstract. Modern concurrent algorithms are usually encapsulated in libraries, and complex algorithms...
We cast the notion of bisimulation in the Willems’ behavioral setting. We show that in this setting,...
International audienceConcurrent constraint programming (ccp) is a well-established model for concur...
Sound behavioral equations on open terms may become unsound after conservative extensions of the und...
Bisimulations enjoy numerous applications in the analysis of labeled transition systems. Many of the...
We argue that weak bisimilarity of processes can be conveniently captured in a semantic domain by a...
Traditionally, computer programs have been thought of as entities which take some input, execute a s...
AbstractThis paper presents proof principles for establishing invariance and liveness properties of ...
Reversibility is the capability of a system of undoing its own actions starting from the last perfor...
In the literature, the conditions on history variables or forward simulations that are related to li...
In this paper we study bisimilarity problems for simple process algebras. In particular, we show PSP...
This paper is motivated by the fact that verifying liveness properties under a fairness condition is...
Impossible futures equivalence is the semantic equivalence on labelled transition systems that ident...
Sharp bisimulation is a refinement of divergence-preserving branching (a.k.a. divbranching) bisimula...
A directed labelled graph may be used, at a certain abstraction, to represent a system's behaviour. ...
Abstract. Modern concurrent algorithms are usually encapsulated in libraries, and complex algorithms...
We cast the notion of bisimulation in the Willems’ behavioral setting. We show that in this setting,...
International audienceConcurrent constraint programming (ccp) is a well-established model for concur...
Sound behavioral equations on open terms may become unsound after conservative extensions of the und...
Bisimulations enjoy numerous applications in the analysis of labeled transition systems. Many of the...
We argue that weak bisimilarity of processes can be conveniently captured in a semantic domain by a...
Traditionally, computer programs have been thought of as entities which take some input, execute a s...
AbstractThis paper presents proof principles for establishing invariance and liveness properties of ...
Reversibility is the capability of a system of undoing its own actions starting from the last perfor...
In the literature, the conditions on history variables or forward simulations that are related to li...
In this paper we study bisimilarity problems for simple process algebras. In particular, we show PSP...
This paper is motivated by the fact that verifying liveness properties under a fairness condition is...
Impossible futures equivalence is the semantic equivalence on labelled transition systems that ident...
Sharp bisimulation is a refinement of divergence-preserving branching (a.k.a. divbranching) bisimula...
A directed labelled graph may be used, at a certain abstraction, to represent a system's behaviour. ...
Abstract. Modern concurrent algorithms are usually encapsulated in libraries, and complex algorithms...
We cast the notion of bisimulation in the Willems’ behavioral setting. We show that in this setting,...
International audienceConcurrent constraint programming (ccp) is a well-established model for concur...