Towards Efficient Verification of Elementary Object Systems

Berndt Muller; Ismaila Jihad Abdullahi

Towards Efficient Verification of Elementary Object Systems

Berndt Muller, Ismaila Jihad Abdullahi

Faculty of Computing, Engineering and Science

Research output: Contribution to conference › Paper › peer-review

106 Downloads (Pure)

Abstract

Elementary Object Systems (EOS) is a class of Object Petri Nets that follows the “nets-within-nets” paradigm. It combines several practical as well as theoretical properties for the needs of multi-agent-systems. However, it comes with some constraints that limit their expressiveness for automatic verification purposes due to the highly expressive nature of the underlying class of Petri
nets. In this paper, we proposed a set of transformation rules from EOS to basic Petri nets nets and show isomorphism of the state spaces in order to make verification feasible.

Original language	English
Pages	86-100
Publication status	Published - 28 Sept 2016
Event	25th international Workshop on Concurrency, Specification and Programming - Rostock, Germany Duration: 28 Sept 2016 → 30 Sept 2016 Conference number: 25 http://www2.informatik.hu-berlin.de/csp2016/program.html

Conference

Conference	25th international Workshop on Concurrency, Specification and Programming
Country/Territory	Germany
City	Rostock
Period	28/09/16 → 30/09/16
Internet address	http://www2.informatik.hu-berlin.de/csp2016/program.html

Keywords

Elementary Reference-net System
nets-within-nets
Petri nets
isomorphic property
computational complexity

Access to Document

Ismaila_CPaper12Accepted author manuscript, 1.04 MBLicence: CC BY-NC-ND

Cite this

@conference{aa77badde0ea4c4796ae151fcc3d0a32,

title = "Towards Efficient Verification of Elementary Object Systems",

abstract = "Elementary Object Systems (EOS) is a class of Object Petri Nets that follows the “nets-within-nets” paradigm. It combines several practical as well as theoretical properties for the needs of multi-agent-systems. However, it comes with some constraints that limit their expressiveness for automatic verification purposes due to the highly expressive nature of the underlying class of Petrinets. In this paper, we proposed a set of transformation rules from EOS to basic Petri nets nets and show isomorphism of the state spaces in order to make verification feasible.",

keywords = "Elementary Reference-net System, nets-within-nets, Petri nets, isomorphic property, computational complexity",

author = "Berndt Muller and Abdullahi, {Ismaila Jihad}",

year = "2016",

month = sep,

day = "28",

language = "English",

pages = "86--100",

note = "25th international Workshop on Concurrency, Specification and Programming ; Conference date: 28-09-2016 Through 30-09-2016",

url = "http://www2.informatik.hu-berlin.de/csp2016/program.html",

}

TY - CONF

T1 - Towards Efficient Verification of Elementary Object Systems

AU - Muller, Berndt

AU - Abdullahi, Ismaila Jihad

N1 - Conference code: 25

PY - 2016/9/28

Y1 - 2016/9/28

N2 - Elementary Object Systems (EOS) is a class of Object Petri Nets that follows the “nets-within-nets” paradigm. It combines several practical as well as theoretical properties for the needs of multi-agent-systems. However, it comes with some constraints that limit their expressiveness for automatic verification purposes due to the highly expressive nature of the underlying class of Petrinets. In this paper, we proposed a set of transformation rules from EOS to basic Petri nets nets and show isomorphism of the state spaces in order to make verification feasible.

AB - Elementary Object Systems (EOS) is a class of Object Petri Nets that follows the “nets-within-nets” paradigm. It combines several practical as well as theoretical properties for the needs of multi-agent-systems. However, it comes with some constraints that limit their expressiveness for automatic verification purposes due to the highly expressive nature of the underlying class of Petrinets. In this paper, we proposed a set of transformation rules from EOS to basic Petri nets nets and show isomorphism of the state spaces in order to make verification feasible.

KW - Elementary Reference-net System

KW - nets-within-nets

KW - Petri nets

KW - isomorphic property

KW - computational complexity

UR - http://ceur-ws.org/Vol-1698/CS&P2016_09_Abdullahi&Mueller_Towards-Efficient-Verification-of-Elementary-Object-Systems.pdf

M3 - Paper

SP - 86

EP - 100

T2 - 25th international Workshop on Concurrency, Specification and Programming

Y2 - 28 September 2016 through 30 September 2016

ER -

Towards Efficient Verification of Elementary Object Systems

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this