Reisig, W.: Temporal logic and causality in concurrent systems. Proceedings of CONCURRENCY'88, Lecture Notes in Computer Science  Home/Search   Document Not in Database   Summary   Related Articles   Check

....logics seems to be a non trivial task. Some partial results may be found in [39] In [34] the authors present proof rules for the logic ISTL with a trace semantics together with a relative expressive completeness result. Reisig has also developed a kit of proof rules for a version of UNITY logic [40, 41]. The models of this logic are the non sequential processes of a net system and the proof rules are mainly designed to help reason about distributed algorithms modelled using net systems. At present not much is known about corresponding logics in a branching time setting. Most of the attempts in ....

Reisig, W.: Temporal logic and causality in concurrent systems. Proceedings of CONCURRENCY'88, Lecture Notes in Computer Science

....temporal logic during the program run. Thus, some errors can be detected even if they do not occur in the arbitrary interleaving of independent events during the program run. Frey and Weininger [8, 5] and Frey and Oberhuber [7] extend this approach to the full partial order temporal logic of Reisig[14]. The corresponding models are special kinds of finite causal nets, and the logic describes properties of global states of these models. Since models must be finite, model checking is applied post mortem . To debug nonterminating reactive programs, the execution is aborted after some random time ....

W. Reisig. Temporal logic and causality in concurrent systems. In F. Vogt, editor, Proc. Int. Conf. on Concurrency (Concurrency 88), Hamburg, 18.--19. October

....but where one of the nets satis es the liveness property while the other does not. b a b a This suggests to take a di erent structure than a reachability preorder as primitive, as in branching time temporal logics, Hennessy Milner logic or temporal logic based on partial order semantics [15, 33, 4, 30, 31], but in a way compatible with multiplicative conjunction. There have, to date, been a number of suggestive uses of substructural logics in concurrency (e.g. 11, 3, 2, 22, 8, 19, 9, 24, 25] While there has not yet been a de nitive or completely convincing account, the idea of using ....

W. Reisig. Temporal logic and causality in concurrent systems. In F. Vogt, editor, Proceedings of International Conference on Concurrency, pages 121-139, Hamburg, FRG, 1988. Springer-Verlag LNCS 335.

....structure for the interpretation of temporal formulas yields a logic that is more expressive than linear time logic. For some applications, partial orders are needed to express desired properties that cannot be expressed in linear models; examples are the concurrency properties investigated in [Rei 88] However, as long as such properties are not relevant for the description of the intended systems, there is no loss of expressiveness in considering linear ordered sets of events. This is because a partial ordering is completely equivalent to the set of total orderings consistent with it. As ....

W. Reisig, Temporal Logic and Causality in Concurrent Systems. Proceedings of CONCURRENCY 88, Hamburg. Lecture Notes in Computer Science, Springer 1988.

....interpretations, more specifically to distinguish concurrency from non determinism. There are two approaches to extend linear and branching time temporal logics to partial order logics on global states. Either run modalities are introduced (see QISTL [5] ISTL [5,6] CCTL [9,15] Petri Net Logics [11,12]) or past operators over partial order semantics are defined (see POL [14] PN logics [11,12] and [13, 16] Temporal logics over partial order semantics allow for expressing properties not expressible in logics over interleaving semantics. These properties are: inevitability under concurrency ....

....two approaches to extend linear and branching time temporal logics to partial order logics on global states. Either run modalities are introduced (see QISTL [5] ISTL [5,6] CCTL [9,15] Petri Net Logics [11,12] or past operators over partial order semantics are defined (see POL [14] PN logics [11,12], and [13, 16] Temporal logics over partial order semantics allow for expressing properties not expressible in logics over interleaving semantics. These properties are: inevitability under concurrency fairness assumption [17,18] serializability of database transactions [13, 16] causal ....

[Article contains additional citation context not shown here]

: Reisig, W., Temporal Logic and Causality in Concurrent Systems, LNCS 335, 1988.

....not comparable in the ordering are said to be concurrent. In interleaving semantics the events in a system run are totally ordered; here concurrency is modelled by nondeterministic interleaving. For some applications interleaving models are suitable for capturing system properties. However, in [Rei 88] it has been claimed that for some applications true concurrency models are relevant to describe system properties which cannot be formulated at the level of interleaving semantics. In this paper we restrict our attention to interleaving semantics for the following reasons. On the one hand, the ....

W. Reisig, Temporal Logic and Causality in Concurrent Systems. Proceedings of CONCURRENCY 88, Hamburg. Lecture Notes in Computer Science, Springer 1988.

....to the application level. In other words, the application defines the events and the ordering on them. 4 2.2 Analysis of causal relationships A characteristic feature of a distributed application is the locality of the events generated in the underlying computation. It has been observed in [11, 12] that the causes and effects of an event are in general scoped to a limited subarea of the computation, namely, the set of state components that directly affect or that are directly affected by the ocurrences of the event. To illustrate, consider a set of state components fxg used in an ....

W. Reisig. Temporal Logic and Causality in Concurrent Systems. In Lecture Notes in Computer Science, Springer-Verlag Publ. Co., 1985.

....relation, but where one of the nets satisfies the liveness property while the other does not. This suggests to take a different structure than a reachability preorder as primitive, as in branching time temporal logics, Hennessy Milner logic or temporal logic based on partial order semantics [14, 29, 4, 27, 28], but in a way compatible with multiplicative conjunction. There have, to date, been a number of suggestive uses of substructural logics in concurrency (e.g. 11, 3, 2, 20, 8, 17, 9, 21, 22] While there has not yet been a definitive or completely convincing account, the idea of using ....

W. Reisig. Temporal logic and causality in concurrent systems. In F. Vogt, editor, Proceedings of International Conference on Concurrency, pages 121--139, Hamburg, FRG, 1988. Springer-Verlag LNCS 335.

....but where one of the nets satisfies the liveness property while the other does not. b a b a This suggests to take a different structure than a reachability preorder as primitive, as in branching time temporal logics, Hennessy Milner logic or temporal logic based on partial order semantics [15, 33, 4, 30, 31], but in a way compatible with multiplicative conjunction. There have, to date, been a number of suggestive uses of substructural logics in concurrency (e.g. 11, 3, 2, 22, 8, 19, 9, 24, 25] While there has not yet been a definitive or completely convincing account, the idea of using ....

W. Reisig. Temporal logic and causality in concurrent systems. In F. Vogt, editor, Proceedings of International Conference on Concurrency, pages 121--139, Hamburg, FRG, 1988. Springer-Verlag LNCS 335.

....Science, Polish Academy of Sciences 00 901 Warsaw, PKiN, P.O. Box 22, Poland May 15, 1995 Keywords: Undecidability; Partial Order Temporal Logics; Concurrency; Trace Systems; 1 Introduction Partial order temporal logics are used frequently for specification and verification of concurrent systems [5, 6, 14 17, 19 21]. These logics are more expressive than linear and branching time temporal logics. They allow for expressing partial order properties like serializability of database transactions [14, 17] inevitability under concurrency fairness assumption [15] causal successor [19, 20] layering of a program ....

....systems [5, 6, 14 17, 19 21] These logics are more expressive than linear and branching time temporal logics. They allow for expressing partial order properties like serializability of database transactions [14, 17] inevitability under concurrency fairness assumption [15] causal successor [19, 20], layering of a program [6, 17] snapshots or the concurrency of program segments [17, 21] The ability to require that certain actions be implemented concurrently is very important for system synthesis. For some of the attempts to synthesize programs from their specifications ( 1, 11, 18] we ....

: Reisig, W., Temporal logic and causality in concurrent systems, LNCS 335 (1988) 121-139.

....and in temporal logic. In particular, the subsequent presentation shares many concepts with Katz s and Peled s work on interleaving set temporal logic [33, 34] with Pratt s geometric model of concurrency [56] and with Reisig s causality based partial order semantics of non sequential systems [60, 61]. It should be noted, however, that most of these theories are based on more abstract models (where, for example, the notion of processes in the sense of linearly ordered disjoint subsets of events does not exist) and that a different terminology is used in most cases. Informally, a distributed ....

W. Reisig. "Temporal Logic and Causality in Concurrent Systems". Proc. Concurrency'88, F.H. Vogt (ed.), SpringerVerlag, LNCS 335, pp. 121-139, 1988.

....influences the execution of a conditional statement. The POEM model (see section 4) allows to specify different access sequences on common objects. In this way, the POEM model is orthogonal to state action nets. To describe global states of a parallel and distributed program run, we use slices [10] l l l l l l Figure 2. Slices and the relation R which are maximal sets of local states not ordered by R. Figure 2 shows an example for a state action net. Circles represent local states, rectangles actions, and arcs elements of R. The dashed lines represent some slices. The sequence of ....

....This logic describes properties of local states in a slice as well as the connections between slices. Therefore, the logic can be divided into two parts: The logic of local states (LSL) and the temporal logic (TL) containing LSL formulas as atomic formulas. TL is based on a logic proposed in [10]. A formula of LSL may be an expression comparing values of variables in a local state. An expression is satisfied in a local state s if it is true for all values in val(var; s) of variables var. An expression can be undefined if one variable of it is not visible in the functions of stack(s) In ....

W. Reisig. Temporal logic and causality in concurrent systems. In Concurrency 88, LNCS 335, pages 121--139. Springer, Berlin, 1988.

....temporal logic. In particular, the subsequent presentation shares many concepts with Katz s and Peled s work on interleaving set temporal logic [KaP90, KaP92] with Pratt s geometric model of concurrency [Pra91] and with Reisig s causality based partial order semantics of non sequential systems [Rei88, Rei91]. It should be noted, however, that most of these theories are based on more abstract models (where, for example, the notion of processes in the sense of linearly ordered disjoint subsets of events does not exist) and that a different terminology is used in most cases. Informally, a distributed ....

W. Reisig. "Temporal Logic and Causality in Concurrent Systems". Proc. Concurrency'88, F.H. Vogt (ed.), Springer-Verlag, LNCS 335, pp. 121-139, 1988.

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