I. Ulidowski. Finite axiom systems for testing preorder and De Simone process languages. Theoretical Computer Science, 239(1):97-139, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Axiomatizing GSOS with termination - Baeten, de Vink (Correct)
....that match: the axiomatization should be sound and complete for the model of transition systems modulo (strong) bisimulation. The paper [ABV94] points the way in such an endeavour: in some cases an axiomatization can be derived by just following a recipe. Some other papers in this area are [Uli95, Uli00] (where other equivalence relations besides bisimulation equivalence are considered) However, in the years since the appearance of these papers, we have seen no application of the theory. The reader may wonder why this is so. In our opinion, this is due to the limited process algebraic basis ....
I. Ulidowski. Finite axiom systems for testing preorder and De Simone process languages. Theoretical Computer Science, 239:97-139, 2000.
Ordered SOS Process Languages for Branching and Eager.. - Ulidowski, Phillips (2002) (2 citations) Self-citation (Ulidowski) (Correct)
No context found.
I. Ulidowski. Finite axiom systems for testing preorder and De Simone process languages. Theoretical Computer Science, 239(1):97-139, 2000.
Finite Axiom Systems for Testing Preorder and De Simone Process.. - Ulidowski (1996) (1 citation) Self-citation (Ulidowski) (Correct)
No context found.
I. Ulidowski. Finite axiom systems for testing preorder and De Simone process languages. In M. Wirsing and M. Nivat, editors, Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology AMAST'96, Munchen, Germany, 1996. Springer. LNCS 1101.
Ordered SOS Rules and Weak Bisimulation - Phillips, Ulidowski (1996) Self-citation (Ulidowski) (Correct)
.... weak equivalences were shown to be preserved by all process operators in these formats [10, 9, 12] Secondly, completed) trace congruences with respect to these formats were discovered [10, 11] Thirdly, algorithms for generating complete axiomatisations of some weak equivalences were developed [13, 14, 15]. The main conceptual contribution of the paper is a new method for defining process operators, including the sequential composition and priority operators, by transition rules with no negative antecedents. Our method is based on a simple idea of ordering the transition rules for each operator. ....
....and some new ideas were applied to positive GSOS rules in [9] As a result a number of formats were proposed and a number of weak equivalences, including rooted branching and weak bisimulations, were shown to be preserved by the operators in these formats. Finally, the second author showed in [15] that testing preorder of De Nicola Hennessy [16] is preserved by De Simone (with silent rules) operators. In this paper we shall consider only those rules which belong to (a slightly extended) ISOS format as described in [11, 12] The ISOS rules have two distinctive forms. We will use the ....
[Article contains additional citation context not shown here]
I. Ulidowski. Finite axiom systems for testing preorder and De Simone process languages. In Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology AMAST'96, Munchen, Germany, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC