K Sidle, Pi Bus, Formal Methods Europe, Barcelona, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Automated Formal Analysis of Networks: FDR Models of.. - Reed, Jackson.. (1998) (7 citations) (Correct)
....protocol development and implementation, control, signalling, fault tolerant systems and security. Although the underlying semantic models for FDR do not specifically address time (in contrast to Timed CSP formalism [RR86,TCSP92,KR93] work has been carried out modeling discrete time with FDR [Sid93,Ros97]. A class of embedded real time scheduler implementations [Jac96] is analysed with FDR by extracting numerical information from refinement checks to show not only that a timing requirement is satisfied, but also to determine the margin by which it is met. 4 Properties of Arbitrarily Configured ....
K Sidle, Pi Bus, Formal Methods Europe, Barcelona, 1993.
Verifying End-to-End Protocols Using Induction with CSP/FDR - Creese, Reed (1999) (2 citations) (Correct)
....design, protocol development and implementation, control, signalling, fault tolerant systems and security. Although the underlying semantic models for FDR do not specifically address time (in contrast to Timed CSP formalism [17, 24, 31] work has been carried out modelling discrete time with FDR [25, 28], including a class of embedded real time scheduler implementations [15] and a traffic congestion algorithm [22] 4 A Reservation Protocol We illustrate the induction technique on a protocol patterned after the RSVP reservation protocol intended for IP based networks. This protocol addresses ....
K Sidle, Pi Bus, Formal Methods Europe, Barcelona, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC