Soundness and Equivalence of Petri Nets and Annotated Finite State Automate: A Comparison in the SOA Context

Andreas Wombacher; Axel Martens

doi:10.1109/DEST.2007.371980

Soundness and Equivalence of Petri Nets and Annotated Finite State Automate: A Comparison in the SOA Context

Andreas Wombacher, Axel Martens

Databases (Former)

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

2 Citations (Scopus)

126 Downloads (Pure)

Abstract

A lot of work exists on notions of equivalence and soundness relations of different workflow models, which are used in different domains like e.g. Business Process Modeling, Software and Service Engineering. These definitions are based on different models, including Petri Nets and different versions of Finite State Automata, having different expressiveness and computational complexity classes. The aim of this paper is to compare the equivalence and soundness relations of the Petri Net and annotated Finite State Automaton models in the context of Service Oriented Architectures. It turns out that up to a certain expressiveness the relations are comparable and computable with reasonable effort. For these cases also mappings between the different models and relations are presented.

Original language	Undefined
Title of host publication	Digital EcoSystems and Technologies Conference, 2007. DEST '07. Inaugural IEEE-IES
Publisher	IEEE Computer Society
Pages	257-262
Number of pages	6
ISBN (Print)	1-4244-0470-3
DOIs	https://doi.org/10.1109/DEST.2007.371980
Publication status	Published - Feb 2007
Event	2007 Inaugural IEEE International Conference on Digital Ecosystems and Technologies, DEST 2007 - Rydges Tradewinds Cairns, Cairns, Australia Duration: 21 Feb 2007 → 23 Feb 2007

Publication series

Name
Publisher	IEEE Computer Society
Number	LNCS4549

Conference

Conference	2007 Inaugural IEEE International Conference on Digital Ecosystems and Technologies, DEST 2007
Abbreviated title	DEST
Country/Territory	Australia
City	Cairns
Period	21/02/07 → 23/02/07

Keywords

EWI-11244
METIS-241993
IR-64416

Access to Document

10.1109/DEST.2007.371980

Cite this

@inproceedings{20c5b3dade674846ac434a60754735b5,

title = "Soundness and Equivalence of Petri Nets and Annotated Finite State Automate: A Comparison in the SOA Context",

abstract = "A lot of work exists on notions of equivalence and soundness relations of different workflow models, which are used in different domains like e.g. Business Process Modeling, Software and Service Engineering. These definitions are based on different models, including Petri Nets and different versions of Finite State Automata, having different expressiveness and computational complexity classes. The aim of this paper is to compare the equivalence and soundness relations of the Petri Net and annotated Finite State Automaton models in the context of Service Oriented Architectures. It turns out that up to a certain expressiveness the relations are comparable and computable with reasonable effort. For these cases also mappings between the different models and relations are presented.",

keywords = "EWI-11244, METIS-241993, IR-64416",

author = "Andreas Wombacher and Axel Martens",

note = "10.1109/DEST.2007.371980 ; null ; Conference date: 21-02-2007 Through 23-02-2007",

year = "2007",

month = feb,

doi = "10.1109/DEST.2007.371980",

language = "Undefined",

isbn = "1-4244-0470-3",

publisher = "IEEE Computer Society",

number = "LNCS4549",

pages = "257--262",

booktitle = "Digital EcoSystems and Technologies Conference, 2007. DEST '07. Inaugural IEEE-IES",

address = "United States",

}

Wombacher, A & Martens, A 2007, Soundness and Equivalence of Petri Nets and Annotated Finite State Automate: A Comparison in the SOA Context. in Digital EcoSystems and Technologies Conference, 2007. DEST '07. Inaugural IEEE-IES., 10.1109/DEST.2007.371980, IEEE Computer Society, pp. 257-262, 2007 Inaugural IEEE International Conference on Digital Ecosystems and Technologies, DEST 2007, Cairns, Queensland, Australia, 21/02/07. https://doi.org/10.1109/DEST.2007.371980

Soundness and Equivalence of Petri Nets and Annotated Finite State Automate: A Comparison in the SOA Context. / Wombacher, Andreas; Martens, Axel.

Digital EcoSystems and Technologies Conference, 2007. DEST '07. Inaugural IEEE-IES. IEEE Computer Society, 2007. p. 257-262 10.1109/DEST.2007.371980.

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

TY - GEN

T1 - Soundness and Equivalence of Petri Nets and Annotated Finite State Automate: A Comparison in the SOA Context

AU - Wombacher, Andreas

AU - Martens, Axel

N1 - 10.1109/DEST.2007.371980

PY - 2007/2

Y1 - 2007/2

N2 - A lot of work exists on notions of equivalence and soundness relations of different workflow models, which are used in different domains like e.g. Business Process Modeling, Software and Service Engineering. These definitions are based on different models, including Petri Nets and different versions of Finite State Automata, having different expressiveness and computational complexity classes. The aim of this paper is to compare the equivalence and soundness relations of the Petri Net and annotated Finite State Automaton models in the context of Service Oriented Architectures. It turns out that up to a certain expressiveness the relations are comparable and computable with reasonable effort. For these cases also mappings between the different models and relations are presented.

AB - A lot of work exists on notions of equivalence and soundness relations of different workflow models, which are used in different domains like e.g. Business Process Modeling, Software and Service Engineering. These definitions are based on different models, including Petri Nets and different versions of Finite State Automata, having different expressiveness and computational complexity classes. The aim of this paper is to compare the equivalence and soundness relations of the Petri Net and annotated Finite State Automaton models in the context of Service Oriented Architectures. It turns out that up to a certain expressiveness the relations are comparable and computable with reasonable effort. For these cases also mappings between the different models and relations are presented.

KW - EWI-11244

KW - METIS-241993

KW - IR-64416

U2 - 10.1109/DEST.2007.371980

DO - 10.1109/DEST.2007.371980

M3 - Conference contribution

SN - 1-4244-0470-3

SP - 257

EP - 262

BT - Digital EcoSystems and Technologies Conference, 2007. DEST '07. Inaugural IEEE-IES

PB - IEEE Computer Society

Y2 - 21 February 2007 through 23 February 2007

ER -