## Regular Trace Event Structures (1996)

Citations: | 6 - 0 self |

### BibTeX

@MISC{Thiagarajan96regulartrace,

author = {P. S. Thiagarajan and P. S. Thiagarajan},

title = {Regular Trace Event Structures},

year = {1996}

}

### OpenURL

### Abstract

We propose trace event structures as a starting point for constructing effective branching time temporal logics in a non-interleaved setting.

### Citations

477 |
Automata on infinite objects
- Thomas
(Show Context)
Citation Context ... result concerning labelled trace event structures turns out to be -- in an event-based language -- a conservative extension of the standard result concerning regular labelled trees (see for instance =-=[Tho]-=-). In section 6 we show that regular trace event structures and their labelled versions can be identified with unfoldings of finite 1-safe Petri nets. In the concluding section we discuss future work.... |

155 | Stubborn sets for reduced state space generation - Valmari - 1991 |

150 | from One, One for All: on Model Checking Using Representatives - Peled - 1993 |

149 | The bu er tree: A new technique for optimal I/O-algorithms - Arge - 1995 |

114 |
Decidability of second order theories and automata on infinite trees
- Rabin
- 1969
(Show Context)
Citation Context ... labelled tree. For instance, SnS, the monadic second order theory of n-branching trees, is decidable because the decision problem for this logic can be reduced (as shown in the famous paper by Rabin =-=[Rab]-=-) to the emptiness problem for tree automata running over labelled infinite trees. The emptiness problem for these tree automata is decidable because the language of labelled infinite trees accepted b... |

113 | A partial approach to model checking - Godefroid, Wolper - 1994 |

47 |
Notes on finite asynchronous automata
- Zielonka
- 1987
(Show Context)
Citation Context ... d 0 D dg. ffl q in = ;. ffl F = ffdg j d 2 DRg. It is easy to see that L(A) " L(A top ) = L pr where L pr = ts(pr(B)). 2 For showing the converse of lemma 2.6 we shall make use of Zielonka's the=-=orem [Zie]-=- and the gossip automaton [MS]. For presenting Zielonka's theorem we need to introduce asynchronous automata operating over distributed alphabets. A distributed alphabet is a family f\Sigma p g p2P wh... |

46 |
A trace based extension of linear time temporal logic
- Thiagarajan
- 1994
(Show Context)
Citation Context ... adopt the standpoint that trace structures represent distributed behaviours in a branching time framework just as traces represent distributed behaviours in a linear time framework (see for instance =-=[Thi]-=-). Let B ` TR(DR; I) be a trace structure. Then B is supposed to stand for the poset (B; v). The crucial new feature -- in contrast to the classical setting -- is that some elements of B might have a ... |

14 |
Keeping track of the latest gossip: Bounded time-stamps suffice
- Mukund, Sohoni
- 1993
(Show Context)
Citation Context ...= ffdg j d 2 DRg. It is easy to see that L(A) " L(A top ) = L pr where L pr = ts(pr(B)). 2 For showing the converse of lemma 2.6 we shall make use of Zielonka's theorem [Zie] and the gossip autom=-=aton [MS]-=-. For presenting Zielonka's theorem we need to introduce asynchronous automata operating over distributed alphabets. A distributed alphabet is a family f\Sigma p g p2P where P is a finite set of proce... |

13 | Muscholl: Deterministic asynchronous automata for infinite traces
- Diekert, A
- 1994
(Show Context)
Citation Context ...oe 2 L 0 iff # p (oe) ` L for every p. Thus oe 2 L 0 iff oe 2 L(A pr ) as required. 2 Theorem 2.5 now follows at once from lemmas 2.6, 2.10 and prop. 2.2. Lemma 2.10 admits a direct proof as shown in =-=[DM]-=-. However, for the net theoretic characterization of regularity that we obtain later, it is necessary to have our construction underlying the proof of lemma 2.10. 3 Trace Event Structures We now wish ... |

10 |
Traces and logic
- Penczek, Kuiper
- 1995
(Show Context)
Citation Context ...e structures. We do so because they are known in the literature [NW, PK] and the means for going back and forth between trace structures and trace event structures is also well-understood. Indeed, in =-=[PK]-=- a number of branching time temporal logics over trace structures are considered. However these logics turn out to be undecidable. In 2 our view, the key to obtaining useful and yet decidable branchin... |

10 | Relations: Practical Ways to Reason about `new - Names - 1996 |

5 |
Petri nets, event structures
- Nielsen, Plotkin, et al.
- 1981
(Show Context)
Citation Context ...ecognizable for each d 2 d DR. But now the required result follows from the easy observation that L ES x = L c ES x for each x 2 \Sigma. 2 6 A Net Theoretic Characterization The basic result shown in =-=[NPW]-=- says that every 1-safe Petri net unfolds into a prime event structure. Later results appearing in a uniform setting (see [NW] for exact references) show in fact that 1-safe Petri nets and prime event... |

4 | Arge. The I/O-Complexity of Ordered BinaryDecision Diagram Manipulation - Lars - 1996 |

4 | RS-96-25 Devdatt Dubhashi and Desh Ranjan. Balls and Bins: A Study in Negative Dependence - Jensen, Skou - 1996 |

3 |
Towards automata for branching time and partial order
- Huhn, P
- 1996
(Show Context)
Citation Context ...mensional grid. Thus we must find a suitable restriction on trace event structures in order to arrive at branching time legics that are decidable and hopefully interesting. Recently, Huhn and Niebert =-=[HN]-=- have proposed what may be called confusion-free trace event structures as a suitable class of objects. They also formulate a related class of automata and show that the emptiness problem for these au... |

3 |
Trace Structures and other Models for Concurrency
- Nielsen, Winskel
- 1995
(Show Context)
Citation Context ... DR and (a; b) 2 I then [oeab] 2 B. 2 4 Trace structures have a well-understood relationship with prime event structures ([RT, NW]). This relationship, which finds a clean and general presentation in =-=[NW]-=-, will play a central role in the present work. Trace structures have been called trace systems in a logical setting [PK]. We shall adopt the standpoint that trace structures represent distributed beh... |

2 | Ramanujam and P.S. Thiagarajan: A - Lodaya, Parikh, et al. - 1995 |

2 | BDD Algortihms and Cache Misses - Klarlund, Rauhe - 1996 |

1 | Thiagarajan: Event Structures and Trace - Rozoy, S - 1991 |

1 |
Private communication
- Walukiewicz
(Show Context)
Citation Context ...stance [LPRT, PK]). These results suggest that trace structures accompanied by unrestricted labelling functions will not be a tractable collection of objects. Indeed an observation due to Walukiewicz =-=[Wal]-=- suggests that even trace structures accompanied by unrestricted labelling functions will not constitute a tractable collection of objects. (We will say a little more about this in the concluding sect... |

1 | Diekert and A. Muscholl: Deterministic Asynchronous Automata for Infinite Traces - unknown authors - 1994 |

1 | Ramanujam and P.S. Thiagarajan: A Logical Study of Distributed Transition Systems - Lodaya, Parikh, et al. - 1995 |

1 | Rozoy and P.S. Thiagarajan: Event Structures and Trace Monoids, Theoretical - unknown authors - 1991 |