A Complete Proof System for SCCS with Modal AssertionsUniversity of Cambridge, Computer Laboratory, 1985 - Parallel programming (Electronic computers) - 23 pages |
Common terms and phrases
a)true action altrue assertion DA[A assertion language assertions Assn assertions it satisfies behaviour binary relation bisimulation closed numbered terms closed SCCS term Colin Stirling Computer Laboratory D+[A Define denotational semantics elements entailment relation environment failure-set equivalence false iff they satisfy indexing set information system intuitionistic intuitionistic logic joint US-UK seminar labelled transition system language of assertions language of SCCS language SCCS least fixed point least relation lemma logic modal assertions modal language neighbourhood systems Notes in Comp observational equivalence open sets operational semantics operations process satisfying Programming Research Group proof system recursive definition recx.p relation on assertions satisfaction relation satisfies an assertion SCCS process SCCS with assertions SCCS WITH MODAL semantics of SCCS set of assertions Springer Lecture Notes structural induction Structural rules syntax system for SCCS topological topology on processes transition system associated true University of Cambridge Winskel ΕΙ ΕΙ