P.S. Thiagarajan and J.G. Henriksen. Distributed versions of linear time temporal logic: A trace perspective. In LNCS 1491 (1998) 643-681.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....subjected to the partial order based reduction methods during the verification process. A number of linear temporal logics to be interpreted directly over Mazurkiewicz traces (e.g. APP95, Thi94, TW97] has been proposed starting with TrPTL [Thi94] that was introduced by Thiagarajan (see [MT96, TH98] for overviews) There are several possible routes towards extending linear temporal logics to traces. TrPTL is based on locations, where one reasons explicitly about a distribution of computing agents cooperating through some communication structure given as an alphabet distribution. Another ....

....device is allowed to use a common resource. The communication can be understood as an agreement on the same (communication) action of the two devices communicating (circuit arbiter) We employ distributed transition systems (DTS) which are a well known model for distributed systems (cf. Zie87, TH98] for describing such a given setup. However, DTSs are usually considered with an asynchronous model of execution. We introduce distributed synchronous transition systems (DSTS) which are distributed transition systems with a global clock synchronizing the execution of actions. They can be ....

[Article contains additional citation context not shown here]

P. S. Thiagarajan and J. G. Henriksen. Distributed versions of linear time temporal logic: A trace perspective. Lecture Notes in Computer Science, 1492:643--681, 1998.

....are capable of ring simultaneously, re simultaneously. A possible execution sequence for the presented Petri net would be fa; egfbgfcgfd; fgfggfhg where each set mentions the actions occurring concurrently. Distributed transition systems (DTS) are a well known model for distributed systems (cf. [Zie87,TH98]) However, usually they are considered with an asynchronous model of execution. The simultaneous execution of two independent actions a and b is modelled by the interleaving of a and b, i.e. rst a and then 2 The shown setup of the bus, circuits and the arbiter is described as a sample layout ....

....Transition Systems (DSTS) We introduce a formal model for the underlying concurrent systems, Distributed Synchronous Transition Systems. It is based on Zielonka s asynchronous automata (without nal states, Zie87] or the notion distributed transitions systems (described for example in [TH98]) 5 However, the de nition of a run is modi ed to re ect the idea of a global synchronising clock. Strictly speaking, we only de ne Distributed Transition Systems (DTS) as well as their synchronous and asynchronous runs. However, to denote the context we speak of either synchronous or ....

P. S. Thiagarajan and J. G. Henriksen. Distributed versions of linear time temporal logic: A trace perspective. Lecture Notes in Computer Science, 1492:643-681, 1998.

....of remote components is accessible. The visibility function is de ned on the basis of a relation among states which is symmetric in the case of states belonging to distinguished components. A trace based extension of linear time temporal logic, called TrPTL, has been de ned in [13] see also [14]) The logic has been designed to be interpreted over in nite traces, i.e. labelled partial orders of actions, which respect some dependence relations associated to the alphabet of actions. In [7] a temporal logic, StepTL, is de ned and interpreted over multistep transition systems. These are a ....

P. S. Thiagarajan and J. G. Henriksen. Distributed versions of linear time temporal logic: A trace perspective. Lecture Notes in Computer Science, 1491, 1998.

....of remote components is accessible. The visibility function is de ned on the basis of a relation among states which is symmetric in the case of states belonging to distinguished components. A trace based extension of linear time temporal logic, called TrPTL, has been de ned in [14] see also [15]) The logic has been designed to be interpreted over in nite traces, i.e. labelled partial orders of actions, which respect some dependence relations associated to the alphabet of actions. In [8] a temporal logic, StepTL, is de ned and interpreted over multistep transition systems. These are a ....

P. S. Thiagarajan and J. G. Henriksen. Distributed versions of linear time temporal logic: A trace perspective. Lecture Notes in Computer Science, 1491, 1998.

....as Mazurkiewicz traces [5, 10] These objects apart from alleviating the state explosion problems of veri cation also allow direct formulations of properties expressing concurrency and causality. A number of linear time temporal logics to be interpreted directly over Mazurkiewicz traces (e.g. [1, 4, 11, 14, 15, 16, 17]) has been proposed in the literature starting with TrPTL [15] Among these, we consider here a temporal logic of causality (TLC) introduced in [1] to express serializability (of partially ordered computations) in a direct fashion. The operators of TLC are essentially the branching time operators ....

....i.e. is unde ned and e for every e 2 E f g. It s not hard to show that the traces introduced above as restricted labelled partial orders can be equivalently represented as congruence classes of strings corresponding to the same partially ordered computations (and vice versa; see e.g. [16]) We will sometimes abuse notation and let a string in denote its corresponding trace in ( I) whenever no confusion arises. This is enforced by using conventional parentheses for string languages and square brackets for trace languages. In setting the scene for de ning the semantics of ....

[Article contains additional citation context not shown here]

Thiagarajan, P. S., Henriksen, J. G.: Distributed versions of linear time temporal logic: A trace perspective. In Reisig and Rozenberg (Eds.), Lectures on Petri Nets I: Basic Models, Lecture Notes in Computer

....technical report RS 97 8. Noninterleaving Synchronous Paradigm: Mazurkiewicz Traces Chapter 7 [61] A Product Version of Dynamic Linear Time Temporal Logic . Joint work with P. S. Thiagarajan. Appears in Proceedings of LNCS 1243. It also appears as BRICS technical report RS 97 9. Chapter 8 [138]: Distributed Versions of Linear Time Temporal Logic: A Trace Perspective . Joint work with P. S. Thiagarajan. A chapter of Reisig and Rozenberg (Eds. Lectures on Petri Nets I: Basic Models, LNCS 1491. The survey also appears as BRICS technical report RS 98 8. Chapter 9 [54] An Expressive ....

....traces [27, 86] These objects apart from alleviating the state explosion problems of verification also allow direct formulations of properties expressing concurrency and causality. A number of linear time temporal logics to be interpreted directly over Mazurkiewicz traces (e.g. [4, 25, 26, 102, 115, 135, 138, 139, 150]) has been proposed in the literature starting with TrPTL [135] Among these, we consider here a temporal logic of causality (TLC) introduced in [4] to express serializability (of partially ordered computations) in a direct fashion. The operators of TLC are essentially the branching time ....

[Article contains additional citation context not shown here]

Thiagarajan, P. S., Henriksen, J. G.: Distributed versions of linear time temporal logic: A trace perspective. In Reisig, W., Rozenberg, G. (Eds.): Lectures on Petri Nets I: Basic Models, Lecture Notes in Computer Science

....section we will de ne the syntax and semantics of the temporal logics over traces to be considered in this paper. We start by introducing TLC and continue by giving an explicit de nition of the sublogic TLC. We will not de ne rst order logic over traces (FO) but we refer the reader to e.g. [14, 15]. TLC consists of three di erent syntactic entities; event formulas ( ev ) future chain formulas ( ch ) and past chain formulas ( ch ) de ned by mutual induction as described below: ev : p a j j 1 2 j co( j E( j E ( with a 2 : ch : j j 1 2 j ....

Thiagarajan, P. S., Henriksen, J. G.: Distributed versions of linear time temporal logic: A trace perspective. In Reisig and Rozenberg (Eds.), Lectures on Petri Nets I: Basic Models, LNCS 1491, Springer-Verlag (1998) 643-681

....Mazurkiewicz Traces Chapter 7 [61] A Product Version of Dynamic Linear Time Temporal Logic . Joint work with P. S. Thiagarajan. Appears in Proceedings of the 8th International Conference on Concurrency Theory (CONCUR 97) LNCS 1243. It also appears as BRICS technical report RS 97 9. Chapter 8 [138]: Distributed Versions of Linear Time Temporal Logic: A Trace Perspective . Joint work with P. S. Thiagarajan. A chapter of Reisig and Rozenberg (Eds. Lectures on Petri Nets I: Basic Models, LNCS 1491. The survey also appears as BRICS technical report RS 98 8. Chapter 9 [54] An Expressive ....

....traces [27, 86] These objects apart from alleviating the state explosion problems of verification also allow direct formulations of properties expressing concurrency and causality. A number of linear time temporal logics to be interpreted directly over Mazurkiewicz traces (e.g. [4, 25, 26, 102, 115, 135, 138, 139, 150]) has been proposed in the literature starting with TrPTL [135] Among these, we consider here a temporal logic of causality (TLC) introduced in [4] to express serializability (of partially ordered computations) in a direct fashion. The operators of TLC are essentially the branching time operators ....

[Article contains additional citation context not shown here]

Thiagarajan, P. S., Henriksen, J. G.: Distributed versions of linear time temporal logic: A trace perspective. In Reisig, W., Rozenberg, G. (Eds.): Lectures on Petri Nets I: Basic Models, Lecture Notes in Computer Science 1491, Springer-Verlag (1998) 643--681

No context found.

P.S. Thiagarajan and J.G. Henriksen. Distributed versions of linear time temporal logic: A trace perspective. In LNCS 1491 (1998) 643-681.

No context found.

P. S. Thiagarajan and J. G. Henriksen. Distributed versions of linear time temporal logic: A trace perspective. In W. Reisig and G. Rozenberg, editors, Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, volume 1491 of Lecture Notes in Computer Science, pages 643-681. Springer-Verlag, 1998.

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