Toggle Main Menu Toggle Search

Open Access padlockePrints

Verification of communication structured acyclic nets using SAT

Lookup NU author(s): Nadiyah Almutairi, Professor Maciej KoutnyORCiD

Downloads

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


Abstract

Copyright © 2021 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0). Model checking is an established strategy for automatic verification of software and hardware systems. It supports extensive analyses of the properties of states and behaviours of computing systems. Petri net verification using SAT-solvers has already received considerable attention and effective tools based on it have been developed. In this paper, we are concerned with the verification of communication structured acyclic nets (CSA-nets) which so far lacked robust verification methodology. CSA-nets are sets of acyclic nets which can communicate by means of synchronous and asynchronous interactions. In this paper, we introduce several propositional formulas which can be used to verify properties of CSA-nets using SAT-solvers.


Publication metadata

Author(s): Almutairi N, Koutny M

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: International Workshop on Petri Nets and Software Engineering (PNSE 2021)

Year of Conference: 2021

Pages: 175-194

Online publication date: 25/06/2021

Acceptance date: 02/04/2018

ISSN: 1613-0073

Publisher: CEUR Workshop Proceedings

URL: http://ceur-ws.org/Vol-2907/paper10.pdf

Series Title: CEUR Workshop Proceedings


Share