W. Penczek (1993): Axiomatizations of Temporal Logics on Trace Systems. LNCS 665, Springer - Verlag, pp. 452-462. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Temporal Logic for Computations of Concurrent Automata - Droste, Kuske (1996) (Correct)
....or interleaving executions of a parallel program that is given by the partial order mentioned above. In [EM93] Ebinger and Muscholl considered the first order logic 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 ) Interleaving Set Temporal Logic (ISTL ) and Computation Tree Logic with Past Operators (CTL P ) All these logics are interpreted over the prefix ordering of traces ....
W. Penczek. Axiomatizations of temporal logics on trace systems. In P. Enjalbert, A. Finkel, and K.W. Wagner, editors, STACS'93, Lect. Notes in Comp. Science vol. 665, 452--462, Springer, 1993.
Axiomatizations of Temporal Logics on Trace Systems - Penczek (1996) (4 citations) (Correct)
....the technique of Q filters [RS70] tuned to our logics. This technique is traditional in Algorithmic Logic [MS87] and it has been also used for proving completeness 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 System Logic (TSL) A proof system is given in Section 4. A proof of its soundness and completeness is shown in Section 5. Proof systems for CTL P and ISTL are ....
: Penczek, W., Axiomatizations of temporal logics on trace systems, Proceedings of STACS, LNCS 665, Springer-Verlag, Berlin/New York, pp. 452--462, 1993.
Specification of Systems: Theory in Search for.. - Brinksma, Parrow.. (1994) (Correct)
....allows for a distinction between parallel composition and interleaved concurrent composition. Again, parallel composition is often more appropriate during initial design, as it introduces causal order on dependent actions only. The same ideas underly the trace model as proposed by Mazurkiewicz [Maz89, Pen93]. The idea that a layered description of systems is often convenient is also advocated by others like Gerth and Shira, Chou and Gafni, Katz and Peled, Stomp and de Roever and Loyens. GS86, CG88, KP92, SdR89, Sto89, Loy92] One of the main advantages of this setup is that transformation techniques ....
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.
Branching Time and Partial Order - In Temporal Logics Self-citation (Penczek) (Correct)
No context found.
W. Penczek (1993): Axiomatizations of Temporal Logics on Trace Systems. LNCS 665, Springer - Verlag, pp. 452-462.
A Complete Axiomatization of a First-Order Temporal Logic.. - Penczek, Srebrny (1996) Self-citation (Penczek) (Correct)
.... temporal logic of branching time (BTL) 7] and partial order temporal logic [21] Mazurkiewicz traces and trace systems [13] are partial order structures frequently used to give semantics to concurrent programs and interpreting propositional temporal logics ( 12, 6] ISTL [11] TrPTL [26] TSL [22], TLC [1] The first order versions of temporal logics are intended for specifying and proving properties of infinite state concurrent programs [23] The process of program verification requires either a relatively complete program proof rules or a complete proof system of the pure logic usually ....
....No. 8 T11C 029 08 and No. 2 P301 007 04. 1 Program proof rules were defined for first order versions of the following logics: LTL [14] fair CTL [9] and ISTL [23] However, a complete proof system is known only for the first order LTL [25, 16] propositional versions of CTL [8] TSL, and ISTL [22]. The logics TSL and TrPTL have not yet been extended to their first order versions. In the present paper we partialy fill this gap . We define a first order version of the logic TSL (FTSL, for short) interpreted over Mazurkiewicz trace systems. The modalities allow universal and existential ....
[Article contains additional citation context not shown here]
W. Penczek, Axiomatizations of temporal logics on trace systems, Fundamenta Informaticae 25, pp. 183-200, 1996.
Branching Time and Partial Order in Temporal Logics - Penczek (1995) (8 citations) Self-citation (Penczek) (Correct)
....ISTL interpreted over full executions of trace systems is undecidable. 2 The satisfiability problem for ISTL is reduced to the recurring tiling problem, which is known to be undecidable and Pi 1 1 complete. As far no complete proof system for the whole language of ISTL has been defined. In [32], a complete infinitary axiomatization for ISTL without formulas of the form 9 2 p was presented. There has also been defined the logic ISTL [21] which uses the language of CTL with the same models as ISTL, and the logic QISTL [21] which is a branching version of ISTL. Logics on Event ....
W. Penczek (1993): Axiomatizations of Temporal Logics on Trace Systems. LNCS 665, Springer - Verlag, pp. 452-462.
Axiomatizations of Temporal Logics on Trace Systems - Wojciech Penczek Depart (1993) (4 citations) (Correct)
No context found.
: Penczek, W., Axiomatizations of temporal logics on trace systems, Proceedings of STACS, LNCS 665, Springer-Verlag, Berlin/New York, pp. 452--462, 1993.
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