AbstractWe present a process algebra with conditional expressions of which the conditions concern the enabledness of actions in the context in which a process is placed. With those conditions, it becomes easy to model preferential choices. A preferential choice of a process is a choice whereby certain alternatives are excluded if at least one of the other alternatives is permitted by the context in which the process is placed. Preferential choices are often modelled rather indirectly using a priority mechanism
AbstractAn operational semantics for an algebraic theory of concurrency that incorporates a notion o...
The -angelic choice is an operator that captures the behaviour of the external choice of CSP in a br...
Preferences are a fundamental ingredient in a variety of fields, ranging from economics to computer ...
We present a process algebra with conditional expressions of which the conditions concern the enable...
We present a process algebra with conditional expressions of which the conditions concern the enable...
AbstractWe present a process algebra with conditional expressions of which the conditions concern th...
AbstractThis paper presents a process algebra for distributed systems in which some actions may take...
AbstractIn the analysis and design of concurrent systems, it can be useful to assume fairness among ...
We address the issue of incorporating domain-specific prefer-ences in planning systems, where a pref...
We address the issue of incorporating domain-specific prefer-ences in planning systems, where a pref...
Process algebra represents a mathematically rigorous framework for modeling con-current systems of i...
We consider the problem of incorporating arbi-trary preferences in planning systems. A pref-erence m...
We discern three non-classical truth values, and define a five-valued propositional logic. We combin...
An operational semantics for an algebraic theory of concur-rency is developed that incorporates a no...
This paper presents a process algebra for distributed systems in which some actions may take precede...
AbstractAn operational semantics for an algebraic theory of concurrency that incorporates a notion o...
The -angelic choice is an operator that captures the behaviour of the external choice of CSP in a br...
Preferences are a fundamental ingredient in a variety of fields, ranging from economics to computer ...
We present a process algebra with conditional expressions of which the conditions concern the enable...
We present a process algebra with conditional expressions of which the conditions concern the enable...
AbstractWe present a process algebra with conditional expressions of which the conditions concern th...
AbstractThis paper presents a process algebra for distributed systems in which some actions may take...
AbstractIn the analysis and design of concurrent systems, it can be useful to assume fairness among ...
We address the issue of incorporating domain-specific prefer-ences in planning systems, where a pref...
We address the issue of incorporating domain-specific prefer-ences in planning systems, where a pref...
Process algebra represents a mathematically rigorous framework for modeling con-current systems of i...
We consider the problem of incorporating arbi-trary preferences in planning systems. A pref-erence m...
We discern three non-classical truth values, and define a five-valued propositional logic. We combin...
An operational semantics for an algebraic theory of concur-rency is developed that incorporates a no...
This paper presents a process algebra for distributed systems in which some actions may take precede...
AbstractAn operational semantics for an algebraic theory of concurrency that incorporates a notion o...
The -angelic choice is an operator that captures the behaviour of the external choice of CSP in a br...
Preferences are a fundamental ingredient in a variety of fields, ranging from economics to computer ...