E. Madelaine. Verification tools from the concur project. EATCS Bull., 47, 1992.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....by: d 2i = n 2i . d 2i 1 = n 2i 1 4. Comparison with existing work There is one file format, known to the author of the current report, that directly competes with the svc format: the bcg format. There are other file formats for labeled transition systems, for instance fc2 [12] and psf [13] but these do not strive for compactness, the central feature of svc. However, it is useful to compare the svc compression scheme with other schemes, in order to assess the svc compression rate. The svc compression is compared with the following compression schemes: binary ATerm ....

Madelaine, E. Verification tools from the Concur project. EATCS Bulletin 47 (1992).

....of behavioural equivalences, or in the design of automated tools for checking bisimilarity. More specifically, even if the calculus generalizes CCS [Mil89] and related static process calculi) the semantic based verification tools developed for static process calculi (e.g. CPS93] we refer to [IP91, Mad92] for a survey) cannot be directly re used for the calculus, and, up to now, the only available verification tool [VM94] decides a bisimulation equivalence which is rather strong [San93] In [FMQ94, FMQ95] an alternative formulation the calculus operational semantics has been proposed. There, ....

E. Madelaine. Verification Tools from the CONCUR Project. Bulletin EATCS 47, 1992.

.... For finite state systems all studied equivalences are known to be decidable, and sound and complete equational theories exist for various of these, see e.g. Sal66, Mil84, Koz91, Rab92] Furthermore, several automated tools have been designed for the analysis of finitestate systems (see e.g. [Mad92]) In fact, the theory of finite state systems and their equivalences can now be said to be well established. One may be led to wonder what the results will look like for infinite state systems. A major issue of pragmatic importance is that of providing decision algorithms for the various ....

E. Madelaine. Verification tools from the CONCUR project. Bulletin of the EATCS, 47, pp 110--126, June 1992.

....development process, such as rewriting techniques, behavioural equivalence proofs, graph transformations, and (ACTL) logic verification. In JACK a particular description format is used to represent TSs, the so called format commun fc2, that has been proposed as standard format for automata [18]. The ACTL model checker was built on the basis of an algorithm similar to that of the EMC model checker [5] so it guarantees model checking of an ACTL formula on a TS in a linear time complexity [10] The JACK environment has been extended with a tool to build the chain fN i (p)g. We now ....

E. Madelaine. Verification Tools from the Concur Project. Bulletin of EATCS 47, 1992, pp. 110-120.

.... CCS [10] Each approach has added to more than a decade of fruitful discoveries on the mathematical foundations of concurrent processes, so that now it is the case that these theories can be applied in practice, perhaps using automated tools of which there are many; for a useful survey see [9]. Certainly, as systems become more complex, it becomes necessary to invoke the use of automated tools to aid in their analyses. These tools however exploit the fact that properties of finite state systems are decidable, and hence they cannot be used except for this simple class of systems. A ....

E. Madelaine. Verification tools from the CONCUR project. Bulletin of the European Association of Theoretical Computer Science 47, pp110--126, June 1992.

....development process, such as rewriting techniques, behavioural equivalence proofs, graph transformations, and (ACTL) logic verification. In JACK a particular description format is used to represent TSs, the so called format commun fc2, that has been proposed as standard format for automata [27]. The ACTL model checker was built on the basis of an algorithm similar to that of the EMC model checker [7] so it guarantees model checking of an ACTL formula on a TS in a linear time complexity [15] rec.fXg. g1.nil X) rec.fXg. g2.nil X) p2 p1 x R Gamma Gamma Gamma Gamma Psi ....

E. Madelaine. Verification Tools from the Concur Project. Bulletin of EATCS 47, 1992, pp. 110-120.

....development process, such as rewriting techniques, behavioural equivalence proofs, graph transformations, and (ACTL) logic verification. In JACK a particular description format is used to represent TSs, the so called format commun fc2, that has been proposed as standard format for automata [20]. The ACTL model checker was built on the basis of an algorithm similar to that of the EMC model checker [5] so it guarantees model checking of an ACTL formula on a TS in a linear time complexity [10] The JACK environment has been extended with a tool to build the chain fN i (p)g. We now ....

E. Madelaine. Verification Tools from the Concur Project. Bulletin of EATCS 47, 1992, pp. 110-120.

.... CCS [Mil89] Each approach has added to more than a decade of fruitful discoveries on the mathematical foundations of concurrent processes, so that now it is the case that these theories can be applied in practice, perhaps using automated tools of which there are many; for a useful survey see [Mad92]. Certainly, as systems become more complex, it becomes necessary to invoke the use of automated tools to aid in their analyses. These tools however exploit the fact that properties of finite state systems are decidable, and hence they cannot be used except for this simple class of systems. A ....

E. Madelaine. Verification tools from the CONCUR project. Bulletin of the European Association of Theoretical Computer Science 47, pp110--126, June 1992.

....by a process has a number of states that is exponential with respect to the number of actions that appear in it. This is called the state explosion problem and it is a major impediment for a mechanical verification of processes, commonly checked on labelled transition systems (for a survey, see [21, 24, 25]) The state explosion problem is essentially due to the assumption that concurrent events are represented in transition systems through their interleavings. Some attempts to overcome this problem have been presented in the literature. All of them exploit a relation of concurrency (temporal and ....

E. Madelaine. Verification tools from the CONCUR project. Bullettin of EATCS 47, 1992.

No context found.

E. Madelaine. Verification tools from the concur project. EATCS Bull., 47, 1992.

No context found.

E. Madelaine. Verification tools from the concur project. EATCS Bull., 47, 1992.

....safety properties is in some sense dual to testing: you can use it to guaranty that a bad event cannot occur, while testing eventually shows that a good event can occur. 3 Verification tools in lite A number of tools for automata analysis have been developed recently by research labs (see e.g. [14]) We have integrated in lite: ffl Auto, for the efficient construction and analysis of automata. ffl AutoGraph, for the graphical display of automata. ffl A model checker based on EMC [4] for fast checking of temporal logic formulas ffl A tool producing an ascii representation of automata, ....

....[9] 3.4 Using other verification tools There exists a number of verification tools, developed by research groups, that offer other analysis functions, and that one may want to exercise on one s specifications. We made this possible by defining an ascii representation of automata named FC2 [14] and providing functions in lite that produce such a representation. There are indeed two functions in sl lite that produce automata in this format; you can use the simulator smile to produce an Extended Finite State Machine and represent this EFSM in FC2; or you can compute a Basic Lotos ....

[Article contains additional citation context not shown here]

E. Madelaine. Verification tools from the CONCUR project. Bulletin of the EATCS, 47:110--127, 1992.

No context found.

E. Madelaine. Verification Tools from the CONCUR Project. EATCS Bulletin, 47, 1992.

No context found.

E. Madelaine. Verification Tools from the CONCUR Project. EATCS Bulletin, 47, 1992.

No context found.

E. Madelaine. Verification tools from the Concur project. EATCS Bulletin, 47, 1992.

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