Verification of a fieldbus scheduling protocol using timed automata
From MaRDI portal
Publication:2969151
zbMATH Open1399.68028MaRDI QIDQ2969151FDOQ2969151
Authors: Nicholaos Petalidis 
Publication date: 14 March 2017
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
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (9)
- Multicycle polling scheduling algorithms for FieldBus networks
- Verification of the legOS scheduler using Uppaal
- Verifying part of the ACCESS.bus protocol using PVS
- Title not available (Why is that?)
- Verifying weakly-hard real-time properties of traffic streams in switched networks
- Automatic Verification of Bossa Scheduler Properties
- Design and FPGA verification of a novel reliable real-time data transfer system
- Planning of time triggered communication schedules
- Verifying a scheduling protocol of safety-critical systems
Uses Software
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)
