Results 1  10
of
95
An Efficiency Preorder for Processes
"... A simple efficiency preorder for CCS processes is introduced, in which p ! q means that q is at least as fast as p, or more generally, p uses at least as much resources as q. It is shown to be preserved by all CCS contexts except summation and it is used to analyse a nontrivial example: differe ..."
Abstract

Cited by 82 (12 self)
 Add to MetaCart
A simple efficiency preorder for CCS processes is introduced, in which p ! q means that q is at least as fast as p, or more generally, p uses at least as much resources as q. It is shown to be preserved by all CCS contexts except summation and it is used to analyse a nontrivial example
Coinduction for preordered algebra
"... We develop a combination, called hidden preordered algebra, between preordered algebra, which is an algebraic framework supporting specification and reasoning about transitions, and hidden algebra, which is the algebraic framework for behavioural specification. This combination arises naturally with ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We develop a combination, called hidden preordered algebra, between preordered algebra, which is an algebraic framework supporting specification and reasoning about transitions, and hidden algebra, which is the algebraic framework for behavioural specification. This combination arises naturally
Characterising Testing Preorders for Broadcasting Distributed Systems
, 2014
"... We present a process calculus for both specifying the desired behaviour of distributed systems and for describing their actual implementation; the calculus is aimed at the internet layer of the TCP/IP reference model. This allows us to define behavioural preorders in the style of DeNicola and Henne ..."
Abstract
 Add to MetaCart
We present a process calculus for both specifying the desired behaviour of distributed systems and for describing their actual implementation; the calculus is aimed at the internet layer of the TCP/IP reference model. This allows us to define behavioural preorders in the style of De
On the Complexity of Deciding Behavioural Equivalences and Preorders  A Survey
, 1996
"... This paper gives an overview of the computational complexity of all the equivalences in the linear/branching time hierarchy [vG90a] and the preorders in the corresponding hierarchy of preorders. We consider finite state or regular processes as well as infinitestate BPA [BK84b] processes. A disti ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
This paper gives an overview of the computational complexity of all the equivalences in the linear/branching time hierarchy [vG90a] and the preorders in the corresponding hierarchy of preorders. We consider finite state or regular processes as well as infinitestate BPA [BK84b] processes. A
A behavioural theory for a picalculus with preorders
"... Abstract. We study the behavioural theory of piP, a picalculus in the tradition of Fusions and Chi calculi. In contrast with such calculi, reduction in piP generates a preorder on names rather than an equivalence relation. We present two characterisations of barbed congruence in piP: the first is ..."
Abstract
 Add to MetaCart
Abstract. We study the behavioural theory of piP, a picalculus in the tradition of Fusions and Chi calculi. In contrast with such calculi, reduction in piP generates a preorder on names rather than an equivalence relation. We present two characterisations of barbed congruence in piP: the first
FOCUS On complete fuzzy preorders and their characterizations
, 2010
"... Abstract In the context of crisp or classical relations, one may find several alternative characterizations of the concept of a total preorder. In this contribution, we first discuss the way of translating those characterizations to the framework of fuzzy relations. Those new properties depend on t ..."
Abstract
 Add to MetaCart
Abstract In the context of crisp or classical relations, one may find several alternative characterizations of the concept of a total preorder. In this contribution, we first discuss the way of translating those characterizations to the framework of fuzzy relations. Those new properties depend
Ready to Preorder: an Algebraic and General Proof
"... There have been quite a few proposals for behavioural equivalences for concurrent processes, and many of them are presented in Van Glabbeek’s linear timebranching time spectrum. Since their original definitions are based on rather different ideas, proving general properties of them all would seem to ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
There have been quite a few proposals for behavioural equivalences for concurrent processes, and many of them are presented in Van Glabbeek’s linear timebranching time spectrum. Since their original definitions are based on rather different ideas, proving general properties of them all would seem
"On the Fly" Verification of Behavioural Equivalences and Preorders
, 1991
"... This paper describes decision procedures for bisimulation and simulation relations between two transition systems. The algorithms proposed here do not need to previously construct them: the verification can be performed during their generation. In addition, a diagnosis is computed when the two trans ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
transitions systems are not equivalent. 1 Introduction One of the successful approaches used for the verification of systems of communicating processes is provided by behavioral equivalence and preorder relations, which allow to compare different descriptions of a given system. More precisely, if we note
Finite axiom systems for testing preorder and De Simone Process Languages
, 2000
"... We prove that testing preorder of De Nicola and Hennessy is preserved by all operators of De Simone process languages. Building upon this result we propose an algorithm for generating axiomatisations of testing preorder for arbitrary De Simone process languages. The axiom systems produced by our alg ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
We prove that testing preorder of De Nicola and Hennessy is preserved by all operators of De Simone process languages. Building upon this result we propose an algorithm for generating axiomatisations of testing preorder for arbitrary De Simone process languages. The axiom systems produced by our
Interferencesensitive preorders for manets,” University Ca’ Foscari Venice
, 2011
"... Abstract—Connectivity and communication interference are two key aspects in mobile adhoc networks (MANETs). We propose a process algebraic model targeted at the analysis of both such aspects of MANETs. The framework includes a probabilistic process calculus and a suite of analytical techniques base ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
based on a probabilistic observational congruence and an interferencesensitive preorder. The observational congruence allows us to verify whether two networks exhibit the same behaviour. The preorder makes it possible to evaluate the interference level of different, behaviourally equivalent, networks
Results 1  10
of
95