Verifying part of the ACCESS.bus protocol using PVS

DOI10.1007/3-540-60692-0_43MaRDI QIDQ2956677zbMATH OpenOpenAlexFDO

Authors Jozef Hooman

Publication date 19 January 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60692-0_43

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Pervasive verification of distributed real-time systems
• Verification of a fieldbus scheduling protocol using timed automata
• Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings
• Verifying security protocols with PVS: widening the rank function approach
• scientific article; zbMATH DE number 1852168

Cited in

(5)

• Verification of a fieldbus scheduling protocol using timed automata
• Incremental Proof of the Producer/Consumer Property for the PCI Protocol
• scientific article; zbMATH DE number 1852168 (Why is no real title available?)
• Compositional verification of real-time applications
• The need for compositional proof systems: a survey

This page was built for publication: Verifying part of the ACCESS.bus protocol using PVS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2956677)