Skip to main content
Conference ProceedingsOPEN ACCESS

Avoiding state explosion by composition of minimal covering graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1992) 575 LNCS 169-180
DOI: 10.1007/3-540-55179-4_17
1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we study composition and decomposition of Petri nets via a common set of places or transitions. We are interested in automatical verification of Petri nets properties from the point of view of reusability of partial results already obtained. We give two algorithms which allow to compute the minimal covering graph of a Petri net by composing the minimal covering graphs of each of its modules.

Cite

CITATION STYLE

APA

Finkel, A., & Petrucci, L. (1992). Avoiding state explosion by composition of minimal covering graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 575 LNCS, pp. 169–180). Springer Verlag. https://doi.org/10.1007/3-540-55179-4_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free