Merged processes: a new condensed representation of Petri net behaviour

Authors:
Victor Khomenko;Alex Kondratyev;Maciej Koutny;Walter Vogler
Affiliations:
School of Computing Science, University of Newcastle, UK;Cadence Berkeley Labs, Berkeley, CA;School of Computing Science, University of Newcastle, UK;Institut für Informatik, Universität Augsburg, Germany
Venue:
CONCUR 2005 - Concurrency Theory
Year:
2005

Citing 12
Cited 2

Symbolic model checking: an approach to the state explosion problem

Symbolic model checking: an approach to the state explosion problem
Free choice Petri nets

Free choice Petri nets
Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe petri nets

Fundamenta Informaticae - Special issue on Petri nets
Model checking

Model checking
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
An Improvement of McMillan's Unfolding Algorithm

Formal Methods in System Design
Evaluating Deadlock Detection Methods for Concurrent Software

IEEE Transactions on Software Engineering
The State Explosion Problem

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Decidability and Complexity of Petri Net Problems - An Introduction

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits

CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Deadlock Checking Using Net Unfoldings

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Detecting State Encoding Conflicts in STG Unfoldings Using SAT

Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)

Planning as satisfiability: parallel plans and algorithms for plan search

Artificial Intelligence
Planning as satisfiability: parallel plans and algorithms for plan search

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Model checking based on Petri net unfoldings is an approach widely applied to cope with the state space explosion problem.In this paper we propose a new condensed representation of a Petri net's behaviour called merged processes, which copes well not only with concurrency, but also with other sources of state space explosion, viz. sequences of choices and non-safeness. Moreover, this representation is sufficiently similar to the traditional unfoldings, so that a large body of results developed for the latter can be re-used. Experimental results indicate that the proposed representation of a Petri net's behaviour alleviates the state space explosion problem to a significant degree and is suitable for model checking.