In this paper we prove, that for NP-nets boundedness can be checked in a compositional way, and define restrictions, under which liveness is also compositional.
Jun 18, 2012 · Abstract. Nested Petri nets (NP-nets) are Petri nets with net tokens. The liveness and boundedness problems are undecidable for two-level.
There is a polynomial time algorithm to check if a free-choice Petri net is live and bounded [4]. In this paper we prove, that for NP-nets boundedness can be ...
In this paper we prove, that for NP-nets boundedness can be checked in a compositional way, and define restrictions, under which liveness is also compositional.
It is proved, that for NP-nets boundedness can be checked in a compositional way, and restrictions are defined, under which liveness is also compositional.
On Compositionality of Boundedness and Liveness for Nested Petri Nets. L. Dworzanski, and I. Lomazova. Fundam. Inform., 120 (3-4): 275-293 (2012 ). Links and ...
On Compositionality of Boundedness and Liveness for Nested Petri Nets. Authors: Dworzański, Leonid W. | Lomazova, Irina A. Article Type: Research Article.
On compositionality of boundedness and liveness for nested Petri nets. LW Dworzański, IA Lomazova. Fundamenta Informaticae 120 (3-4), 275-293, 2012. 22, 2012.
Abstract. The paper defines two notions of composition of concurrent modules modelled by means of Petri nets: synchronisations and fusions. We study these two ...
Missing: Compositionality Nested
Petri nets can express concurrency and nondeterminism but neither locality nor hierarchy. This article presents an extension of Petri nets, in which places ...
Missing: Compositionality | Show results with:Compositionality