Publication detail

Partial-Order Reduction in Model Checking of Object-Oriented Petri Nets

ČEŠKA, M. HAŠA, L. VOJNAR, T.

Original Title

Partial-Order Reduction in Model Checking of Object-Oriented Petri Nets

English Title

Partial-Order Reduction in Model Checking of Object-Oriented Petri Nets

Type

book chapter

Language

en

Original Abstract

The main problem being faced in finite-state model checking is the state space explosion problem. For coping with it, many advanced methods for reducing state spaces have been proposed. One of the most successful methods (especially when dealing with software systems) is the so-called partial-order reduction. In the paper, we examine how this method can be used in the context of object-oriented Petri nets, which bring in features like dynamic instantiation, late binding, garbage collection, etc.

English abstract

The main problem being faced in finite-state model checking is the state space explosion problem. For coping with it, many advanced methods for reducing state spaces have been proposed. One of the most successful methods (especially when dealing with software systems) is the so-called partial-order reduction. In the paper, we examine how this method can be used in the context of object-oriented Petri nets, which bring in features like dynamic instantiation, late binding, garbage collection, etc.

Keywords

Petri nets, object orientation, model checking, partial-order reduction, state space

RIV year

2003

Released

13.10.2003

Publisher

Springer Verlag

Location

Berlin

ISBN

3-540-20221-8

Book

Computer Aided Systems Theory - EUROCAST 2003

Edition

Lecture Notes in Computer Science 2809

Pages from

265

Pages to

278

Pages count

14

Documents

BibTex


@inbook{BUT55482,
  author="Milan {Češka} and Luděk {Haša} and Tomáš {Vojnar}",
  title="Partial-Order Reduction in Model Checking of Object-Oriented Petri Nets",
  annote="The main problem being faced in finite-state model checking is the state space explosion problem. For coping with it, many advanced methods for reducing state spaces have been proposed. One of the most successful methods (especially when dealing with software systems) is the so-called partial-order reduction. In the paper, we examine how this method can be used in the context of object-oriented Petri nets, which bring in features like dynamic instantiation, late binding, garbage collection, etc.",
  address="Springer Verlag",
  booktitle="Computer Aided Systems Theory - EUROCAST 2003",
  chapter="55482",
  edition="Lecture Notes in Computer Science 2809",
  institution="Springer Verlag",
  year="2003",
  month="october",
  pages="265--278",
  publisher="Springer Verlag",
  type="book chapter"
}