S. M. German and A. P. Sistla. Reasoning about Systems with Many Processes. Journal of ACM, 39(3):675-735, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Network Invariants in Action - Kesten, Pnueli, Shahar, Zuck (2002) (1 citation) (Correct)
....invariant method to automatic veri cation of liveness properties of parameterized system, demonstrating the power of the methodology and the wide range of its applicability. Many methods have been proposed for the uniform veri cation of parameterized systems. These include explicit induction ([8]) network invariants, which can be viewed as implicit induction ( 13] 24] 9] 15] methods that can be viewed as abstraction and approximation of network invariants ( 3] 23] 4] and other methods that can be viewed as based on abstraction ( 10] 7] None of these previous articles ....
S. German and A. Sistla. Reasoning about systems with many processes. J. ACM, 39:675-735, 1992.
Beyond Regular Model Checking - Fisman, Pnueli (2001) (1 citation) (Correct)
....languages in this class. Related Work The problem of uniform verification of a parameterized systems is one of the most thoroughly researched problems in computer science. Many methods have been proposed for the uniform verification of parameterized systems. These include explicit induction [EN96,SG92] network invariants, which can be viewed as implicit induction [WL89,HLR92,LHR97,KM95,KP00] methods that can be viewed as abstraction and approximation of network invariants [BCG86,SG89,CGJ95] and other methods that can be viewed as based on abstraction [ID96,EN96] Regular model checking has ....
A.P. Sistla and S.M. German. Reasoning about systems with many processes. J. ACM, 39:675--735, 1992.
Five Ways to Use Induction and Symmetry in the Verification.. - Calder, Miller (2002) (Correct)
....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 ....
....an invariant. In [27] it is shown that, for rings of token passing processes, there exists a k such that the correctness of a ring with k processes implies the correctness of rings of arbitrary size. Extensions to these early results, when a (non trivial) environment process is involved, include [18, 31, 32, 5, 47, 1]. In [44] techniques are presented to automate the construction of abstractions of systems of identical components. An extension of this abstraction technique is implemented within the Mur veri cation system [21] Similarly a fully automated approach for verifying parameterized networks with ....
S.M. German and A. P. Sistla. Reasoning about systems with many processes. Journal of the ACM, 39(3):675-735, July 1992.
Beyond Parameterized Verification - Bozzano, Delzanno (2002) (1 citation) (Correct)
....systems can be reduced to problems related to Petri Nets by applying a counting abstraction that simply forgets local data while keeping track of the number of processes in a given state. Reachability procedures can then be used to verify the original property on the resulting Petri Net like model [10, 14, 15, 19]. New results have also been obtained for the veri cation of another class of in nite state systems, i.e. concurrent systems with a xed number of components but unbounded data. As an example, in [8, 12, 18] constraints are used to symbolically represent and manipulate in nite collections of ....
S. M. German and A. P. Sistla. Reasoning about Systems with Many Processes. Journal of the ACM, 39(3):675-735, 1992.
Verification of Parametric Concurrent Systems with.. - Bouajjani, Habermehl, .. (Correct)
....states. Related Work: There exist several approaches to the parametric verification problem. We can mention, for example, the use of symbolic model checking, automated) abstraction, or network invariants [10, 1, 3, 14, 11, 12] The idea of cut offs has already been used in several contexts [9, 6, 7, 5] too. However, to the best of our knowledge, there is no work covering the class of parametric systems considered here, i.e. parametric resource sharing systems with a prioritized FIFO resource management. The two involved obstacles (parameterization and having multiple queues over an unbounded ....
S. German, A. Sistla. Reasoning about Systems with Many Processes. JACM, 39(3), 1992.
Petri Nets with Non-blocking Arcs are Difficult to Analyze - Raskin, Van Begin (Correct)
....and their extensions are particularly important. In that context, processes of a parametric system are abstracted by tokens, places are used to count the number of processes in each local state of the parametric system and transitions are used to model the dynamic of the processes. Sistla et al. [GS92] have shown that Petri nets are well suited to abstract parametric systems where rendez vous communications are used for synchronizations between processes. When the underlying systems use more exotic communication mechanisms, like broadcast communications for example, the model of Petri nets ....
S. M. German and A. P. Sistla. Reasoning about Systems with Many Processes. Journal of ACM, 39(3):675-735, 1992.
Attacking Symbolic State Explosion - Delzanno, Raskin, Van Begin (4 citations) (Correct)
....The new heuristic rule is presented in Section 4. The new symbolic algorithm is presented in Section 5; its practical evaluation is presented in Section 6. We nish the paper discussing related works and drawing some conclusions. 2 Petri Nets and Veri cation of Safety Properties Following [GS92] asynchronous concurrent systems (possibly with internal states modeled via Boolean variables [BCR01] can be naturally represented as Petri Nets in which places and transitions are used to model local states, internal actions and communication via rendez vous. At this level of abstraction, ....
S. M. German, A. P. Sistla. Reasoning about Systems with Many Processes. JACM 39(3): 675-735 (1992)
Symbolic Distributed Verification of a Class of.. - Massart, Raskin, Van.. (2002) (Correct)
....Nets (a monotonic extension of Petri Nets) This paper gives a brief overview of the problems that are related to a parallel and distributed version of the veri cation algorithm and reports on rst results and the gain that we have obtained with a prototype using a cluster of PCs. Following [4,3], parametric asynchronous concurrent systems can be naturally represented as Transfer Nets in which places, transitions and transfers are used to model local states, internal actions, communications via rendezvous and broadcast, see [3] for more details. At this level of abstraction, processes ....
S. M. German, A. P. Sistla. Reasoning about Systems with Many Processes. JACM 39(3), 1992.
Tools and Techniques for Verifying Parameterized Systems - Shahar (2001) (Correct)
....conclusions and directions for future research are given in chapter 8. Chapter 9 presents the publications which have resulted from my research. 12 Related Work Many methods have been proposed for the uniform verification of parameterized systems. These include explicit induction ( EN95] SG92] network invariants, which can be viewed as implicit induction ( KM89] WL89] HLR92] LHR97] Sis97] methods that can be viewed as abstraction and approximation of network invariants ( BCG86] SG89] CGJ95] and other methods that can be viewed as based on abstraction ( ID96] EN96] ....
....tools for symbolic model checking. Although mona has also been used for automatic verification, for example of pointer programs with linear linked lists [JJKS97] such programs are not parametric. Acceleration There are several results on algorithmic verification of parameterized systems [SG92, AJ98, CGJ95] In most of these works the transitions are guarded by local conditions involving the local states of a fixed (unparameterized) number of processes, in contrast with the general global dependency which is allowed in [KMM 97, ABJN99, JN00] The notions of speed ups and ....
A. P. Sistla and S. M. German. Reasoning about systems with many processes. J. ACM, 39:675--735, 1992.
Monotonic Extensions of Petri Nets: Forward and Backward Search .. - Finkel, al. (2002) (Correct)
....some mutual exclusion protocols have been designed to work for any number of processes that want to share common resources and the verification of such protocols for a specific number of process is not relevant. In this context, several abstraction have proven to be useful, see for example [1, 4, 17]. The work in this paper is directly connected to the context of the so called counting abstraction. When considering the counting abstraction, the model of (infinite) Petri Nets and its This author was partially supported by a Credit aux chercheurs , Belgian National Fund for Scientific ....
S. M. German, A. P. Sistla. Reasoning about Systems with Many Processes. JACM 39(3): 675--735 (1992)
Ameliorating the State Space Explosion Problem - Namjoshi (1998) (3 citations) (Correct)
....of bisimulations or that of a closure process which represents computations of an arbitrary number of processes. KM 89] and [WL 89] introduce the related notion of a process invariant. All these methods rely on human ingenuity to manually construct a suitable process closure or invariant. GS 92] use automata theoretic methods to construct process closures for processes connected in a complete network, and use them to establish single index properties. Multi index properties can be indirectly catered for, but the complexity then becomes multi exponential. In any case, this does not ....
....chapter as the cutoff size is strongly dependent on the formula while in the previous result, the cutoff is dependent only on the form of quantification and not the formula itself. Previous work on the PMCP is oriented, with the exception of [KM 89] towards the interleaving composition model. GS 92] and [EN 95] provide algorithms for some classes of parameterized systems, while other techniques [Lubachevsky 84, SG 89, KM 89, WL 89, Vernier 93, CGJ 95] have only a limited degree of automation. The approach presented here is fully automated. The class of synchronous 50 systems is specified ....
[Article contains additional citation context not shown here]
German, S. M., Sistla, A. P. Reasoning about Systems with Many Processes. J.ACM, Vol. 39, Number 3, July 1992.
Reducing Model Checking of the Many to the Few - Emerson, Kahlon (2000) (10 citations) (Correct)
.... a path downstairs , but paths downstairs do not necessarily lift) Other methods can be fully automated but do not appear to have a clearly defined class of protocols on which they are guaranteed to terminate successfully (cf. 5] 23] 21] For systems with CCS processes German and Sistla [11] combine automata theoretic method with process closures to permit efficient solution to PMCP for single index properties, modulo deadlock. But efficient solution is only yielded for processes in a single class. Even for systems of the form CjjU a double exponential decision procedure results, ....
S.M. German and A.P. Sistla. Reasoning about Systems with Many Processes. J. ACM,39(3), July 1992.
Automatic Deductive Verification with Invisible Invariants - Pnueli, Ruah, Zuck (9 citations) (Correct)
....of parameterized systems for which the problem becomes decidable, or devise methods which are sound but, necessarily incomplete, and hope that the system of interest will yield to one of these methods. Among the representatives of the rst approach we can count the work of German and Sistla [SG92] which assumes a parameterized system where processes communicate synchronously, and shows how to verify single index properties. Similarly, Emerson and Namjoshi [EN96] proved a PSPACE complete algorithm for veri cation of synchronously communicating processes. Many of these methods fail when we ....
A.P. Sistla and S.M. German. Reasoning about systems with many processes. J. ACM, 39:675-735, 1992.
Accepted for presentation to Journees Montoises d'Informatique - Th Eoriques Expand (Correct)
No context found.
S. M. German and A. P. Sistla. Reasoning about Systems with Many Processes. Journal of ACM, 39(3):675-735, 1992.
On the Verification of Broadcast Protocols - Esparza, Finkel, Mayr (1999) (9 citations) (Correct)
No context found.
German, S.M., Sistla, A.P. Reasoning about Systems with Many Processes. JACM 39(3), 1992.
Unknown - Fhgjilknm Opgjirqtsumvilw Opxyo (2003) (Correct)
No context found.
S. M. German and A. P. Sistla. Reasoning about Systems with Many Processes. Journal of ACM, 39(3):675--735, 1992.
Monotonic Extensions of Petri Nets: Forward and Backward Search.. - Raskin (2002) (Correct)
No context found.
S. M. German, A. P. Sistla. Reasoning about Systems with Many Processes. JACM 39(3): 675--735 (1992)
Covering Sharing Trees: A Compact Data Structure for.. - Delzanno, Raskin, Van.. (Correct)
No context found.
S. M. German, A. P. Sistla. Reasoning about Systems with Many Processes. Journal of ACM 39(3): 675-735, 1992.
Refactoring Design Models for Inductive Verification - Yung-Pin Cheng Dept (2002) (Correct)
No context found.
S. M. German and A. P. Sistla. Reasoning about systems with many processes. Journal of the ACM, 39(3):675--735, July 1992.
Petri Nets with Non-blocking Arcs are Difficult to Analyze - Raskin, Van Begin (2003) (Correct)
No context found.
S. M. German and A. P. Sistla. Reasoning about Systems with Many Processes. Journal of ACM, 39(3):675--735, 1992.
Concurrent Boolean Programs - Geeraerts, Van Begin (Correct)
No context found.
S. M. German and A. P. Sistla. Reasoning about Systems with Many Processes. Journal of ACM, 39(3):675-735, 1992.
CSTs (Covering Sharing Trees): Compact Data Structures.. - Delzanno, Raskin, Van.. (Correct)
No context found.
S. M. German, A. P. Sistla. Reasoning about Systems with Many Processes. JACM 39(3): 675-735 (1992)
Decidability of Invariant Validation for Parameterized Systems - Fontaine, Gribomont (2003) (Correct)
No context found.
S. M. German and A. P. Sistla. Reasoning about systems with many processes. Journal of the ACM, 39(3):675-735, July 1992.
On the Automated Verification of Parameterized Concurrent.. - Delzanno (Correct)
No context found.
S. M. German and A. P. Sistla. Reasoning about Systems with Many Processes. Journal of the ACM, 39(3):675-735, 1992.
On Model Checking for a Nominal Process Calculus - Delzanno (Correct)
No context found.
S. M. German and A. P. Sistla. Reasoning about Systems with Many Processes. Journal of the ACM, 39(3):675-735, 1992.
First 50 documents Next 50
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