Reasoning about petri nets in HOL

Proceedings of the 1991 International Workshop on the HOL Theorem Proving System and Its Applications

Volumn , Issue , 1991, Pages 384-394

  De Barros Lucena, Emilio ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; PETRI NETS; TEMPORAL LOGIC;

ASSERTION LANGUAGE; MODAL MU CALCULUS; PROCESS LANGUAGES; PROOF SYSTEM; TERM LANGUAGES;

THEOREM PROVING;

EID: 85027394482     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HOL.1991.596303     Document Type: Conference Paper

References (21)

1. A. J. Camilleri. Mechanizing CSP Trace Theory in Higher Order Logic. IEEE Transactions on Software Engineering, 16(9):993-1004, September 1990.
2. E. M. Clarke, D. E. Long, and K. L. McMillan. Compositional Model Checking. In Proceedings of the Fourth Annual Sysmposium on Logic in Computer Science, pages 353-362, Washington DC, July 1989.
3. R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench. In Proceedings of the Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, 1989.
4. E. A. Emerson and C.-L. Lei. Efficient Model Checking in Fragments of the Propositional Mu-Calculus. In Proceedings of First Annual Sysmposium on Logic in Computer Science, pages 267-278, Cambridge, Massachusetts, June 1986.
5. U. Engberg and G. Winskel. Petri Nets as Models of Linear Logic. Technical Report DAIMI PB-301, Aarhus University, Computer Science Department, February 1990.
6. M. J. C. Gordon. A Proof Generating System for Higher-Order Logic. Technical Report 103, University of Cambridge, Computer Laboratory, 1987.
7. C. A. R. Hoare. Communicating Sequential Processes. International Series in Computer Science. Prentice-Hall, 1985.
8. D. Kozen. Results on the Propositional μ-Calculus. Theoretical Computer Science, 27: 333-354, 1983.
9. N. Marti-Oliet and J. Meseguer. From Petri nets to Linear Logic. In Proceedings of Category Theory and Computer Science, Manchester, 1989.
10. T. F. Melham. A Mechanized Theory of the π-calculus in HOL. In Proceedings of the Second Annual Esprit BRA Workshop on Logical Frameworks, Edinburgh, May 1991.
11. R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.
12. M. Nesi. Mechanizing a Proof by Induction of Process Algebra Specifications in Higher Order Logic. In Proceedings of the Third Workshop on Computer Aided Verification, Alborg University, 1991.
13. J. L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice-Hall, 1981.
14. W. Reisig. Petri Nets: An Introduction. EACTS Monographs on Theoretical Computer Science. Springer-Verlag, 1985.
15. A. Tarski. A Lattice-Theoretical Fixpoint Theorem and its Applications. Pacific Journal of Mathematics, 5: 285-309, 1955.
16. G. Winskel. Categories of Models for Concurrency. Technical Report 58, University of Cambridge, Computer Laboratory, July 1984.
17. G. Winskel. Synchronization Trees. Theoretical Computer Science, 34: 33-82, 1984.
18. G. Winskel. Petri Nets, Algebras, Morphisms and Compositionality. Information and Computation, 72(3):197-238, March 1987.
19. G. Winskel. A Category of Labelled Petri Nets and Compositional Proof System. In Proceedings of Third Annual Sysmposium on Logic in Computer Science, pages 142-154, Edinburgh, Scotland, July 1988.
20. G. Winskel. A Compositional Proof System on a Category of Labelled Transition Systems. Technical Report DAIMI PB - 294, Aarhus University, Computer Science Department, July 1989.
21. J. Zwiers et al. Compositionality and Concurrent Networks: soundness and completeness of a proof system, volume 194 of Lecture Notes in Computer Science, pages 509-519. Springer-Verlag, 1985.