## The Implementation of Mazurkiewicz Traces in POEM

Citations: | 1 - 0 self |

### BibTeX

@MISC{Niebert_theimplementation,

author = {Peter Niebert and Hongyang Qu},

title = {The Implementation of Mazurkiewicz Traces in POEM},

year = {}

}

### OpenURL

### Abstract

Abstract. We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to store trace systems, which allows sharing common prefixes among traces and therefore, reduces memory cost. This structure is easy to extend to incorporate additional features. Two applications are shown in the paper: An extended structure to support an adequate order for Local First Search, and an acceleration of event zone based state space search for timed automata. 1

### Citations

439 |
The SPIN Model Checker: Primer and Reference Manual
- Holzmann
- 2003
(Show Context)
Citation Context ... based state space search for timed automata. 1 Introduction POEM (Partial Order Environment of Marseille) is a new model checking tool (framework) that has a strong emphasis on Partial Order Methods =-=[17, 8, 15, 9, 12, 16, 7, 13, 11]-=-. The motivation for adding POEM to the world of model checkers is based on the authors work on algorithms that have a common basis concerning concurrency, but which are not reflected in a single exis... |

184 |
The Use of Language
- Parikh
- 2001
(Show Context)
Citation Context ... based state space search for timed automata. 1 Introduction POEM (Partial Order Environment of Marseille) is a new model checking tool (framework) that has a strong emphasis on Partial Order Methods =-=[17, 8, 15, 9, 12, 16, 7, 13, 11]-=-. The motivation for adding POEM to the world of model checkers is based on the authors work on algorithms that have a common basis concerning concurrency, but which are not reflected in a single exis... |

178 | W.: An improvement of McMillan’s unfolding algorithm
- Esparza, Römer, et al.
- 2002
(Show Context)
Citation Context ... For application purposes, let us just say here that the bigger the order (in ordering more pairs), the better. The ideal case is that of total adequate orders. Total adequate orders were proposed in =-=[5, 6]-=-. Here we propose a new adequate order for the implementation in POEM. The difference compared to previously proposed orders is that it is based on interleavings rather than partial orders and is thus... |

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

150 | from One, One for All: on Model Checking Using Representatives
- Peled
- 1993
(Show Context)
Citation Context ... based state space search for timed automata. 1 Introduction POEM (Partial Order Environment of Marseille) is a new model checking tool (framework) that has a strong emphasis on Partial Order Methods =-=[17, 8, 15, 9, 12, 16, 7, 13, 11]-=-. The motivation for adding POEM to the world of model checkers is based on the authors work on algorithms that have a common basis concerning concurrency, but which are not reflected in a single exis... |

113 | A partial approach to model checking
- Godefroid, Wolper
- 1994
(Show Context)
Citation Context |

62 | A technique of a state space search based on unfolding
- McMillan
- 1995
(Show Context)
Citation Context |

59 | IF-2.0: A validation environment for component-based real-time systems
- Bozga, Graf, et al.
- 2002
(Show Context)
Citation Context ...l transformation), and a backend which passes the model to the aimed analysis algorithm and allows to interpret results. For instance, “if2c” consists of a frontend for (a variant of) Verimag’s IF2.0 =-=[3]-=- language, static analysis for identifying the transitions and dependency, and finally a backend generating C-code for exploration. This kind of architecture is frequently used in model checkers and o... |

39 | S.: An unfolding algorithm for synchronous products of transition systems
- Esparza, Römer
- 1999
(Show Context)
Citation Context ... For application purposes, let us just say here that the bigger the order (in ordering more pairs), the better. The ideal case is that of total adequate orders. Total adequate orders were proposed in =-=[5, 6]-=-. Here we propose a new adequate order for the implementation in POEM. The difference compared to previously proposed orders is that it is based on interleavings rather than partial orders and is thus... |

22 | UPPAAL - present and future
- Behrmann, David, et al.
- 2001
(Show Context)
Citation Context ...anguage side, we consider modeling languages for discrete concurrent models, such as Promela [10], Petri net based languages [?] but also timed automata specifications, in particular IF2.0 and UppAal =-=[1]-=-. These together with, for now, safety specifications or simply reachability. – On the analysis side, we consider state exploration with partial order based reduction methods and symbolic state explor... |

19 | A partial order semantics approach to the clock explosion problem of timed automata - Lugiez, Niebert, et al. - 2004 |

10 |
Traces and logic
- Penczek, Kuiper
- 1995
(Show Context)
Citation Context |

5 |
Black box unfolding with local first search
- Bornot, Morin, et al.
- 2002
(Show Context)
Citation Context ... methods. and thus, save time in software development. This paper focuses on the design and the implementation details of traces in POEM, and presents how to extend it to implement Local First Search =-=[2, 13]-=-. Moreover, We show the improvement of time consuming of Event Zone approach [11] by combining it with the trace structure. This paper is structured as follows. Section 2 gives the introduction of the... |

3 |
Holzmann and Doron Peled. Partial order reduction of the state space
- Gerard
- 1995
(Show Context)
Citation Context ...r identifying the transitions and dependency, and finally a backend generating C-code for exploration. This kind of architecture is frequently used in model checkers and originally introduced in Spin =-=[10]-=-. The implementation language of POEM is Objective Caml (OCaml). This choice is due to the advantages of functional programming languages for compiler writing, the efficiency of OCaml and the availabi... |

3 |
D.: Local first search - a new paradigm for partial order reductions
- Niebert, Huhn, et al.
- 2001
(Show Context)
Citation Context ...ed on some total order ≤alph on Σ. Moreover, let |[u]| = |u| denote the length of u, and let |[u]|a = |u|a denote the number of occurrences of a in u (a property invariant under ≡). The Parikh vector =-=[14]-=- p(u) of u or [u] is the function p(u) : Σ −→ N such that p(u)(a) := |u|a. The ≤alph-induced lexicographical order on Parik-vectors is defined as follows: u <p v: iff – either |u| < |v| – or |u| = |v|... |

1 | Diekert and Grzegorz Rozemberg, editors. The Book of Traces - Volker - 1995 |