TY  - CHAP
T2  - Automatic Verification Methods for Finite State Systems
PB  - Springer
N2  - An interactive system for proving properties of CCS specifications is described. This system allows users to take advantage of all three views of CCS semantics (the transitions, the operationally defined equivalences and the axioms) and to define their own verification strategies for moving from one view to another. The system relies on term rewriting techniques and manipulates only the symbolic representation of specifications without resorting to any other kind of internal representation.
ID  - eprints381
EP  - 67
SN  - 3-540-52148-8
ED  - Sifakis, Joseph
UR  - http://dx.doi.org/10.1007/3-540-52148-8_5
A1  - De Nicola, Rocco
A1  - Inverardi, Paola
A1  - Nesi, Monica
M1  - 407
Y1  - 1990///
SP  - 54
TI  - Using the Adxiomatic Presentation of Behavioural Equivalences for Manipulating CCS Specifications
T3  - Lecture Notes in Computer Science
AV  - none
ER  -