๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Expertext: From semantic nets to logic Petri nets

โœ Scribed by Roy Rada; Paul E.S. Dunne; Judith Barlow


Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
965 KB
Volume
1
Category
Article
ISSN
0957-4174

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A Petri net model for probabilistic logi
โœ Chuang Lin; Y. T. Wu ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 815 KB

In this article we investigate the use of Petri nets for the representation of possible worlds in probabilistic logic. We propose a method to generate possible worlds based upon the reachability tree of the Petri net model. The number of columns in the matrix of possible worlds grows exponentially w

Logical inference of clauses based on Pe
โœ Chuang Lin; Samuel T. Chanson ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 178 KB ๐Ÿ‘ 1 views

This paper extends the logical inference of Horn clauses in Petri net models to cover a large class of non-Horn clauses. Based on four-valued logic and the conflict transition concept, we show how the Petri net model for this class of non-Horn clauses can be constructed. The clause inference is solv

Petri Nets โ€“ A Mathematical Formalism to
โœ Ina Koch ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Wiley (John Wiley & Sons) ๐ŸŒ English โš– 224 KB

## Abstract In this review we introduce and discuss Petri nets โ€“ a mathematical formalism to describe and analyze chemical reaction networks. Petri nets were developed to describe concurrency in general systems. We find most applications to technical and financial systems, but since about twenty ye

Petri net model with fuzzy timing and fu
โœ Yi Zhou; Tadao Murata ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 321 KB ๐Ÿ‘ 2 views

This paper is concerned with a Petri net model having fuzzy timing and fuzzy real-time temporal logic. In an earlier paper, we introduced a Petri net model with four fuzzy set theoretic functions of time but no algorithms were given for computing the two important operators called, earliest and late