Incremental Abstraction - An Analytical and Algorithmic Perspective on Petri Net Reduction
Paper i proceeding, 2021

Bounded Petri nets are in this paper reduced by an incremental abstraction method based on visible bisimulation. An arbitrary bounded Petri net is decomposed into subsystems that are easily transformed to a modular transition system. The basic principle is that places in a Petri net can be interpreted as the synchronous composition of bounded buffers, and a sequence of places can be reduced analytically to a place with extended capacity. Additional restrictions, such as mutual exclusion among shared resources, are formulated as predicates that are easily translated to ordinary transition systems. Since the reduction preserves CTL-X expressions, it can be used as a stand-alone model checking tool, where temporal properties of the reduced model are easily evaluated. This approach is shown to be very efficient compared to the best known model checking algorithms available in the software tool nuXmv.

temporal logic verification

model reduction

Petri nets

Författare

Bengt Lennartson

Chalmers, Elektroteknik, System- och reglerteknik

IEEE International Conference on Automation Science and Engineering

21618070 (ISSN) 21618089 (eISSN)

Vol. 2021-August 557-562

17th IEEE International Conference on Automation Science and Engineering, CASE 2021
Lyon, France,

Ämneskategorier

Inbäddad systemteknik

Reglerteknik

Datorsystem

DOI

10.1109/CASE49439.2021.9551438

Mer information

Senast uppdaterat

2021-11-01