Filters








9 Hits in 2.6 sec

Page 3262 of Mathematical Reviews Vol. , Issue 81H [page]

<span title="">1981</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Peeva (Sofia) Grabowski, Jan 81h:68049 On Hack’s conjecture concerning reachability in Petri nets. (German and Russian summaries) Elektron. Informationsverarb.  ...  These results ar weakened versions of a conjecture of M. Hack [Petri net lap. guages”, Tech. Rep. No.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1981-08_81h/page/3262" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1981-08_81h/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Computation sequence sets

James L. Peterson
<span title="">1976</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p6ovb2qpkfenhmb7mcksobrcxq" style="color: black;">Journal of computer and system sciences (Print)</a> </i> &nbsp;
Since we are concerned only with reachable states, we restrict the next-state function to the reachable state space, Q.  ...  Execution of a Petri net begins with one token in the start place.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0022-0000(76)80047-5">doi:10.1016/s0022-0000(76)80047-5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pm5gvasrdrdktoh3utbodnyvh4">fatcat:pm5gvasrdrdktoh3utbodnyvh4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190317114534/https://core.ac.uk/download/pdf/82113982.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/53/e7/53e7d1f6cf1d5cdf18b75a63705be89ece59d2a7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0022-0000(76)80047-5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

On commoner's liveness theorem and supervisory policies that enforce liveness in free-choice Petri nets

Ramavarapu S. Sreenivas
<span title="">1997</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/b4jbqehv5vdltfaa3oor24oddm" style="color: black;">Systems &amp; control letters (Print)</a> </i> &nbsp;
A Petri net (PN) (Pe::erson, 1981; Reisig, 1985) is said to be live if it is possible to fire any transition from every reachable marking, although not: necessarily immediately.  ...  We use this characterization to establish the existence of supervisory policies that enforce liveness in a Class of FCPNs called independent, increasing free-choice petri nets (II-FCPNs). © 1997 Elsevier  ...  Conclusions In this paper, we characterized supervisory policies that enforce liveness in Free-choice Petri Nets (FCPNs).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0167-6911(97)00019-4">doi:10.1016/s0167-6911(97)00019-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/apcw5tstcbeqtd4f4pd5agbj3q">fatcat:apcw5tstcbeqtd4f4pd5agbj3q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190226020537/http://pdfs.semanticscholar.org/6b17/5ad2a8be277ca396e111af1eb5d545575c12.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6b/17/6b175ad2a8be277ca396e111af1eb5d545575c12.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0167-6911(97)00019-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Petri net semantics of priority systems

Eike Best, Maciej Koutny
<span title="">1992</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
In this paper we consider priority systems (C, p), where C is a bounded Petri net, and p is a priority relation on the transitions of the net.  ...  Koutny, Petri net semantics of priority systems, Theoretical Computer Science 96 (1992) 175-215.  ...  Issues for providing a forum for the discussion of the ideas contained in this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(92)90184-h">doi:10.1016/0304-3975(92)90184-h</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2z3yf2qe35actkjrwtawmwait4">fatcat:2z3yf2qe35actkjrwtawmwait4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171003140630/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/cce/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMzA0Mzk3NTkyOTAxODRo.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d1/9e/d19e425bb16638ab1fb739719fd2ad62e55dfb79.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(92)90184-h"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Structure theory of equal conflict systems

Enrique Teruel, Manuel Silva
<span title="">1996</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
With the definition in [7] , tt is in conflict with t because the firing of t' reduces in one the enabling degree of t, although t is not in conflict with t' because the firing of t does not modifj the  ...  When M[p] = 5, both transitions are enabled, with degree two and one, respectively. They tan fire concurrently, so with the standard definition they are not in conflict.  ...  More comprehensive presentations of Petri net concepts are, for instance, [5, 23, 25, 27] . Placeltransition net and related concepts.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(95)00124-7">doi:10.1016/0304-3975(95)00124-7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ed2alvpqvjdx7f2sx3aekhnfmi">fatcat:ed2alvpqvjdx7f2sx3aekhnfmi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171001084739/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/9ff/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMzA0Mzk3NTk1MDAxMjQ3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ac/aa/acaacbab428c16749cf8db9778d1a0d8f31483bc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(95)00124-7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Page 654 of Mathematical Reviews Vol. , Issue Index [page]

<i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
(See 81h:68002) Grabowski, Jan On Hack’s conjecture concerning reachability in Petri nets.  ...  On equivalence of safe Petri nets. 81e:68074 Torelli, M.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1981_index_1/page/654" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1981_index_1/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

A theory of bipolar synchronization schemes

H.J. Genrich, P.S. Thiagarajan
<span title="">1984</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
I in the preparation of the manuscript. We would also like 10 thank Eli/abclh ,Munc:h for placing her exccllcnt drawing skills at our disposal.  ...  In this subsection, Hack's decomposition results for live and wale fre,e choice nets [NJ will serve as a basis for deriving quite analogous and very useful results concerning the structure of well behaved  ...  Ihc terminology concerning token loads on paths. basic circuits. etc. that __+_-- A L q V V . . '\' iY I \ 1 3 d _1 Yf V (a) (b) were introduced in Section 1 are carried over to bp schemes. via their underlying  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(84)90137-3">doi:10.1016/0304-3975(84)90137-3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ci4o2gncqfh4raq4bb254x2sxe">fatcat:ci4o2gncqfh4raq4bb254x2sxe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190224041214/https://core.ac.uk/download/pdf/82056940.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/13/72/1372ca8a4112b71818f289b725f430fa5946b2ba.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(84)90137-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Page 259 of Mathematical Reviews Vol. , Issue Annual Index [page]

<i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
(Author’s summary) 816:68062 68C99 On Hack’s conjecture concerning reachability in Petri nets. (German and Russian summaries) Elektron. Informationsverarb. Kybernet. 15 (1979), no. 7, 339-354.  ...  The maximal flow problem in a network with a variable structure. Proceedings of the International Symposium on Applications of Mathematics in System Theory (Univ.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1981_annual-index/page/259" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1981_annual-index/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Structure theory of Petri nets: the free choice hiatus [chapter]

Eike Best
<i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/d4xitz4bkfbzxnzomxkjzhkgge" style="color: black;">Petri Nets: Central Models and Their Properties</a> </i> &nbsp;
From the rich body of structure theoretical results that exists in Petri net theory, this paper selects a few examples which are deemed to be typical.  ...  The class of free choice nets, whose structure theory is particularly agreeable, is studied in some detail. Q"' , 9 .....  ...  Acknowledgements I wish to thank Ulrich Grude, Claudia Toussaint, P.S.Thiagarajan, K.D6pp and Wolfgang Reisig for giving me helpful comments on the structure and the contents of this manuscript.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0046840">doi:10.1007/bfb0046840</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ac/Best86a.html">dblp:conf/ac/Best86a</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hywiighhkvgwdnce4gbits5zli">fatcat:hywiighhkvgwdnce4gbits5zli</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190221214733/http://pdfs.semanticscholar.org/2d94/ad43d0e60aec9bd08b3094b13a2ab32741bd.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2d/94/2d94ad43d0e60aec9bd08b3094b13a2ab32741bd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0046840"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>