Discrete Time Process Algebra and the Semantics of SDL

Bergstra, Jan A.; Middelburg, Cornelis A.; Usenko, Yaroslav S.

doi:10.1016/b978-044482830-9/50036-9

Cited by 13 publications

(13 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[13], [22], [25], [33], [34] and [36], as well as for defining semantics of programming and specification languages, see e.g. [10], [12] and [14].…”

Section: Discussionmentioning

confidence: 99%

Process Algebra with Timing: Real Time and Discrete Time

Baeten¹,

Middelburg²

2001

Handbook of Process Algebra

Self Cite

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

“…[13], [22], [25], [33], [34] and [36], as well as for defining semantics of programming and specification languages, see e.g. [10], [12] and [14].…”

Section: Discussionmentioning

confidence: 99%

Process Algebra with Timing: Real Time and Discrete Time

Baeten¹,

Middelburg²

2001

Handbook of Process Algebra

Self Cite

View full text Add to dashboard Cite

show abstract

“…Later, the generalization of ACPps to arbitrary such Boolean algebras has been treated in [15]. Moreover, a timed version of ACPps has been used in [14] as the basis of a process algebra for hybrid systems and a timed version of ACPps has been used in [17] to give a semantics to a specification language that was widely used in telecommunications at the time.…”

Section: Discussionmentioning

confidence: 99%

Contradiction-Tolerant Process Algebra with Propositional Signals

Bergstra

Middelburg

2017

Self Cite

View full text Add to dashboard Cite

In a previous paper, an ACP-style process algebra was proposed in which propositions are used as the visible part of the state of processes and as state conditions under which processes may proceed. This process algebra, called ACPps, is built on classical propositional logic. In this paper, we present a version of ACPps built on a paraconsistent propositional logic which is essentially the same as CLuNs. There are many systems that would have to deal with self-contradictory states if no special measures were taken. For a number of these systems, it is conceivable that accepting self-contradictory states and dealing with them in a way based on a paraconsistent logic is an alternative to taking special measures. The presented version of ACPps can be suited for the description and analysis of systems that deal with self-contradictory states in a way based on the above-mentioned paraconsistent logic.

show abstract

“…In Ref. [23], a counterpart of BPA srt ps with discrete relative timing is presented, which includes a non-waiting version of the conditional proceeding operator as well as a waiting version. In that paper, the symbol :→ is used for the waiting version.…”

Section: Bpa Srt With Propositional Signalsmentioning

confidence: 99%

“…relative timing introduced in Ref. [23], is required for axiom PSSRCM to be sound. Axiom PSSRCM is useful dealing with the parallel composition of processes that are conditionally capable of idling.…”

Section: Acp Srt For Hybrid Systemsmentioning

confidence: 99%

Process algebra for hybrid systems

Bergstra

Middleburg

2005

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

We propose a process algebra obtained by extending a combination of the process algebra with continuous relative timing from Baeten and Middelburg (Process Algebra with Timing, Springer, Berlin, 2002, Chapter 4), and the process algebra with propositional signals from Baeten and Bergstra (Theoret. Comput. Sci. 177 (1977) 381-405). The proposed process algebra makes it possible to deal with the behaviour of hybrid systems, i.e. systems in which the instantaneous state transitions caused by performing actions are alternated with continuous state evolutions. This process algebra has, in addition to equational axioms, rules to derive equations with the help of real analysis. (J.A. Bergstra), keesm@win.tue.nl (C.A. Middelburg) URL: http://www.win.tue.nl/∼keesm (C.A. Middelburg).0304-3975/$ -see front matter

show abstract

Discrete Time Process Algebra and the Semantics of SDL

Cited by 13 publications

References 14 publications

Process Algebra with Timing: Real Time and Discrete Time

Process Algebra with Timing: Real Time and Discrete Time

Contradiction-Tolerant Process Algebra with Propositional Signals

Process algebra for hybrid systems

Contact Info

Product

Resources

About