Toggle Main Menu Toggle Search

Open Access padlockePrints

Combining Decomposition and Unfolding for STG Synthesis

Lookup NU author(s): Dr Victor Khomenko

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


Abstract

For synthesising efficient asynchronous circuits one has to deal with the state space explosion problem. In this paper, we present a combined approach to alleviate it, based on using Petri net unfoldings and decomposition. The experimental results show significant improvement in terms of runtime compared with other existing methods.


Publication metadata

Author(s): Khomenko V, Schaefer M

Editor(s): Kleijn, J., Yakovlev, A.

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 28th International Conference on Petri Nets and Other Models of Concurrency (ICATPN)

Year of Conference: 2007

Pages: 223-243

ISSN: 0302-9743 (Print) 1611-3349 (Online)

Publisher: Springer

URL: http://dx.doi.org/10.1007/978-3-540-73094-1_15

DOI: 10.1007/978-3-540-73094-1_15

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783540730934


Actions

Link to this publication


Share