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
A logical approach of Petri net languages
β Scribed by Michel Parigot; Elisabeth Pelz
- Book ID
- 107948540
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 775 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Families of Petri net languages are usually defined by varying the type of transition labeling and the class of subsets of N m to be used as sets of final markings (m is the number of places). So far three main classes of subsets have been studied: the trivial class containing as single element N m
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
Recycling and remanufacturing involve product disassembly to retrieve the desired parts and/or subassemblies. Disassembly is a systematic method for separating a product into its constituent parts, components, or other groupings. Disassembly process planning is critical in minimizing the amount of r