A Logic for True Concurrency

Details A Logic for True Concurrency A Logic for True Concurrency

2011-10-18

arxiv.org/abs/1110.4094v1

Computer Science

Logic in Computer Science

26 pages, a preliminary version appeared in CONCUR 2011

Scientific paper

We propose a logic for true concurrency whose formulae predicate about events in computations and their causal dependencies. The induced logical equivalence is hereditary history preserving bisimilarity, and fragments of the logic can be identified which correspond to other true concurrent behavioural equivalences in the literature: step, pomset and history preserving bisimilarity. Standard Hennessy-Milner logic, and thus (interleaving) bisimilarity, is also recovered as a fragment. We also propose an extension of the logic with fixpoint operators, thus allowing to describe causal and concurrency properties of infinite computations. We believe that this work contributes to a rational presentation of the true concurrent spectrum and to a deeper understanding of the relations between the involved behavioural equivalences.

Affiliated with

Also associated with

No associations

Rating

A Logic for True Concurrency 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 A Logic for True Concurrency, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Logic for True Concurrency will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-292966