Real-time logics: Complexity and expressiveness (Q689093): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 10:40, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Real-time logics: Complexity and expressiveness |
scientific article |
Statements
Real-time logics: Complexity and expressiveness (English)
0 references
6 December 1993
0 references
The authors consider the theory of timed state sequences which combines classical theory of infinite state sequences with a theory of discrete time, via a monotonic function that maps every state to its time. This is suitable for reasoning about real-time temporal systems. They showed to be able to identify two elementary real-time temporal logics as expressively complete fragments of the theory of timed state sequences, and they present tableau-based decision procedures for checking validity. Consequently, these two formalisms are well-suited for the specification and verification of real-time systems.
0 references
propositional temporal logic
0 references
timed state sequences
0 references
real-time temporal systems
0 references
real-time temporal logics
0 references
specification
0 references
verification
0 references