The nets considered here are an extension of Petri nets in two aspects. In the semantical aspect, there is no one firing rule common to all transitions, but every transition is tr...
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
Studying an evolving complex system and drawing some conclusions from it is an integral part of nature-inspired computing; being a part of that complex system, some insight can als...
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidabi...