IJPAM: Volume 115, No. 3 (2017)
FOR PETRI NETS MODELS
Instituto Politécnico Nacional, CIC
Mineria 17-2, Col. Escandon, Mexico D.F 11800, MEXICO
This paper proposes a formal modeling and validation mathematical analysis methodology, which consists in representing the Petri net model of a discrete event system, by means of a formula in the propositional calculus logic. Then, using the concept of logic implication, and transforming this logical implication relation into a set of clauses, qualitative methods for validation are addressed.
Received: May 29, 2017
Revised: July 19, 2017
Published: July 27, 2017
AMS Subject Classification: 03B70, 93A30, 93D99, 93C10
Key Words and Phrases: Petri net models, discrete event systems, propositional logic, validation, refutation methods
You will need Adobe Acrobat reader. For more information and free download of the reader, see the Adobe Acrobat website.
- J.A. Robinson, A machine-oriented logic based on the resolution principle, Journal of the ACM, 12, No. 1 (1965), 23-41.
- M. Davis, R. Sigal and E. Weyuker, Computability, Complexity, and Languages, Fundamentals of Theoretical Computer Science, Academic Press, 1983.
- J. H. Gallier, Logic For Computer Science Automatic Theorem Proving, Dover, 2015.
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Pages: 607 - 619