Title: A complete axiomatization of process temporal logic
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 te......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 te...Read More
Publication Year: 2002
Publication Date: 2002-02-15
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot