A Method to Analyze High Level Petri Nets using SPIN Model Checker

2017 ◽  
Author(s):  
Dewan Mohammad Moksedul Alam ◽  
Xudong He
Keyword(s):  
Petri Nets ◽  
Spin Model ◽  
Model Checker ◽  
High Level ◽  
Spin Model Checker

scholarly journals Towards Automated Verification of P Systems Using Spin

2011 ◽  
Vol 2 (3) ◽  
pp. 1-12 ◽  
Author(s):  
Raluca Lefticaru ◽  
Cristina Tudose ◽  
Florentin Ipate
Keyword(s):  
Natural Language ◽  
Spin Model ◽  
P Systems ◽  
Automated Verification ◽  
P System ◽  
Model Checker ◽  
High Level ◽  
Spin Model Checker

This paper presents an approach to P systems verification using the Spin model checker. The authors have developed a tool which implements the proposed approach and can automatically transform P system specifications from P-Lingua into Promela, the language accepted by the well known model checker Spin. The properties expected for the P system are specified using some patterns, representing high level descriptions of frequently asked questions, formulated in natural language. These properties are automatically translated into LTL specifications for the Promela model and the Spin model checker is run against them. In case a counterexample is received, the Spin trace is decoded and expressed as a P system computation. The tool has been tested on a number of examples and the results obtained are presented in the paper.

scholarly journals Towards Automated Verification of P Systems Using Spin

2014 ◽  
pp. 159-170 ◽  
Author(s):  
Raluca Lefticaru ◽  
Cristina Tudose ◽  
Florentin Ipate
Keyword(s):  
Natural Language ◽  
Spin Model ◽  
P Systems ◽  
Automated Verification ◽  
P System ◽  
Model Checker ◽  
High Level ◽  
Spin Model Checker

This paper presents an approach to P systems verification using the Spin model checker. The authors have developed a tool which implements the proposed approach and can automatically transform P system specifications from P-Lingua into Promela, the language accepted by the well known model checker Spin. The properties expected for the P system are specified using some patterns, representing high level descriptions of frequently asked questions, formulated in natural language. These properties are automatically translated into LTL specifications for the Promela model and the Spin model checker is run against them. In case a counterexample is received, the Spin trace is decoded and expressed as a P system computation. The tool has been tested on a number of examples and the results obtained are presented in the paper.

A Method to Analyze Predicate Transition Nets Using SPIN Model Checker

2017 ◽  
Vol 27 (09n10) ◽  
pp. 1455-1481 ◽  
Author(s):  
Dewan Mohammad Moksedul Alam ◽  
Xudong He
Keyword(s):  
Model Checking ◽  
Formal Method ◽  
Expressive Power ◽  
Spin Model ◽  
Analysis Method ◽  
Detailed Model ◽  
Liveness Properties ◽  
High Level ◽  
Concurrent And Distributed Systems ◽  
Spin Model Checker

High-level Petri nets (HLPNs) are a formal method for studying concurrent and distributed systems and have been widely used in many application domains. However, their strong expressive power hinders their analyzability. In this paper, we present a new transformational analysis method for analyzing a special class of HLPNs — predicate transition (PrT) nets. This method extends and improves our prior results by covering more PrT net features including full first-order logic formulas and exploring additional alternative translation schemes. This new analysis method is supported by a tool chain — front-end PIPE[Formula: see text] for creating and simulating PrT nets and back-end SPIN for model checking safety and liveness properties. We have applied this method to two benchmark systems used in annual Petri net model checking contest 2015. We discuss several properties and show the detailed model checking results in one system.

Sign in / Sign up

Export Citation Format

Share Document