R. Janicki and M. Koutny (1995), Semantics of Inhibitor Nets. Information and Computation. 123, 1--16, Academic Press. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Two Algebraic Process Semantics for Contextual Nets - Bruni, Sassone (2001) (2 citations) (Correct)
....have been considered in the literature that either increase the expressive power or give a better representation of existing phenomena. This paper focuses on extending the Petri nets are monoids approach to contextual nets, also known as nets with read arcs, or condition arcs, or testarcs [10,27,19,35]. The motivating idea behind read arcs is that of reading resources without consuming them, thus providing a way of modeling multiple concurrent accesses to the same resource. Using ordinary PT nets such readings must be rendered 2 ######## ## a ######## # # # # # # # # c ....
....by undirected weighted arcs, with unary weights always omitted. According to the semantic interpretation of [27] the transitions t 0 and t 1 can fire concurrently in N 1 , but neither in N 2 nor in N 3 , since the basic assumption is that a token cannot be read and consumed in the same step. In [19], instead, the concurrent step is allowed for all three nets, the basic assumption being that t 0 and t 1 can both start together, read the context tokens, and need them not while the actions take place. Besides its possible merits, we find this interpretation not fully convincing as, for ....
[Article contains additional citation context not shown here]
R. Janicki and M. Koutny. Semantics of inhibitor nets. Inform. and Comput., 123:1--16, 1995.
Algebraic Models for Contextual Nets - Bruni, Sassone (2000) (3 citations) (Correct)
....subsystems. Several extensions of the basic net paradigm have been considered in the literature that either increase the expressive power or give a better representation of existing phenomena. This paper focuses on contextual nets, also known as nets with read arcs, or condition arcs, or test arcs [4,13,8,21]. The underlying idea is that of reading resources without consuming them, thus providing a way of modeling multiple concurrent accesses to the same resource. With ordinary pt nets such readings must be rendered as self loops, and this imposes an unfortunate sequentialization of concurrent ....
....weighted arcs, and contexts by undirected weighted arcs, with unary weights always omitted. According to [13] the transitions t 0 and t 1 can re concurrently in N 1 , but neither in N 2 nor in N 3 , since the basic assumption is that a token cannot be read and consumed in the same step. In [8], instead, the concurrent step is allowed for all three nets, the basic assumption being that t 0 and t 1 can both start together and read the context tokens, without needing them while the actions take place. Besides its possible merits, we nd this interpretation not fully convincing as, for ....
[Article contains additional citation context not shown here]
R. Janicki and M. Koutny. Semantics of inhibitor nets. Inform. and Comput., 123:1-16, 1995.
Process Semantics of General Inhibitor Nets - Kleijn, Koutny Self-citation (Koutny) (Correct)
....used for testing whether a place does not contain more than a certain threshold number of tokens [1] We are concerned with the development of a process semantics of general PTI nets, based on net unfolding and occurrence nets. The line of research presented here is a continuation of the work of [14] on elementary net systems with inhibitor arcs, which has been further developed in [17] The key aspect of the adopted approach is to use the so called stratified order structures to provide a causality semantics consistent with the operational semantics defined in terms of step sequences. ....
....never a#ected by executing u. However, after the execution sequence (firing sequence) tt, transition u becomes disabled. This indicates that independence of transitions is no longer symmetric. In the a priori concurrency semantics of nets with inhibitor arcs as discussed in [6] and investigated in [14] and [17] t and u may also be executed simultaneously after executing t, since the inhibitor place p 3 of u holds less than 3 tokens prior to the occurrence of u. Thus also the step sequence u may be executed. Hence simultaneity of transition occurrences and absence of ordering are di#erent ....
[Article contains additional citation context not shown here]
R. Janicki and M. Koutny (1995). Semantics of Inhibitor Nets. Information and Computation 123, 1--16.
The Algebraic Structure of Petri Nets - Sassone (2000) (Correct)
No context found.
R. Janicki and M. Koutny (1995), Semantics of Inhibitor Nets. Information and Computation. 123, 1--16, Academic Press.
Algebraic Theories for Contextual Pre-Nets - Bruni, Meseguer, Montanari.. (2001) (Correct)
No context found.
R. Janicki and M. Koutny. Semantics of inhibitor nets. Inf. and Comput., 123(1):1--16, 1995.
Algebraic Theories for Contextual Pre-Nets - Bruni, Meseguer, Montanari.. (Correct)
No context found.
R. Janicki and M. Koutny. Semantics of inhibitor nets. Inf. and Comput., 123(1):1--16, 1995.
The Algebraic Structure of Petri Nets - Sassone (2000) (Correct)
No context found.
R. Janicki and M. Koutny (1995), Semantics of Inhibitor Nets. Information and Computation. 123, 1--16, Academic Press.
Functorial Models for Contextual Pre-Nets - Bruni, Meseguer, Montanari.. (2002) (Correct)
No context found.
R. Janicki and M. Koutny. Semantics of inhibitor nets. Inform. and Comput., 123(1):1--16, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC