W. Mao. The Verification of Concurrent Finite-State Systems. PhD thesis, University of Strathclyde, Department of Computer Science, Glasgow, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Modelling of Temporal Properties in a Process Algebra Framework - Cowie (1999) (Correct)
....for constructing behavioural descriptions of system components which will be described in subsequent chapters. This section also presents a characterisation of the distinct states that occur within a Circal process behaviour. This characterisation is based on algorithms described by Mao [37] for the reduction of the size of acceptance graph structures. However the use of the algorithms to identify the distinct states appears to be new. Section 2.4 describes temporal features which are inherent in process algebras and form the basis of expressing temporal properties within the process ....
....that are made in di#erent process algebras. This approach is known as comparative concurrency semantics and is exemplified in the comprehensive surveys of sequential systems by van Glabbeek [63, 64] The relationships between the equivalences is concisely expressed in a semantic lattice. Mao [37] also used this approach in an examination of various equivalences for the Circal process algebra. CHAPTER 2. PROCESS ALGEBRA FRAMEWORKS 28 2.6 Implementing the process algebra An important feature of the Circal as a framework for the modelling of systems and properties is that the process ....
W. Mao. The Verification of Concurrent Finite-State Systems. PhD thesis, University of Strathclyde, Department of Computer Science, Glasgow, 1992.
A Process Algebra Approach to the Verification of.. - Cerone, Cowie, Milne, .. (Correct)
....syntactically different may have the same behaviour, as long as no well defined experiment conducted from outside can distinguish between them. Many different theories exist for providing the rules for distinguishing processes, so defining many different notions of equivalence between processes [14]. The Circal System implements a testing equivalence defined in [19] giving to the expression P = Q the result true, if P and Q are equivalent and false, otherwise. 3 Modelling with the Circal Process Algebra As with any process algebra, the Circal process algebra is a low level language ....
Wenbo Mao. Verification of Concurrent Finite State Systems. PhD thesis, University of Strathclyde, Department of Computer Science, Glasgow, UK, 1992.
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