J.J. Vereijken. Discrete-Time Process Algebra. PhD thesis, Technische Universiteit Eindhoven, 1997. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
An Algebraic Approach to Transactional Processes - van Beek (2002) (Correct)
....equivalent classes. Theorem 6.4 (Soundness) The set of closed PAtrans terms modulo bisimulation equivalence, T(PAtrans) is a model for PAtrans. closed instantiations of the axiom both sides of the axiom correspond to the same element of the bisimulation model. This proof outline is taken from [24, 6]. The proof can be found in Section A.1. Apart from proving soundness, we prove that all PAtrans terms can be eliminated to a term in a basic process algebra with recursion (BPArec) as de ned in [6] By doing this, we prove that the expressiveness of the process theory has not increased. Since ....
J.J. Vereijken. Discrete-Time Process Algebra. PhD thesis, Technische Universiteit Eindhoven, 1997.
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