Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/29485
Type: | Conference paper |
Title: | Incremental state space construction for coloured petri nets |
Author: | Lewis, G. Lakos, C. |
Citation: | Lecture notes in computer science 2075, 2001:263-282 |
Part of: | Proceedings of the 22nd International Conference, ICATPN 2001 |
Publisher: | SPRINGER-VERLAG |
Publisher Place: | GERMANY |
Issue Date: | 2001 |
ISBN: | 3540422528 |
Conference Name: | Applications and Theory of Petri Nets (2001 : Newcastle upon Tyne, UK) |
Editor: | Colom, J. Koutny, M. |
Statement of Responsibility: | Glenn Lewis and Charles Lakos |
Abstract: | State space analysis is a popular formal reasoning technique. However, it is subject to the crippling problem of state space explosion, where its application to real world models leads to unmanageably large state spaces. In this paper we present algorithms which attempt to alleviate the state space explosion problem by taking advantage of the common practice of incremental development, i.e. where the designer starts with an abstract model of the system and progressively refines it. The performance of the incremental algorithm is compared to that of the standard algorithm for some case studies, and situations under which the performance improvement can be expected are identified. |
Description: | The original publication is available at www.springerlink.com Conference details: Applications and Theory of Petri Nets 2001 (ICATPN/APN), 25 June 2001, Newcastle upon Tyne, UK |
Published version: | http://www.springerlink.com/content/105633/ |
Appears in Collections: | Aurora harvest 6 Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.