scientific article; zbMATH DE number 4119598

From MaRDI portal
Publication:4733381





[For the entire collection see Zbl 0683.68003.] The paper introduces (Section 2) a primitive language for compositional temporal semantic descriptions of concurrent programs, and its corresponding proof system. It is an \(\omega\)-regular language of a discrete temporal logic (TL). The following class of statements is considered: procedure call, atomic sequential composition, guarded choice, parallel composition, the usual connectives and quantifiers, the temporal connectives (`text', `always', `eventually', `unless', `until'), and fixed-point constructors. The language semantics is formally defined, together with an axiom set, and the corresponding proof system. Viewed as an action language (semantics) of concurrent systems, these techniques are extended (Section 3) to more realistic concurrent programming notions, such as fully-shared variables, synchronized action, channel- based communication at the language level etc. The described TL is based on a linear and discrete time model. But this model will not usually be able to provide a desired fully abstract semantics. The requirements would be that the considered (augmented) TL to possess sequent-oriented operations which would be insensitive to finite stuttering, but sensitive to infinite stuttering. This entails considering a TL on a dense time model. This model would also allow to replace the interleaving model of parallelism by a real parallelism.




Cited in
(21)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733381)