A Polynomial-Time Algorithm for Detection of Uncovered Transitions in a Petri Net-Based Concurrent System

A Polynomial-Time Algorithm for Detection of Uncovered Transitions in a Petri Net-Based Concurrent System

This paper introduces a novel algorithm for the efficient verification of a Petri net-based concurrent control system. The proposed method is based on the computation of transition invariant coverage to detect possible errors in the modelled system. Transition invariants play a crucial role in ensur...

Full description

Saved in:
Bibliographic Details
Main Authors: Marcin Wojnakowski, Maxim Maliński, Remigiusz Wiśniewski, Andrzej Obuchowicz, Zhiwu Li, Dawid Konarczak
Format: Article
Language:English
Published: MDPI AG 2025-01-01
Series:Applied Sciences
Subjects:
Petri nets
preliminary verification
transition invariants
concurrent systems
uncovered transitions
algorithm
Online Access:https://www.mdpi.com/2076-3417/15/2/680
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://www.mdpi.com/2076-3417/15/2/680

Similar Items