Abstract

The study of concurrent and parallel systems has been a challenging research domain within cyberphysical systems community. This chapter provides a pragmatic introduction to the creation and analysis of such system models using the popular Petri nets formalism. Petri nets is a formalism that convinces through its simplicity and applicability.We offer an overview of the most important Petri nets concepts, analysis techniques and model checking approaches. Finally, we show the use of so-called High-level Petri nets for the representation of complex data structures and functionality and present a novel research approach that allows the use of Petri nets inside Functional Mock-up Units and cyber-physical system models.

Highlights

  • Since the early days of computing the modelling and verification of programs has been an important subject

  • We show the use of so-called High-level Petri nets for the representation of complex data structures and functionality and present a novel research approach that allows the use of Petri nets inside Functional Mock-up Units and cyber-physical system models

  • In this chapter we have shown a way to develop cyber-physical systems that include concurrent dimension

Read more

Summary

Introduction

Since the early days of computing the modelling and verification of programs has been an important subject. The specification is used to check if the development team understood the requirements (to answer the question “Are we building the right thing?”). There are some kinds of software that cannot afford to diverge from specification as human life or health depends on it This need gave birth to a set of verification techniques that can guarantee the absence of errors in a given system: formal verification. There are several formal methods ranging from theorem proving to model checking These techniques aim to build a formal mathematical proof of the program’s correctness. We will not describe them further as they are not absolutely necessary for the understanding of the basic concepts behind formal methods

Modelling Concurrency
Petri Nets
Common Petri net patterns
Formal syntax and semantics
Deduction Based on Rules
Reachability Graph
Monotony
Properties of Petri Nets
Marking Properties
Sequence Properties
Invariants
Formal Definition of Invariants
Computing P-invariants
Using Invariants for Proving Properties
Techniques for Model Checking
Data manipulation in Petri nets
Drone Controller
Formalising High-level Petri nets
Other High-level nets
Combining Model Semantics and Simulation
PNFMU Formalisation
PNFMU Example
PNFMU Composition
Advanced Composition Mechanisms
Tooling
Tools for Petri net Modelling and Verification
Evaluation of Model Checking Techniques
Summary
Literature and Further Reading
What does monotony express in the Petri net context?
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call