Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/78320
Title: Regular event structures and finite petri nets: The conflict-free case
Authors: Nielsen, M.
Thiagarajan, P.S. 
Issue Date: 2002
Source: Nielsen, M.,Thiagarajan, P.S. (2002). Regular event structures and finite petri nets: The conflict-free case. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2360 LNCS : 335-351. ScholarBank@NUS Repository.
Abstract: We present the notion of regular event structures and conjecture that they correspond exactly to finite 1-safe Petri nets. We show that the conjecture holds for the conflict-free case. Even in this restricted setting, the proof is non-trivial and involves a natural subclass of regular event structures that admit a sensible labeling with Mazurkiewicz trace alphabets. © Springer-Verlag Berlin Heidelberg 2002.
Source Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
URI: http://scholarbank.nus.edu.sg/handle/10635/78320
ISBN: 3540437878
ISSN: 03029743
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

29
checked on Jan 14, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.