scientific article; zbMATH DE number 4119598
[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.
- scientific article; zbMATH DE number 4081518
- On using temporal logic for refinement and compositional verification of concurrent systems
- Composition of temporal-logic specifications. Specification and verification of systems with temporal logic of distributed actions
- scientific article; zbMATH DE number 52331
- Composition of temporal logic specifications
- scientific article; zbMATH DE number 15894
- Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking
- Temporal logics for concurrent recursive programs: satisfiability and model checking
- Specification and verification using temporal logics
- Control machines: A new model of parallelism for compositional specifications and their effective compilation
- Compositionality and bisimulation: A negative result
- Temporal theories as modularisation units for concurrent system specification
- \(\infty\)-regular temporal logic and its model checking problem
- Composing and refining dense temporal logic specifications
- A temporal programming model with atomic blocks based on projection temporal logic
- RGITL: a temporal logic framework for compositional reasoning about interleaved programs
- Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking
- scientific article; zbMATH DE number 3932376 (Why is no real title available?)
- scientific article; zbMATH DE number 4060695 (Why is no real title available?)
- scientific article; zbMATH DE number 4081518 (Why is no real title available?)
- scientific article; zbMATH DE number 4089533 (Why is no real title available?)
- scientific article; zbMATH DE number 15894 (Why is no real title available?)
- A stuttering closed temporal logic for modular reasoning about concurrent programs
- Introducing parallel composition to the timed refinement calculus
- A Branching Time Logical System for Open Distributed Systems Development
- scientific article; zbMATH DE number 7311251 (Why is no real title available?)
- Similarity saturation for first order linear temporal logic with UNLESS
- Composition of temporal logic specifications
- On using temporal logic for refinement and compositional verification of concurrent systems
- Integrating predicate transition nets with first order temporal logic in the specification and verification of concurrent systems
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)