Declarative operations on nets

Referential nets as ACT-R declarative memory representation

Two different predictions • Solution 1 predicts that accessing knowledge about a refO takes time. • Solution 2 finishes the comparison within a single ACT-R cycle. → ACT-R predicts behaviour according to solution 1. → Referential nets predict solution 2 (immediate access to a refO’s information). → Solution 2 is supported by inC (incremental conceptualiser, Guhe et al 2003). → Processing of con...

Synthesis of Petri Nets with Whole-Place Operations and Localities

Generalised Composition Operations for High-level Petri Nets

We propose generic schemes for basic composition operations (sequential composition , choice, iteration, and reenement) for high-level Petri nets. They tolerate liberal combinations of place types (equal, disjoint, intersecting) and, owing to a parameterised scheme of type construction, allow for weak and strong versions of compositions. Properties such as associativity, commutativity, and cohe...

Computer-aided Hazard Identification in Sequential Operations Using Petri Nets

A systematic procedure is presented in this paper to construct Petri nets (PN) for modeling the fault propagation behaviors in sequential operations. A complete system model is basically organized according to a hierarchy of four levels, i.e. (1) the controller/operator, (2) the valves, (3) the process units, and (4) the sensors. Every component model is built with two distinct elements. One is...

On exponential domination and graph operations

An exponential dominating set of graph $G = (V,E )$ is a subset $Ssubseteq V(G)$ such that $sum_{uin S}(1/2)^{overline{d}{(u,v)-1}}geq 1$ for every vertex $v$ in $V(G)-S$, where $overline{d}(u,v)$ is the distance between vertices $u in S$ and $v  in V(G)-S$ in the graph $G -(S-{u})$. The exponential domination number, $gamma_{e}(G)$, is the smallest cardinality of an exponential dominating set....