Wojciech Penczek Depart. of Computing Science Technical University of...  Home/Search
Context Related
| ipipan.waw.pl/~penczek/WPe...FI96.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: Partial order temporal logics interpreted on trace systems have been shown not to have finitary complete axiomatizations due to the fact that the complexity of their decidability problem is in \Pi 1 . This paper gives infinitary complete proof systems for several temporal logics on trace systems e.g. Computation Tree Logic with past operators and an essential subset of Interleaving Set Temporal Logic. (Update)
Context of citations to this paper: More
.... of an infinitary axiomatization of first order linear time temporal logic [Sz87] The preliminary version of this paper appeared in [Pe93b] The rest of the paper is organized as follows. In Section 2, trace systems are defined. Section 3 contains the definition of Trace...
...on dependence orders. They showed that a language of traces is definable in this logic iff it is aperiodic. Penczek and Kuiper [Pe92, Pe93a, Pe93b, PK95] describe several temporal logics on traces, namely Linear Time Temporal Logic (LTL) Computation Tree Logic (CTL )...
Cited by: More
Branching Time and Partial Order - In Temporal Logics (Correct)
Axiomatizations of Temporal Logics on Trace Systems - Wojciech Penczek Depart (1993) (Correct)
A Complete Axiomatization of a First-Order Temporal Logic.. - Penczek, Srebrny (1996) (Correct)
Active bibliography (related documents): More All
0.9: On Undecidability of Propositional Temporal Logics on Trace Systems - Penczek (1995) (Correct)
0.6: Temporal Logic for Computations of Concurrent Automata - Droste, Kuske (1996) (Correct)
0.5: Propositional Temporal Logics and - Equivalences Ursula Goltz (Correct)
Similar documents based on text: More All
0.4: Using Asynchronous Buchi Automata for Efficient Automatic.. - Peled, Penczek (Correct)
0.4: Using Asynchronous Buchi Automata for Efficient Automatic - Verification Of Concurrent (Correct)
0.4: Temporal Logics For Trace Systems: - On Automated Verification (Correct)
Related documents from co-citation: More All
6: Interleaving set temporal logic (context) - Katz, Peled - 1987
5: A temporal logic for event structures (context) - Penczek - 1988
4: Temporal Logics for Trace Systems: On Automated Verification (context) - Penczek - 1992
BibTeX entry: (Update)
Wojciech Penczek. Axiomatizations of temporal logics on trace systems. In P. Enjalbert, A. Finkel, and K. Wagner, editors, LNCS 665, Proceedings of STACS, pages 452--462. Springer-Verlag, 1993. http://citeseer.ist.psu.edu/penczek93axiomatizations.html More
@inproceedings{ penczek93axiomatizations,
author = "Wojciech Penczek",
title = "Axiomatizations of Temporal Logics on Trace Systems",
booktitle = "Proceedings of the10th Annual Symposium on Theoretical Aspects of Computer Science ({STACS}'93), W{\"u}rzburg 1993",
number = "665",
publisher = "Springer",
address = "Berlin-Heidelberg-New York",
editor = "P. Enjalbert and A. Finkel and K. W. Wagner",
pages = "452--462",
year = "1993",
url = "citeseer.ist.psu.edu/penczek93axiomatizations.html" }
Citations (may not include all citations):106 A partial approach to model checking - Wolper - 1991
38 Interleaving set temporal logic (context) - Peled - 1987
31 A logical study of distributed transition systems - Parikh, Ramanujam et al. - 1992
29 A temporal logic for reasoning about partially ordered compu.. (context) - Wolper - 1984
29 The mathematics of metamathematics (context) - Sikorski - 1970
22 Propositional temporal logics and equivalences - Kuiper, Penczek - 1992
18 Proving partial order properties (context) - Pnueli - 1994
9 Specifying and proving serializability in temporal logic (context) - Katz, Pnueli - 1991
2 to appear in Information and Computation (context) - Rozenberg, Thiagarajan et al. - 1995
2 Dordrecht and PWN (context) - Salwicki, Algorithmic et al. - 1987
The graph only includes citing articles where the year of publication is known.
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