Abstract
We show here that the linear time temporal logic LTrL [24] can be used as a specification mechanism for restricted signal transition nets[26]. The logic LTrL is interpreted over the finite prefixes of Mazurkiewicz traces. As the reader may be aware,(Mazurkiewicz) traces are restricted labelled partial orders which constitute an elegant and powerful extension of the notion of a sequence. The theory of traces is rich and well-understood [3]. Traces provide the natural language for talking about the non-sequential linear time behaviour of 1-safe Petri nets, and various kinds of distributed transition systems [16]. Starting from [23] a variety of linear time temporal logics for traces have been investigated as surveyed in [8]. The main motivation for studying such logics is that they capture sequential properties that are “robust” w.r.t. interleavings (i.e. either all interleavings of a trace have the property or none do). It is known that such properties can be verified efficiently with the aid of partial order based reduction techniques of various kinds [17].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
