## Model-Checking for a Subclass of Event Structures (1997)

Venue: | Proc. of TACAS'97, LNCS 1217 |

Citations: | 15 - 8 self |

### BibTeX

@INPROCEEDINGS{Penczek97model-checkingfor,

author = {Wojciech Penczek},

title = {Model-Checking for a Subclass of Event Structures},

booktitle = {Proc. of TACAS'97, LNCS 1217},

year = {1997},

pages = {145--164},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

. A finite representation of the prime event structure corresponding to the behaviour of a program is suggested. The algorithm of linear complexity using this representation for model checking of the formulas of Discrete Event Structure Logic without past modalities is given. A method of building finite representations of event structures in an efficient way by applying partial order reductions is provided. 1 Introduction Model checking is one of the most successful methods of automatic verification of program properties. A model-checking algorithm decides whether a finite-state concurrent system satisfies its specification, given as a formula of a temporal logic [3, 10]. Behaviour of a concurrent system can be modeled in two ways. In the interleaving semantics, the meaning of a program is an execution tree, temporal-logic assertions are interpreted over paths of this tree. In partial-order semantics (or event structure semantics), behaviour is an event structure, where the ordering r...