Logical reasoning and Petri nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2679, Issue , 2003, Pages 276-295

  Lautenbach, Kurt ^a  

^a University of Koblenz   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PETRI NETS;

LOGICAL REASONING; PROPOSITIONAL LOGIC;

FORMAL LOGIC;

EID: 35248872419     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44919-1_19     Document Type: Article

References (7)

1. J. Ezpeleta, J. M. Couvreur and M. Silva. A new technique for finding a generating family of siphons, traps and st-components. Application to colored Petri Nets. Lecture Notes in Computer Science; Advances in Petri Nets 1993, 674:126-147, 1993.
2. J.H. Gallier. Logic for Computer Science: Foundations of Automated Theorem Proving. Wiley, 1987.
3. H. J. Genrich and G. Thieler-Mevissen. The Calculus of Facts. Mazurkiewicz, Mathematical Foundations of Computer Science 1976, Lecture Notes in Computer Science 45, S. 588-595. Springer, 1976.
4. K. Lautenbach. Reproducibility of the Empty Marking. Javier Esparza and Charles Lakos, Applications and Theory of Petri Nets 2002, 23rd International Conference, ICATPN 2002, Adelaide, Australia, June 24-30, 2002, Proceedings, Band 2360 von Lecture Notes in Computer Science, S. 237-253. Springer, 2002.
5. Tadao Murata. Petri Nets: Properties, Analysis and Applications. Proceedings of the IEEE, S. 541-580, April 1989.
6. G. Peterka and Tadao Murata. Proof Procedure and Answer Extraction in Petri Net Model of Logic Programs. IEEE Trans. Software Eng., 15(2):209-217, 1989.
7. W. Reisig. Petri Nets., Band 4. Springer-Verlag EATCS Monographs on Theoretical Computer Science, 1985.