Computer Science – Logic in Computer Science
Scientific paper
2010-08-12
EPTCS 32, 2010, pp. 15-25
Computer Science
Logic in Computer Science
In Proceedings SOS 2010, arXiv:1008.1906
Scientific paper
10.4204/EPTCS.32.2
One of the basic sanity properties of a behavioural semantics is that it constitutes a congruence with respect to standard process operators. This issue has been traditionally addressed by the development of rule formats for transition system specifications that define process algebras. In this paper we suggest a novel, orthogonal approach. Namely, we focus on a number of process operators, and for each of them attempt to find the widest possible class of congruences. To this end, we impose restrictions on sublanguages of Hennessy-Milner logic, so that a semantics whose modal characterization satisfies a given criterion is guaranteed to be a congruence with respect to the operator in question. We investigate action prefix, alternative composition, two restriction operators, and parallel composition.
Fokkink Wan
Gazda Maciej
No associations
LandOfFree
Congruence from the Operator's Point of View: Compositionality Requirements on Process Semantics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Congruence from the Operator's Point of View: Compositionality Requirements on Process Semantics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Congruence from the Operator's Point of View: Compositionality Requirements on Process Semantics will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-587189