scientific article; zbMATH DE number 4119617
[For the entire collection see Zbl 0683.68001.] This paper presents some of the recent developments for the specification, verification and development of reactive programs in the temporal formal systems. The authors observe that the methodology of the present temporal logics is based on two major design decisions: (1) Only the future fragment is considered; and (2) Satisfiability and validity are evaluated at all positions in the computation. Relaxing one or both of these design decisions, some properties have a more natural expression when using the past operators. This is done by the special state predicate init, which characterizes the initial point in the computation. By adding the past fragment to temporal logic, it has been found that, while not increasing the expressive power of the language, important contributions to the utility of the language are done: (a) Many properties, including the generalization rule, have a more natural expression when using the past operators; (b) Classification of the properties expressible by temporal logic into several classes; (c) Closer connections between temporal logic and transition-based formalisms such as \(\omega\)-automata; (d) The relative cost of this expansion was found to be quite modest. The decision procedure for the propositional segment has the same complexity as that of the pure future fragment. A complete deductive system (for the propositional segment), and the model checking procedure have been derived. Section 2 analyzes some abstract and concrete (shared variables, synchronous message passing) computational models. Section 3 describes the language of the (extended) temporal logic with the four temporal operators: two for past (previous, and since), and two for future (next, and until). Section 4 is devoted to the classification of temporal properties using different criteria: semantical, topological characteristics, their expressiveness, predicate-automata characterization etc. The axiomatics, theorems, and derived rules of the temporal logic future fragment are exposed. Section 6 gives a general proof system of the temporal logic with the set of past operators. The proof system for proving specific properties met in (concurrent) programming languages represents the object of Section 7.
- Abstract animator for temporal specifications: Application to TLA
- A temporal module for logical frameworks
- Paving the way for temporal grounding
- On refinement and temporal annotations
- A framework for knowledge-based temporal abstraction
- An introduction to constraint-based temporal reasoning
- Foundations of Temporal Conceptual Data Models
- Temporal variables and the binding in the temporal database
- Temporal annotated constraint logic programming
- Simulation, reduction and preservation of correctness properties of parallel systems
- Specification and verification of decentralized daisy chain arbiters with \(\omega\)-extended regular expressions
- Completing the temporal picture
- Local model checking for infinite state spaces
- On undecidability of propositional temporal logics on trace systems
- Reasoning about nondeterministic and concurrent actions: A process algebra approach
- Proving partial order properties
- Logics and decidability for labelled pre- and partially ordered Kripke structures
- A compositional framework for fault tolerance by specification transformation
- Specification of abstract dynamic-data types: A temporal logic approach
- A computer scientist looks at game theory.
- Verification of reactive systems using temporal logic with clocks
- Testing preorders for probabilistic processes can be characterized by simulations
- Model checking properties on reduced trace systems
- Specification in CTL + past for verification in CTL.
- scientific article; zbMATH DE number 3888909 (Why is no real title available?)
- Linear-time temporal logic with event freezing functions
- Past–future separation and normal forms in temporal predicate logic specifications
- scientific article; zbMATH DE number 3898203 (Why is no real title available?)
- scientific article; zbMATH DE number 3940713 (Why is no real title available?)
- scientific article; zbMATH DE number 1471238 (Why is no real title available?)
- Temporal logic and categories of Petri nets
- Reasoning about programs by exploiting the environment
- Decision procedures for a deontic logic modeling temporal inheritance of obligations
- Application of the composition principle to unity-like specifications
- Automated Technology for Verification and Analysis
- Modal logics for communicating systems
- Axioms for real-time logics
- Towards better heuristics for solving bounded model checking problems
- Representing regular languages of infinite words using mod 2 multiplicity automata
- An action based framework for verifying logical and behavioural properties of concurrent systems
- Verifying properties of HMS machine specifications of real-time systems
- Opportunistic monitoring of multithreaded programs
- A hierarchy of temporal logics with past
- On using temporal logic for refinement and compositional verification of concurrent systems
- Concurrent IMP
- ConcurrentHOL
- On the strength of temporal proofs
- Deontic action logic, atomic Boolean algebras and fault-tolerance
- Automated analysis of mutual exclusion algorithms using CCS
- Automatic verification of distributed systems: the process algebra approach.
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 Q4733399)