Discrete time process algebra with abstraction

Baeten, J.C.M.; Bergstra, Jan A.

doi:10.1007/3-540-60249-6_38

Cited by 7 publications

(14 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The operator V.b, of ACP"t is simply the operator V.b, of ACP dat [4] lifted to the real time setting.…”

Section: Algebra Of Communicating Processesmentioning

confidence: 99%

Process Algebra with Timing: Real Time and Discrete Time

Baeten¹,

Middelburg²

2001

Handbook of Process Algebra

View full text Add to dashboard Cite

We present real time and discrete time versions of ACP with absolute timing and relative timing. The starting-point is a new real time version with absolute timing, called ACPsat, featuring urgent actions and a delay operator. The discrete time versions are conservative extensions of the discrete time versions of ACP being known as ACP dot and ACP d,t. The principal version is an extension of ACP,ot with integration and initial abstraction to allow for choices over an interval of time and relative timing to be expressed. Its main virtue is that it generalizes ACP without timing and most other versions of ACP with timing in a smooth and natural way. This is shown for the real time version with relative timing and the discrete time version with absolute timing.

show abstract

“…The operator V.b, of ACP"t is simply the operator V.b, of ACP dat [4] lifted to the real time setting.…”

Section: Algebra Of Communicating Processesmentioning

confidence: 99%

Process Algebra with Timing: Real Time and Discrete Time

Baeten¹,

Middelburg²

2001

Handbook of Process Algebra

View full text Add to dashboard Cite

show abstract

“…Checking properties like the above-mentioned ones by process algebraic reasoning requires the use of an abstraction mechanism for discrete time processes such as the one presented in [16].…”

Section: Examplementioning

confidence: 99%

“…The process LPJ" will start P in the current time slice or any future time slice. Equations in the setting of BPA,, are given in [16]. The rule for extracting processes with an unbounded start delay is as follows:…”

Section: Downloaded By [] At 20:56 04 January 2015mentioning

confidence: 99%

Algebra of timed frames

Bergstra

Fokkink

Middelburg

1996

International Journal of Computer Mathematics

Self Cite

View full text Add to dashboard Cite

Timed frames are introduced as objects that can form a basis of a model theory fsor discrete time process algebra. An algebraic setting for timed frames is proposed and results ;oncerning its connection with discrete time process algebra are given. The presented theory oc timed frames captures the basic algebraic properties of timed transition systems for the re1a:ive time case. Further structure on timed frames is provided by adding signal inserted states and conditional transitions, thus giving a semantic basis for discrete time process algebra with propositional signals. Time conditions are introduced to cover the absolute time case.

show abstract

“…In [4] the conditional axiom cts(a)·x = cts(a)· y ⇒ cts(a)·(σ rel (x)+ν rel (z)) = cts(a)·(σ rel (y)+ν rel (z)) was introduced to omit a τ -step following one or more time steps. In this paper we replace this conditional axiom by DRTB3 (see Table 5).…”

Section: Axiomatization For Silent Stepmentioning

confidence: 99%

“…The extension of the theory BPA drt τ with parallel composition, with or without communication, can be done along the lines of [4]. We present the extension with parallel composition with communication.…”

Section: Merge With Communicationmentioning

confidence: 99%

Discrete Time Process Algebra with Silent Step

Baeten¹,

Bergstra²,

Reniers³

2000

Proof, Language, and Interaction

View full text Add to dashboard Cite

The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7,15] rather than weak bisimulation semantics [11,20]. The version using relative timing is discussed extensively, versions using absolute and parametric timing are presented in brief. A term model and a graph model are presented and soundness and completeness results are given. The time free theories BPA δ and BPA τ δ are embedded in the discrete time theories. Examples of the use of the relative time theory are given by means of some calculations on communicating buffers.

show abstract

Discrete time process algebra with abstraction

Cited by 7 publications

References 16 publications

Process Algebra with Timing: Real Time and Discrete Time

Process Algebra with Timing: Real Time and Discrete Time

Algebra of timed frames

Discrete Time Process Algebra with Silent Step

Contact Info

Product

Resources

About