Verification of a fieldbus scheduling protocol using timed automata

MaRDI QIDQ2969151zbMATH OpenFDO

Authors Nicholaos Petalidis

Publication date 14 March 2017

zbMATH Keywords

timed automataformal verificationprotocol verificationUPPAALfieldbus

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Verifying a scheduling protocol of safety-critical systems
• Formal verification of multitasking applications based on timed automata model
• How to verify a Safe real-time system: The application of model checking and timed automata to the production cell case study
• scientific article; zbMATH DE number 2102690
• Verifying part of the ACCESS.bus protocol using PVS

Cited in

(9)

• scientific article; zbMATH DE number 220136 (Why is no real title available?)
• Multicycle polling scheduling algorithms for FieldBus networks
• Verifying a scheduling protocol of safety-critical systems
• Design and FPGA verification of a novel reliable real-time data transfer system
• Automatic Verification of Bossa Scheduler Properties
• Verifying part of the ACCESS.bus protocol using PVS
• Planning of time triggered communication schedules
• Verification of the legOS scheduler using Uppaal
• Verifying weakly-hard real-time properties of traffic streams in switched networks

Describes a project that uses

Uses Software

• Uppaal

This page was built for publication: Verification of a fieldbus scheduling protocol using timed automata

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