in Temporal Logics Wojciech Penczek Institute of Computer Science Polish...  Home/Search
Context
Related
| ipipan.waw.pl/~pencze...chapter95.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ipipan.waw.pl/~pencze...allpapers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The aim of this paper is to present existing propositional temporal logics with branching and partially ordered time. These logics are used for specifying and proving properties of programs and systems. The branching time approach is useful e.g. for non-deterministic programs and can be applied also for concurrent programs. The partial order approach is especially useful for concurrent programs and allows one to study more subtle properties than those based on branching time. (Update)
Similar documents based on text: More All
0.3: Branching Time and Partial Order in Temporal Logics - Penczek (1995) (Correct)
0.3: Model Checking of Causal Knowledge Formulas - Penczek, Ambroszkiewicz (1999) (Correct)
0.2: Team Formation by Self-Interested Mobile Agents - Ambroszkiewicz, Matyja, Penczek (1998) (Correct)
BibTeX entry: (Update)
@misc{ logics-branching,
author = "In Temporal Logics",
title = "Branching Time and Partial Order",
url = "citeseer.ist.psu.edu/718656.html" }
Citations (may not include all citations):1097 Automatic Verification of Finite State Concurrent Systems Us.. (context) - Clarke, Emerson et al. - 1983
397 Design and Synthesis of Synchronization Skeletons Using Bran.. (context) - Clarke, Emerson - 1981
195 Propositional Dynamic Logic of Regular Programs (context) - Fischer, Ladner - 1979
139 An Introduction to Event Structures (context) - Winskel - 1989
48 Branching Time Temporal Logic (context) - Emerson, Srinivasan - 1988
45 Deciding Full Branching Time Logic (context) - Emerson, Sistla - 1984
40 Improved upper and lower bounds for modal logics of programs (context) - Vardi, Stockmeyer - 1985
30 Information and Control (context) - Lehmann, Shelah et al. - 1982
29 A Temporal Logic for Reasoning about Partially Ordered Compu.. (context) - Pinter, Wolper - 1984
26 Using Branching Time Logic to Synthesize Synchronization Ske.. (context) - Emerson, Clarke - 1982
25 and Temporal Logics (context) - Emerson, Tableaux - 1985
24 Alternative Semantics for Temporal Logics (context) - Emerson - 1983
20 A Temporal Logic for Event Structures (context) - Penczek - 1988
17 A Modal logic for a Subclass of Event Structures (context) - Lodaya, Thiagarajan - 1987
16 The Complexity of Propositional Temporal Logic (context) - Sistla, Clarke - 1982
[Article contains additional citations not shown here]
Documents on the same site (http://www.ipipan.waw.pl/~penczek/WPenczek/allpapers.html): More
Model Checking for Modal Logics (Extended Abstract) - Penczek (2001) (Correct)
Towards Formal Specification and Verification in Cyberspace - Ambroszkiewicz, Penczek.. (2000) (Correct)
A Complete Axiomatization of a First-Order Temporal Logic.. - Penczek, Srebrny (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC