Cornelis A. Middelburg. Variable binding operators in transition system specifications. Journal of Logic and Algebraic Programming, 47(1):15--45, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Real Time Process Algebra With Time-Dependent Conditions - Baeten, Middelburg (2001) Self-citation (Middelburg) (Correct)
No context found.
C.A. Middelburg, Variable binding operators in transition system specifications, Journal of Logic and Algebraic Programming 47 (2001) 15--45.
Operational Conservativity with Binding Terms - Middelburg Computing Science Self-citation (Middelburg) (Correct)
No context found.
Middelburg, C.: Variable binding operators in transition system speci cations. Journal of Logic and Algebraic Programming 47 (2001) 15-45
A New Equivalence for Processes with Timing With an.. - Baeten, Middelburg.. Self-citation (Middelburg) (Correct)
No context found.
C.A. Middelburg. Variable binding operators in transition system speci cations. Journal of Logic and Algebraic Programming, 47(1):15-45, 2001.
Operational Conservativity with Binding Terms - Middelburg Self-citation (Middelburg) (Correct)
....[11] The original TSSs de ne binary transition relations by means of transition rules with positive premises. The notion of TSS was generalized in [3] 9] 16] and [6] to TSSs that de ne unary and binary transition relations by means of transition rules with positive and negative premises. In [13], we generalized it further to cover variable binding operators. The new TSSs can amongst other things deal with: the integration operator R of real time ACP [1] the sum operator P of CRL [10] and the recursion operator The work presented in this paper has been partly carried out while ....
....found that the notions of bisimulation and panth format generalize naturally to the new TSSs, and moreover that in the new setting bisimulation is still a congruence for meaningful TSSs in panth format. The notion of TSS was rst generalized to cover variable binding operators in [7] We chose in [13] to introduce an alternative extension that keeps the new TSSs more closely related to the original ones. In [7] no transition rule format is given that guarantees that bisimulation is a congruence. However, in that paper syntactic criteria are given to determine whether a TSS is an operational ....
[Article contains additional citation context not shown here]
C.A. Middelburg. Variable binding operators in transition system speci- cations. Journal of Logic and Algebraic Programming, 47:15-45, 2001.
Congruence for SOS with Data - Mohammadreza Mousavi Michel (Correct)
No context found.
Cornelis A. Middelburg. Variable binding operators in transition system specifications. Journal of Logic and Algebraic Programming, 47(1):15--45, 2001.
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