AW Roscoe, PHB Gardiner, MH Goldsmith, JR Hulance, DM Jackson, JB Scattergood. H ierarchical compression for model-checking CSP or How to check 10 20 dining philosphers for deadlock, Springer LNCS 1019. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Verifying End-to-End Protocols Using Induction with CSP/FDR - Creese, Reed (1999) (2 citations) (Correct)
....tools. Model checking based techniques do not directly handle unbounded state problems; however this induction technique enables their use for certain classes of such applications, notably end to end protocols with arbitrary numbers of intermediate nodes. We illustrate the method using FDR [8, 23], a software package offered by Formal Systems (Europe) Ltd, which allows automatic checking of many properties of finite state systems and the interactive investigation of processes which fail these checks. The tool is based on the mathematical theory of Communicating Sequential Processes(CSP) ....
AW Roscoe, PHB Gardiner, MH Goldsmith, JR Hulance, DM Jackson, JB Scattergood. H ierarchical compression for model-checking CSP or How to check 10 20 dining philosphers for deadlock, Springer LNCS 1019.
Automated Formal Analysis of Networks: FDR Models of.. - Reed, Jackson.. (1998) (7 citations) Self-citation (Jackson) (Correct)
....as well as correctness of service delivery is a priority. This paper presents elements of formal models of networks which capture various properties of resource management and control flow schemes, of special relevance for high speed, multiservice networks. These models are analysed with FDR [FDR94,RGG95], a software package offered by Formal Systems (Europe) Ltd, which allows automatic checking of many properties of finite state systems and the interactive investigation of processes which fail these checks. It is based on the mathematical theory of Communicating Sequential Processes, developed at ....
AW Roscoe, PHB Gardiner, MH Goldsmith, JR Hulance, DM Jackson, JB Scattergood. H ierarchical compression for model-checking CSP or How to check 10 20 dining philosphers for deadlock, Springer LNCS 1019.
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