A Framework for Representing Parameterised Processes

Harcourt, EdChalmers tekniska högskola,Chalmers University of Technology (författare)

We describe a faithful representation of value-passing recursive parametric CCS processes in Alf, an implementation of Martin-Lof's constructive type theory. The representation is interesting because we borrow as much as possible from Alf including the domain of value and state expressions and the ability to evaluate them. Usually substitution of either channel values for channel variables and processes for process variables play a necessary role in the semantics. However, substitution is also borrowed from Alf by using higher-order functions. The main importance of this representation is that it allows us to borrow Alf's off-the-shelf theorems about data types and provides a uniform setting for doing various kinds machine assisted proofs, such as bisimulation proofs, equational reasoning, verification of Hennessy-Milner logic formulas. 1 Introduction Machine checked proofs of CCS processes require finite representations of the processes. However, for infinite value and state domains,...

Paczkowski, PawelChalmers tekniska högskola,Chalmers University of Technology (författare)
Prasad, K V S,1952Chalmers tekniska högskola,Chalmers University of Technology(Swepub:cth)prasad (författare)
Chalmers tekniska högskola (creator_code:org_t)

Av författaren/redakt...: Harcourt, Ed; Paczkowski, Pawe ...; Prasad, K V S, 1 ...

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.