R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent Systems. ACM Transactions on Programming Languages and Systems, 15(1):36--72, January 1993.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....automata theory, process algebras and state space exploration algorithms. In the early 1990 s, model checking evolved from a mostly theoretical discipline in computer science to a practical design verification framework thanks to the development of tools such as CAESAR [15] COSPAN [21] CWB [7], MURPHI [12] SMV [28] and SPIN [22] among others. These tools can automatically explore the state space of a concurrent reactive system represented by a program specified in essentially a finite state modeling language. They have been successfully applied to analyze the correctness of a large ....

R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 1(15):36--72, 1993.

....weak transition semantics, P = P , which does not observe transitions. Finally, we have extended the modal logic representation introducing new modalities [ K] and hhKii de ned by means of the weak transition relation. Other speci c purpose tools, such as the Concurrency Workbench [5], are more ecient and expressive than our tool, which is much in the 16 style of a prototype, where we can play not only with processes and their capabilities, but with the semantics, represented at a very high mathematical level, adding or modifying some rules. Although our implementation is ....

R. Cleaveland, J. Parrow, and B. Steen. The Concurrency Workbench: A semantics-based tool for the veri cation of nite-state systems. ACM Transactions on Programming Languages and Systems, 15(1):36-72, Jan. 1993.

....structure can be used to (often significantly) reduce the size of the model, while preserving important fragments of temporal logics such as #CTL # and # calculus ( 14,3] Several polynomial time algorithms to compute similarity quotients have been proposed. The ones presented in in [1] [4], and [5] determine the simulation over a Kripke structure with states and E transitions using A preliminary version of this work has been presented to the workshop SAVE 2001. Email: gentilin dimi.uniud.it Email: piazza dimi.uniud.it Email: policrit dimi.uniud.it c #2002 ....

....Simulation Equivalence] Given G = E, ##, the maximum simulation equivalence N is defined as: n s n. Lemma 2.5 The relation s is an equivalence relation. We consider the problem of computing s over G = E, ##. All of the algorithms mentioned in the introduction ( 1] [4], 5] 2] 12] obtain the similarity quotient, S = N s , as a by product of the computation of the similarity relation on N . Their space complexity is then limited from below by O( N ) The simulation algorithms in [6] 3] and [10] do not compute the entire simulation relation over N ....

R. Cleaveland, J. Parrow, and B. Ste#en. The Concurrency Workbench: A Semantics Based Tool for the Verification of Concurrent Systems. ACM Transactions on Programming Languages and Systems, 15(1):36--72, January 1993.

.... to explicitly represent concurrency between scenarios [29] The graphic notation of UCMs expresses the concurrency that is desired between use cases, and has been used to detect feature interactions [16] There is a large body of established work on concurrency and concurrent systems [30] [31], 32] but it been little applied to concurrency between scenarios. Scenario networks begin to address concurrency between scenarios and this continues to be an area of focus for future work. H. Specification formalisms for modelling A specification formalism is a basis for constructing a ....

Rance Cleaveland, Joachim Parrow, and Bernhard Ste#en, "The Concurrency Workbench: A semantics-based tool for the verification of concurrent systems," ACM Transactions on Programming Languages and Systems, vol. 15, no. 1, pp. 36--72, Jan. 1993.

....by Kanellakis and Smolka [KS90] while Bouali and de Simone algorithm [BdS92] is used in the case of symbolic representation. The veri cation environment XEVE [Bou98] provides bisimulation tools which can be used for both minimization and equivalence test. The Concurrency Workbench (CWB) CPS93] tests bisimulation using techniques based on the Kanellakis and Smolka algorithm. The Compositional Security Checker (CoSec) FG97] exploits the bisimulation algorithm implemented in CWB in order to test information ow security properties. In the Concurrency Workbench of the New Century (CWBNC) ....

R. Cleaveland, J. Parrow, and B. Steen. The Concurrency Workbench: A semantics based tool for the veri cation of concurrent systems. ACM Transactions on Programming Languages and Systems, 15(1):36-72, 1993.

....is an algorithm for the translation of business processes from the process interchange format PIF [7] to CCS. Properties of the translated process (such as deadlocks, livelocks and other safety and liveness properties [6] can then be verified using CCS and the Edinburgh Concurrency Workbench [1, 9]. This approach was evaluated using a scenario based on the business process enacted by a typical Correspondence Handling Centre. 2. MOTIVATION The domain adopted here is that of an enterprise receiving a stream of correspondence from its customers concerning its service offerings. These ....

....same activity name. Consider the sub process in example 5. 1. The algorithm translates it into the CCS expressions in Figure 1.6 which include two acknowledgements to ensure that collection is not carried out until both sub processing activities have terminated. Using the concurrency workbench [1, 9] we want to verify some properties of this process. First of all, we would like to know whether items are always finally collected. The workbench provides the operator AF to check such a safety property (For a formal definition of AF as a fixpoint see [3] If we type checkprop(X 1 ; AF (hcollect ....

R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics based tool for the verification of concurrent systems. In Proc. of the WS on Automated Verification Methods for Finite-state systems, LNCS 407. Springer-Verlag, 1989. The workbench is available at http://www.dcs.ed.ac.uk/packages/cwb/.

.... results are taken from a CCS model of a COMA (Cache Only Memory Architecture) cache coherence protocol [2] We use the more recent CCS model obtained from the site ftp.sics.se pub fdt fm Coma rather than that in the paper; we also modify the syntax to that of the Concurrency Workbench [5]. We used the Concurrency workbench in order to convert the model into a representation that we can use for our experiment. The model is of a system with three components: two clients and a single directory. The system S2 with 529 states is a set of processes to generate local read and write ....

R. Cleaveland, J. Parrow, B. Steen, The Concurrency Workbench: a semanticbased tool for the veri cation of concurrent systems, TOPLAS 15(1993), 36-72.

....the accuracy of a possibly faulty model. AMC takes as input a (possibly erroneous) model of a system and an LTL property or speci cation automaton. We currently handle, in addition to the format used by AMC itself, input of models or speci cation automata produced by the Concurrency Workbench [3]. AMC must also be equipped with an interface to the actual system. AMC alternates between model checking runs on the current model, and incremental learning for improving the model (see Figure 1) The usual output of model checking is either a counterexample for the given property or a statement ....

R. Cleaveland, J. Parrow, B. Steen, The Concurrency Workbench: a semanticbased tool for the veri cation of concurrent systems, TOPLAS 15(1993), 36-72.

.... results are taken from a CCS model of a COMA (Cache Only Memory Architecture) cache coherence protocol [2] We use the more recent CCS model obtained from the site ftp.sics.se pub fdt fm Coma rather than that in the paper; we also modify the syntax to that of the Concur rency Workbench [5]. We used the Concurrency workbench in order to convert the model into a representation that we can use for our experiment. The model is of a system with three components: two clients and a single directory. The system S2 with 529 states is a set of processes to generate local read and write ....

R. Cleaveland, J. Parrow, B. Steffen, The Concurrency Workbench: a semanticbased tool for the verification of concurrent systems, TOPLAS 15(1993), 36-72.

.... These formalisms fall into three classes: ffl General Purpose Theorem Provers (e.g. Boyer Moore [1] EVES [10] EHDM [12] PVS [13] HOL [7] ffl Model Checkers (e.g. Clarke s CTL [2] the Modechart verifier [14] and ffl Process Algebras (e.g. CSR [6] Cleaveland s Concurrency Workbench [3], and CSP [5] We note that verification tools based on the two latter approaches, model checking and process algebras, are highly specialized and provides verification with little human intervention. In contrast, a proof generated with a general purpose theorem prover usually requires ....

R. Cleaveland, "The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent Systems," Tech. Rpt. TR-91-26, North Carolina State Univ., Raleigh, NC, 1991.

....for implicitly representing large sets of states in a compact fashion. This proved to be very successful for the veri cation of synchronous digital circuits, as it increased the manageable sizes of state spaces from about 10 states, with traditional explicit state space generation techniques [14], to about 10 states [9] Unfortunately, symbolic techniques are known not to work well for asynchronous systems, such as communication protocols, which particularly su er from state space explosion. The latter problem was addressed in previous work by the authors in the context of state space ....

R. Cleaveland, J. Parrow, and B. Steen. The Concurrency Workbench: A semantics-based tool for the veri cation of nite-state systems. TOPLAS, 15(1):36-72, 1993.

....time and space consuming. Consider once more the example with the four components. Let us interpret each atom as a process and each connection as the ability to synchronize on some action. We view the system hierarchically decomposed as in Figure 8. 1 (i) Tools such as the concurrency workbench [CPS93] can analyze it in the following way. First take the product of processes A and B. Now their synchronization can be viewed as internal to this composite process, and we can apply a reduction based on weak bisimulation minimizing the size. Analogously, compose C with D and minimize. The obtained ....

Rance Cleaveland, Joachim Parrow, and Bernhard Ste#en. The Concurrency Workbench: A Semantics Based Tool for the Verification of Concurrent Systems. ACM Transactions on Programming Languages and Systems, 15(1):36--72, January 1993. 153

....be generated from this trace to demonstrate the problem to the developer. 5 Related Work Process algebra representations, such as CSP [7] CCS [9] the calculus [10] or FSP [8] can be used to model the concurrent behaviour of a distributed system. Tools, such as the Concurrency workbench [3] or the Labelled Transition System Analyzer available for FSP can be used to check these models for violations of liveness or safety properties. The problem with both these formalisms and tools is, however, that they are difficult to use for the practitioner and that they are general purpose tools ....

R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A Semantics Based Tool for the Verification of Concurrent Systems. ACM Transactions on Programming Languages and Systems, 15(1):36--72, 1993.

....) g(t) 0 (The gate is down during all occupancy intervals. Utility Property: t 62 [ i [ i Gamma 1 ; i 2 ] g(t) 90 (The gate is up when no train is in the crossing. To solve the GRC problem, real time researchers have applied a variety of formal methods, including process algebraic [9, 3, 1], event based [10] and logic based approaches [19, 11] They Code 5546, Naval Research Laboratory, Washington, D.C. 20375. Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139. Supported by NSF grant 9225124 CCR, ONR contract N00014 91 J 1046, AFOSR ....

R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics-based tool for the verification of concurrent systems. ACM Trans. Prog. Lang. and Sys., 15(1):36--72, Jan. 1993.

....using temporal logics and to describe models of systems using some finite state transition representation. The tools are based on a variety of verification techniques. For example, SPIN [16] and SMV [22] are based on state space exploration, also called model checking, Concurrency Workbench [6] on bisimulation, and COSPAN [11] on language contain ment. Most finite state verification techniques can be fully automated, and the responsibility of the user reduces to just specifying the model and expressing the desired properties. In this context, it is important that properties can be ....

Rance Cleaveland, Joachim Parrow, and Bernhard Steffen. "The Concurrency Workbench: A Seman- tics Based Tool for the Verification of Concurrent Systems". A CM Trasactios o Programming La- guagcs atd Systems, 15(1):36 72, January 1993.

....on transition semantics. We formally specify the multi agent system for the diagnosis of a computer network in CCS and try to verify that it meets a straightforward implementation, also formulated as CCS expressions. The verification is carried out automatically using the concurrency workbench [CPS89] The first check for equivalence fails and furthermore the workbench detects a deadlock. After a correction the workbench still complains a livelock. The final implementation is proven equivalent to the specification. From this experiment we extract concepts and modelling techniques and discuss ....

....the calculus for concurrent systems, is a promising background for the verification of communication in multi agent systems. The example of a distributed diagnosing system for a computer network served as a proof of principles. We showed how to proof automatically using the concurrency workbench [CPS89] that a specification of agents communication meets its implementation. This included checking for live and deadlocks. But there is still a gap between communication as used in languages based on message passing and as formally specified in a calculus as CCS. More work has to be spent on a ....

Rance Cleaveland, Joachim Parrow, and Bernhard Steffen. The concurrency workbench: A semantics based tool for the verification of concurrent systems. In Proceedings of the workshop on Automated Verification Methods for Finite-state systems, Lecture Notes in Computer Sciences 407. Springer-Verlag, 1989. The workbench is available at http://www.dcs.ed.ac.uk/packages/cwb/.

....polynomial time algorithm is known, see [KST93] 3 communicate using channel u. This corresponds to the hypergraph of Figure 1. Instead of viewing the system as a set of 4 processes, if we view the system hierarchically decomposed as shown in left of Figure 1, tools such as concurrency workbench [CPS91, CPS93], can analyze it in the following way. First take the product of processes A and C. Now the communication channel y can be viewed as internal to this composite process, and we can apply a reduction based on weak bisimulation minimizing the size. Analogously, compose B and D, and minimize ....

R. Cleaveland, J. Parrow, and B. Ste#en. The Concurrency Workbench: A Semantics Based Tool for the Verification of Concurrent Systems. ACM Transactions on Programming Languages and Systems, 15(1):36--72, January 1993.

....polynomial time algorithm is known, see [KST93] 3 communicate using channel u. This corresponds to the hypergraph of Figure 1. Instead of viewing the system as a set of 4 processes, if we view the system hierarchically decomposed as shown in left of Figure 1, tools such as concurrency workbench [CPS91, CPS93], can analyze it in the following way. First take the product of processes A and C. Now the communication channel y can be viewed as internal to this composite process, and we can apply a reduction based on weak bisimulation minimizing the size. Analogously, compose B and D, and minimize ....

R. Cleaveland, J. Parrow, and B. Ste#en. The concurrency workbench: A semantics based tool for the verification of concurrent systems. Technical Report 91-24, Technical University of Aachen (RWTH Aachen), 1991.

....only the constant c; ff( g(f( g, the set containing all terms of the form f(s) or g(f(s) t) for any terms s; t; and fg, the empty set. Other implementations of CSP and related formalisms have used other approaches to defining sets. In the Concurrency Workbench of North Carolina [CPS93] a set is any finite list of identifiers, or any intersection, union or difference of sets. In Machine Readable CSP [Sca98] users can define a much richer range of sets, including sets of terms satisfying a given boolean expression. Our sets are intermediate in expressiveness between these ....

Rance Cleaveland, Joachim Parrow, and Bernhard Steffen. The concurrency workbench: A semantics-based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 15(1):36--72, January 1993.

.... bisimulation and it is still adequate for the veri cation of all the formulae of the branching temporal logic without quanti ers switches (e.g. the formulae of ACTL , see [14] Several polynomial time algorithms for computing similarity quotients have been proposed: the ones presented in [2] [6], and [7] achieve time complexities of the orders O(jN j 6 jEj) O(jN j 4 jEj) and O(jEj 2 ) respectively. The best time complexity for algorithms computing the maximal simulation is the one presented in [11] and [3] O(jN jjEj) All of the algorithms just mentioned ( 2] 6] 7] 3] ....

....in [2] 6] and [7] achieve time complexities of the orders O(jN j 6 jEj) O(jN j 4 jEj) and O(jEj 2 ) respectively. The best time complexity for algorithms computing the maximal simulation is the one presented in [11] and [3] O(jN jjEj) All of the algorithms just mentioned ( 2] [6], 7] 3] 11] obtain the similarity quotient as a by product of the computation of the similarity relation on the set of states N . Their space complexity is then limited from below by O(jN j 2 ) Recently Bustan and Grumberg proposed an algorithm which gives in output the quotient structure ....

[Article contains additional citation context not shown here]

R. Cleaveland, J. Parrow, and B. Steen. The Concurrency Workbench: A Semantics Based Tool for the Verication of Concurrent Systems. ACM Transactions on Programming Languages and Systems, 15(1):36-72, January 1993.

....in the integration, highlighting a particular integration paradigm in which one tool becomes a subshell of the other. 1 Introduction This paper describes a tool integration effort involving the combination of two system analysis tools, the Concurrency Workbench of the New Century (CWBNC) [4 6] and PIOATool [9, 12] The goal of this project is to build a new tool combining support for checking both correctness and performance properties of system models. The two tools in question have the following characteristics. The CWB NC is a retargetable tool that implements a number of ....

R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A semantics-based tool for the verification of finite-state systems. ACM TOPLAS, 15(1):36--72, Jan. 1993.

No context found.

R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent Systems. ACM Transactions on Programming Languages and Systems, 15(1):36--72, January 1993.

No context found.

Rance Cleaveland, Joachim Parrow, and Bernhard Steen. The concurrency workbench: A semantics-based tool for the veri cation of concurrent systems. ACM Transactions on Programming Languages and Systems, 15(1):36-72, January 1993.

No context found.

R. Cleaveland, J. Parrow, and B. Ste#en. The Concurrency Workbench: a semantics-based tool for the verification of concurrent systems. In ACM TOPLAS, vol. 15(1), ACM Press, pp. 36-72, 1993.

No context found.

Cleaveland, R., J. Parrow and B. Steen (1989). The Concurrency Workbench: A Semantics Based Tool for the Veri cation of Concurrent Systems. Technical Report ECS-LFCS-89-83. University of Edinburgh.

No context found.

R. Cleaveland, J. Parrow, and B. Ste#en. The Concurrency Workbench: a semantics-based tool for the verification of concurrent systems. In ACM Transactions on Programming Languages and Systems, vol.15(1), ACM Press, pp. 36-72, 1993.

No context found.

R. Cleaveland, J. Parrow, and B. Ste#en. The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent Systems. ACM Transactions on Programming Languages and Systems, 15(1), 1993.

No context found.

R Cleaveland, J Parrow, and B Steffen. The concurrency workbench: A semantics-based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 15(1):36--72, January 1993.

No context found.

R Cleaveland, J Parrow, and B Steffen. The concurrency workbench: A semantics-based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 15(1):36--72, January 1993.

No context found.

R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A semantics based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 15(1):36--72, 1993.

No context found.

R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 15(1):36--72, January 1993.

No context found.

R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A Semantics Based Tool for the Verification of Concurrent Systems. ACM Transactions on Programming Languages and Systems, 15(1):36--72, 1993.

No context found.

R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A semantics based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 15(1):36--72, 1993.

No context found.

R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 15(1):36--72, January 1993.

No context found.

R. Cleaveland, J. Parrow, and B. Ste#en. The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent Systems. ACM Transactions on Programming Languages and Systems, 15(1), 1993.

No context found.

Cleaveland, R.; Parrow, J.; Steffen, B.: The concurrency workbench: A semantics-based tool for verification of concurrent systems. ACM Trans. on Prog. Lang. and Sys., 15(1):36-72, Jan. 1993

No context found.

R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 1(15):36--72, 1993.

No context found.

Cleaveland, R.; Parrow, J.; Steffen, B.: The concurrency workbench: A semantics-based tool for verification of concurrent systems. ACM Trans. on Prog. Lang. and Sys., 15(1):36-72, Jan. 1993

No context found.

R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 1(15):36--72, 1993.

No context found.

R.J. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: a semantics-based tool for the verification of finite-state systems. ACM Transactions on Programming Languages and Systems, 15(1):36--72, 1993.

No context found.

R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A semantics based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 15(1):36--72, 1993.

No context found.

R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A semantics based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 15(1):36--72, 1993.

No context found.

R Cleaveland, J Parrow, and B Steffen. The concurrency workbench: A semantics-based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 15(1):36--72, January 1993.

No context found.

R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench : A Semantics Based Tool for the Verification of Concurrent Systems. Research report, University of Edinburgh, February 1992.

No context found.

R. Cleaveland, J. Parrow and B. Steffen, The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent Systems, ACM Transactions on Programming Languages and Systems, Vol. 15, No. 1, pp. 36-72, 93b.

No context found.

R. Cleaveland, J. Parrow, and B. Steen. The concurrency workbench: A semantics-based tool for the veri cation of concurrent systems. ACM Trans. on Programming Languages and Systems, 15:36-72, 1993.

No context found.

R. Cleaveland, J. Parrow, and B. U. Steen. The concurrency workbench: A semantics-based tool for the veri cation of concurrent systems. ACM TOPLAS, 15(1), 1993.

No context found.

R. Cleaveland, J. Parrow, and B. Steen. The Concurrency Workbench: A semantics-based tool for the veri cation of nite-state systems. ACM Transactions on Programming Languages and Systems, 15(1):36-72, January 1993.

No context found.

R. Cleaveland, J. Parrow, and B. Ste#en. The Concurrency Workbench: A Semantics Based Tool for the Verification of Concurrent Systems. ACM Transactions on Programming Languages and Systems, 15(1):36--72, 1993.

No context found.

R. Cleaveland, J. Parrow, and B. Ste#en. The concurrency workbench: A semantics-based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems (TOPLAS), 15(1):36--72, 1993.

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