A Complete Axiomatization of Process Temporal Logic

Authors:
Magdalena Kacprzak
Affiliations:
Institute of Mathematics, Technical University of Bialystok ul. Wiejska 45A, 15-950 Bialystok, Poland
Venue:
Fundamenta Informaticae
Year:
2002

Citing 5
Cited 0

Decision procedures and expressiveness in the temporal logic of branching time

Journal of Computer and System Sciences
A complete axiomatic characterization of first-order temporal logic of linear time

Theoretical Computer Science
The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
Axiomatizations of temporal logics on trace systems

Fundamenta Informaticae
Algorithmic Logic

Algorithmic Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper is introduced a proof system for branching time temporal logic, called PTL. It allows to verify static and dynamic properties of nondeterministic programs, which are expressed as a temporal formulas of PTL language. The strong completeness theorem of this system is presented.