Clarke E. M., Grumberg O. and Browne M. C. [1986], Reasoning about networks with many identical nite-state processes, in `Proc. 5th Ann. ACM Symp. on Principles of Distributed Computing', ACM, pp. 240-248.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....previously in this case we are not concerned with the number of states to be visited but the number of cases to be checked. Induction Model checking alone does not allow us to generalise about results, the problem is undecidable [4] However, in some speci c cases the problem is solvable [8, 27, 31, 10]. If the processes are terminating then, under some circumstances, with time, a system P n will degenerate to a system P n 1 . Then, a proof of (certain types of) property of all systems of size n 1, together with an inductive step, will imply the proof of all systems of size n. If, on the on the ....

....Simple induction There are numerous results for this case. Early results involve families of systems consisting of identical processes. Kurshan et al. [47] prove a a structural induction theorem for processes using the simulation 11 pre order to generate the invariant. Similar results are achieved [8, 59] by establishing a bisimulation equivalence between global state graphs of systems of di erent sizes. Context free network grammars are used [53, 19] to generate both generate suitable in nite families and to generate an invariant. In [27] it is shown that, for rings of token passing processes, ....

M.C. Browne, E.M. Clarke, and O. Grumberg. Reasoning about networks with many identical nite state processes. Information and Computation, 81:13-31, 1989.

....The methods presented in [GS92, EN95, EN96] show that for classes of ring networks of arbitrary size and client server systems, there exists k such that the veri cation of the parameterized network can be reduced to the veri cation of networks of size up to k. Alternative methods presented in [KM89, WL89, BCG89, SG89, HLR92, LHR97] are based on induction on the number of processes. These methods require nding a network invariant that abstracts any arbitrary number of processes with respect to a pre order that preserves the property to be veri ed. While this method has been originally presented for linear networks, it has ....

M.C. Browne, E.M. Clarke, and O. Grumberg. Reasoning about networks with many identical nite state processes. Information and Computation, 1989.

....networks. The methods presented in [GS92,EN96] show that for classes of ring networks of arbitrary size and client server systems, there exists k such that the veri cation of the parameterized network can be reduced to the veri cation of networks of size up to k. Alternative methods presented in [KM89,WL89,BCG89] are based on induction on the number of processes. These methods require nding a network invariant that abstracts any arbitrary number of processes with respect to a pre order that preserves the property to be veri ed. While this method has been originally presented for linear networks, it has ....

M.C. Browne, E.M. Clarke, and O. Grumberg. Reasoning about networks with many identical nite state processes. Information and Computation, 1989.

....our transformation rules are also applicable for proving general program properties. Regarding related work in the veri cation area, a myriad of techniques have been proposed during the past decade for verifying parameterized systems, and the related problem of verifying in nite state systems. BCG89,EN95,ID99]reduce the problem of verifying a parameterized system to the veri cation of an equivalent nite state system. WL89,KM95,LHR97] seek to identify a network invariant that is invariant with respect to the given notion of parallel composition and stronger than the property to be ....

M. Browne, E. Clarke, and O. Grumberg. Reasoning about networks with manyidentical nite-state processes. ########### ### ###########, 81(1):13-31, 1989.

....The methods presented in [GS92, EN96] show that for classes of ring networks of arbitrary size and client server systems, there exists k such that the veri cation of the parameterized network can be reduced to the veri cation of networks of size up to k. Alternative methods presented in [KM89, WL89, BCG89, SG89, HLR92, LHR97] are based on induction on the number of processes. These methods require nding a network invariant that abstracts any arbitrary number of processes with respect to a pre order that preserves the property to be veri ed. While this method has been originally presented for linear networks, it has ....

M.C. Browne, E.M. Clarke, and O. Grumberg. Reasoning about networks with many identical nite state processes. Information and Computation, 1989.

....The methods presented in [GS92,EN95,EN96] show that for classes of ring networks of arbitrary size and client server systems, there exists k such that the veri cation of the parameterized network can be reduced to the veri cation of networks of size up to k. Alternative methods presented in [KM89,WL89,BCG89,SG89,HLR92,LHR97] are based on induction on the number of processes. These methods require nding a network invariant that abstracts any arbitrary number of processes with respect to a pre order that This work has been partially supported by the Esprit LTR project Vires. Contact Author. preserves the ....

M.C. Browne, E.M. Clarke, and O. Grumberg. Reasoning about networks with many identical nite state processes. Information and Computation, 1989.

....programs appear in chapters 2.1 and 3.1. Related Work : Veri cation Regarding related work in the veri cation area, a myriad of techniques have been proposed during the past decade for verifying parameterized systems, and the related problem of verifying in nite state systems. These include [BCG89, EN95, ID96] which reduce the problem of verifying a parameterized system to the veri cation of an equivalent nite state system, and [WL89, KM95, LHR97] which seek to identify a network invariant that is invariant with respect to the given notion of parallel composition and stronger than ....

M. Browne, E. Clarke, and O. Grumberg. Reasoning about networks with many identical nite-state processes. Information and Computation, 81(1):13-31, 1989. 82

....our transformation rules are also applicable for proving general program properties. Regarding related work in the veri cation area, a myriad of techniques have been proposed during the past decade for verifying parameterized systems, and the related problem of verifying in nite state systems. BCG89,EN95,ID99] reduce the problem of verifying a parameterized system to the veri cation of an equivalent nite state system. WL89,KM95,LHR97] seek to identify a network invariant that is invariant with respect to the given notion of parallel composition and stronger than the property to be ....

M. Browne, E. Clarke, and O. Grumberg. Reasoning about networks with many identical nite-state processes. Information and Computation, 81(1):13-31, 1989.

No context found.

Clarke E. M., Grumberg O. and Browne M. C. [1986], Reasoning about networks with many identical nite-state processes, in `Proc. 5th Ann. ACM Symp. on Principles of Distributed Computing', ACM, pp. 240-248.

No context found.

Browne M. C., Clarke E. M. and Grumberg O. [1989], `Reasoning about networks with many identical nite{state processes', Information and Computation 81(1), 13-31.

No context found.

M. Browne, E.M. Clarke, and O. Grumberg. Reasoning about networks with many identical nite state processes. Information and Computation, 81(1):13{ 31, 1989.

No context found.

M.C. Browne, E.M. Clarke, and O. Grumberg. Reasoning about networks with many identical nite state processes. Information and Computation, 1989.

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