From Causal Semantics To Duration Timed Models

Details From Causal Semantics To Duration Timed Models From Causal Semantics To Duration Timed Models

2009-07-18

arxiv.org/abs/0907.3226v2

Computer Science

Logic in Computer Science

14 pages

Scientific paper

The interleaving semantics is not compatible with both action refinement and durational actions. Since many true concurrency semantics are congruent w.r.t. action refinement, notably the causality and the maximality ones, this has challenged us to study the dense time behavior - where the actions are of arbitrary fixed duration - within the causality semantics of Da Costa. We extend the causal transition systems with the clocks and the timed constraints, and thus we obtain an over class of timed automata where the actions need not to be atomic. We define a real time extension of the formal description technique CSP, called duration-CSP, by attributing the duration to actions. We give the operational timed causal semantics of duration-CSP as well as its denotational semantics over the class of timed causal transition systems. Afterwards, we prove that the two semantics are equivalent. Finally we extend the duration-CSP language with a refinement operator $\rho$ - that allows to replace an action with a process - and prove that it preserves the timed causal bisimulation.

Affiliated with

Also associated with

No associations

Rating

From Causal Semantics To Duration Timed Models 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 From Causal Semantics To Duration Timed Models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and From Causal Semantics To Duration Timed Models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-683354