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...
Saved in:
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: | |
Online Access: | https://www.mdpi.com/2076-3417/15/2/680 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Concurrent software fine‐coarse‐grained automatic modelling by Coloured Petri Nets for model checking
by: Wenjie Zhong, et al.
Published: (2023-02-01) -
Modelagem de Sistema de Captação de Águas Subterrâneas Utilizando Redes de Petri
by: Maria Clara Oliveira Durães, et al.
Published: (2023-01-01) -
Quelques aspects sémantico-syntaxiques des ‘verbes en gl-’ de l’anglais ayant trait à la notion de ‘lumière’ et / ou de ‘vision’
by: Dennis Philps
Published: (2007-12-01) -
Performance analysis of coroutines and other concurrency techniques in Kotlin language for I/O operations
by: Michał Grabowiec, et al.
Published: (2024-12-01) -
Simulation of discrete control systems with parallelism of behavior
by: D. I. Cheremisinov, et al.
Published: (2023-12-01)