Results 1 
6 of
6
Axiomatisations of Weak Equivalences for De Simone Languages
 Proceedings of the 6th International Conference on Concurrency Theory CONCUR'95
, 1995
"... . Aceto, Bloom and Vaandrager proposed in [ABV92] a procedure for generating a complete axiomatisation of strong bisimulation for process languages in the GSOS format. However, the choice operator +, which the procedure uses, as well as other auxiliary GSOS operators, which it introduces to obtain a ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
(Show Context)
. Aceto, Bloom and Vaandrager proposed in [ABV92] a procedure for generating a complete axiomatisation of strong bisimulation for process languages in the GSOS format. However, the choice operator +, which the procedure uses, as well as other auxiliary GSOS operators, which it introduces to obtain a finite axiomatisation, do not preserve many of weak equivalences. We propose a modification of this procedure, which works for a subclass of process languages in the De Simone format with a special treatment of silent actions. A choice of such a subclass of process languages guarantees that all the considered and auxiliary operators preserve many of weak equivalences. Our procedure generates a complete axiomatisation of refusal simulation preorder and it can be easily adapted to coarser preorders. The completeness result depends on the completeness result for the basic process language, which we prove. This language does not use prefixing with ø and the choice operator +. Instead, we employ...
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 9 (2 self)
 Add to MetaCart
(Show Context)
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 algorithm are finite and complete for processes with nite behaviour. In order to achieve completeness for a subclass of processes with infiite behaviour we use one infinitary induction rule. The usefulness of our results is illustrated in specification and verification of small concurrent systems, where suspension, resumption and alternation of execution of component systems occur. We argue that better speci cations can be written in customised De Simone process languages, which contain both the standard operators as well as new De Simone operators that are specifically tailored for the task in hand. Moreover, the automatically generated axiom systems for such specification languages make the verification more straightforward.
Formats of Ordered SOS Rules with Silent Actions
 Proceedings 7th Conference on Theory and Practice of Software Development (TAPSOFT'97), Lille, LNCS 1214
, 1997
"... We present a general and uniform method for defining structural operational semantics (SOS) of process algebra operators by traditional Plotkinstyle rules equipped with an ordering, the new feature which states the order of application of rules when deriving transitions of process terms. Our method ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
We present a general and uniform method for defining structural operational semantics (SOS) of process algebra operators by traditional Plotkinstyle rules equipped with an ordering, the new feature which states the order of application of rules when deriving transitions of process terms. Our method allows to represent negative premises and copying in the presence of silent actions. We identify a number of general formats of unordered and ordered rules with silent actions and show that divergence sensitive branching and weak bisimulation relations are preserved by all operators in the relevant formats. A comparison with the existing formats for branching and weak bisimulations shows that our formats are more general.
Operational Semantics
"... Reproduction of all or part of this workis permitted for educational or research use on condition that this copyright notice isincluded in any copy. ..."
Abstract
 Add to MetaCart
(Show Context)
Reproduction of all or part of this workis permitted for educational or research use on condition that this copyright notice isincluded in any copy.
unknown title
"... A FullyAbstract Model for the πcalculus This paper provides both a fully abstract (domaintheoretic) model for the πcalculus and a universal (settheoretic) model for the finite πcalculus with respect to strong late bisimulation and congruence. This is done by: considering categorical models, def ..."
Abstract
 Add to MetaCart
(Show Context)
A FullyAbstract Model for the πcalculus This paper provides both a fully abstract (domaintheoretic) model for the πcalculus and a universal (settheoretic) model for the finite πcalculus with respect to strong late bisimulation and congruence. This is done by: considering categorical models, defining a metalanguage for these models, and translating the πcalculus into the metalanguage. A technical novelty of our approach is an abstract proof of full abstraction: The result on full abstraction for the finite πcalculus in the settheoretic model is axiomatically extended to the whole πcalculus with respect to the domaintheoretic interpretation. In this proof, a central role is played by the description of nondeterminism as a free construction and by the equational theory of the metalanguage.