Generation of database transactions with Petri nets

K.M. Hee, van; N. Sidorova; M. Voorhoeve; J.M.E.M. Werf, van der

Generation of database transactions with Petri nets

K.M. Hee, van, N. Sidorova, M. Voorhoeve, J.M.E.M. Werf, van der

Process Analytics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

204 Downloads (Pure)

Abstract

In this paper we show how we can generate models for the execution of database transactions. We describe a transaction goal by a data model and we give algorithms to generate Petri nets models that specify the execution of these transactions. This is done in such a way that database constraints, in particular referential integrity constraints, are preserved. So if the database is in a consistent state before a transaction starts, it will be in a consistent state after the transaction. The class of Petri nets we use is a subclass of coloured Petri nets, where token values are vectors of identifiers. This class is powerful enough to model transaction execution and it allows for some formal analysis, like soundness.

Original language	English
Title of host publication	Proceedings of Concurrency, Specification and Programming (CS&P 2008, Groß Väter See bei Berlin, Germany, September 29-October 1, 2008)
Editors	H.D. Burkhard, G. Lindemann, H. Schlingloff
Pages	488-499
Publication status	Published - 2008

Access to Document

Metis225597Final published version, 280 KB

Cite this

@inproceedings{8d0eba28216f41c9a0aa8da7d3a0dac9,

title = "Generation of database transactions with Petri nets",

abstract = "In this paper we show how we can generate models for the execution of database transactions. We describe a transaction goal by a data model and we give algorithms to generate Petri nets models that specify the execution of these transactions. This is done in such a way that database constraints, in particular referential integrity constraints, are preserved. So if the database is in a consistent state before a transaction starts, it will be in a consistent state after the transaction. The class of Petri nets we use is a subclass of coloured Petri nets, where token values are vectors of identifiers. This class is powerful enough to model transaction execution and it allows for some formal analysis, like soundness.",

author = "{Hee, van}, K.M. and N. Sidorova and M. Voorhoeve and {Werf, van der}, J.M.E.M.",

year = "2008",

language = "English",

pages = "488--499",

editor = "H.D. Burkhard and G. Lindemann and H. Schlingloff",

booktitle = "Proceedings of Concurrency, Specification and Programming (CS&P 2008, Gro{\ss} V{\"a}ter See bei Berlin, Germany, September 29-October 1, 2008)",

}

Generation of database transactions with Petri nets. / Hee, van, K.M.; Sidorova, N.; Voorhoeve, M. et al.
Proceedings of Concurrency, Specification and Programming (CS&P 2008, Groß Väter See bei Berlin, Germany, September 29-October 1, 2008). ed. / H.D. Burkhard; G. Lindemann; H. Schlingloff. 2008. p. 488-499.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Generation of database transactions with Petri nets

AU - Hee, van, K.M.

AU - Sidorova, N.

AU - Voorhoeve, M.

AU - Werf, van der, J.M.E.M.

PY - 2008

Y1 - 2008

N2 - In this paper we show how we can generate models for the execution of database transactions. We describe a transaction goal by a data model and we give algorithms to generate Petri nets models that specify the execution of these transactions. This is done in such a way that database constraints, in particular referential integrity constraints, are preserved. So if the database is in a consistent state before a transaction starts, it will be in a consistent state after the transaction. The class of Petri nets we use is a subclass of coloured Petri nets, where token values are vectors of identifiers. This class is powerful enough to model transaction execution and it allows for some formal analysis, like soundness.

AB - In this paper we show how we can generate models for the execution of database transactions. We describe a transaction goal by a data model and we give algorithms to generate Petri nets models that specify the execution of these transactions. This is done in such a way that database constraints, in particular referential integrity constraints, are preserved. So if the database is in a consistent state before a transaction starts, it will be in a consistent state after the transaction. The class of Petri nets we use is a subclass of coloured Petri nets, where token values are vectors of identifiers. This class is powerful enough to model transaction execution and it allows for some formal analysis, like soundness.

M3 - Conference contribution

SP - 488

EP - 499

BT - Proceedings of Concurrency, Specification and Programming (CS&P 2008, Groß Väter See bei Berlin, Germany, September 29-October 1, 2008)

A2 - Burkhard, H.D.

A2 - Lindemann, G.

A2 - Schlingloff, H.

ER -

Generation of database transactions with Petri nets

Abstract

Access to Document

Fingerprint

Cite this