In the process-algebraic verification of systems with three or more components put in parallel,
alphabet axioms are considered to be very useful. These are rules that exploit the information
about the alphabets of the processes involved. The alphabet of a process is the set of actions
it can perform. In this paper, we extend μCRL (a formal proof system for ACP + data) with
such axioms. The alphabet axioms that are added to the proof theory are completely formal
and therefore highly suited for computer-checked verification. This is new compared to previous
papers where the formulation of alphabet axioms relies for a considerable extend on informal data
parameters and implicit (infinite) set theory
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.