The definitions of many known properties of concurrent systems (e.g. liveness, fairness, impartiality, justice) require every action to satisfy some condition. Sometimes the level of actions is too fine and one would like to consider the corresponding conditions for sets of actions.A framework for such treatment is proposed in this paper. The known liveness and fairness properties are generalized and investigated in accordance to the lattice structure of partitions of a set of actions. Partitions are used in order to group actions and form some cruder levels of abstraction
ABSTRACTThis thesis proposes an approach to the specification and proof of liveness propertiesunder ...
Abstract. This paper presents liveness properties that need to be pre-served by Event-B models of di...
We introduce the first process algebra with non-blocking reading actions for modelling concurrent as...
This paper is motivated by the fact that verifying liveness properties under a fairness condition is...
AbstractThis paper presents proof principles for establishing invariance and liveness properties of ...
AbstractFairness properties are very important for the behavior characterization of distributed conc...
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumpt...
In this report, we present a formel model of fair iteration of events for B event systems. The model...
An action system is a framework for describing parallel or distributed systems, for which the refine...
Impossible futures equivalence is the semantic equivalence on labelled transition systems that ident...
Abstract. Fair discrete systems (FDSs) are a computational model of concurrent programs where fairne...
SRI International A liveness property asserts that program execution eventually reaches some desirab...
The design of concurrent systems has to deal with the satisfaction of conditions of good behavior. I...
We present a simulation-based proof method for liveness properties. Our method is based on simulatio...
Fairness in a non-interleaving semantic model for concurrency has been investigated. In contrast to ...
ABSTRACTThis thesis proposes an approach to the specification and proof of liveness propertiesunder ...
Abstract. This paper presents liveness properties that need to be pre-served by Event-B models of di...
We introduce the first process algebra with non-blocking reading actions for modelling concurrent as...
This paper is motivated by the fact that verifying liveness properties under a fairness condition is...
AbstractThis paper presents proof principles for establishing invariance and liveness properties of ...
AbstractFairness properties are very important for the behavior characterization of distributed conc...
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumpt...
In this report, we present a formel model of fair iteration of events for B event systems. The model...
An action system is a framework for describing parallel or distributed systems, for which the refine...
Impossible futures equivalence is the semantic equivalence on labelled transition systems that ident...
Abstract. Fair discrete systems (FDSs) are a computational model of concurrent programs where fairne...
SRI International A liveness property asserts that program execution eventually reaches some desirab...
The design of concurrent systems has to deal with the satisfaction of conditions of good behavior. I...
We present a simulation-based proof method for liveness properties. Our method is based on simulatio...
Fairness in a non-interleaving semantic model for concurrency has been investigated. In contrast to ...
ABSTRACTThis thesis proposes an approach to the specification and proof of liveness propertiesunder ...
Abstract. This paper presents liveness properties that need to be pre-served by Event-B models of di...
We introduce the first process algebra with non-blocking reading actions for modelling concurrent as...