Cleaveland, R. and B. Steffen. "Computing Behavioural Relations, Logically." In Proceedings ICALP '91, 1991.  Home/Search   Document Details and Download   Summary   Related Articles   Check

No context found.

Cleaveland, R. and B. Steffen. "Computing Behavioural Relations, Logically." In Proceedings ICALP '91, 1991.

....of verifying for every step in a process model whether it violates the given global constraints. On the other hand temporal logics have been successfully introduced in various areas of computer science in order to specify and automatically verify abstract global properties of finite state systems [19, 5, 18, 32, 25, 9, 6, 33, 26]. Less frequent is their application as a basis for synthesis problems [20, 8] In this paper we present PM MetaFrame, a tool tailored for the automatic synthesis of linear 1 sequences of process model (PM) components from temporal constraints that can be expressed by means of linear time ....

R. Cleaveland, B. Steffen: "Computing Behavioural Relations, Logically", Proceedings ICALP '91, Int. Colloquium on Automata, Languages and Programming, 1991.

....a derivative having n 0 in its annotation; otherwise, n is deleted from the annotation as well. The time and space complexities of this algorithm are O(k 4 ) and O(k 2 ) respectively, where k is the number of states, and is the number of transitions, in the two transition graphs. In [16] an algorithm is proposed whose worst case time complexity is O( 2 ) The implementation of this algorithm is underway. The loss of efficiency compared with the equivalence algorithm is due to the fact that we cannot use the same compact representation of behavioral relations as in Section ....

....could be improved, in particular since the implementation language of the system (Standard ML) now supports more constructs for efficient programming (e.g. bit arrays) than was the case when the core of the system was implemented. In addition, more efficient algorithms for preorder checking [16] and model checking [17] have been discovered, and these should be implemented in the system. Another area of investigation would involve developing techniques for reducing the size of transition graphs that the system computes when verification routines are invoked. One promising approach is to ....

Cleaveland, R. and B. Steffen. "Computing Behavioural Relations, Logically." In Proceedings International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science 510, Springer-Verlag, Berlin, 1991.

....of the system s representation and exponential in the size of the property being investigated. 1 Introduction Model checking provides a powerful tool for the automatic verification of behavioural systems. The corresponding standard algorithms fall into two classes: the iterative algorithms (cf. [EL,CES,CS1,CS2]) and the tableaux based algorithms (cf. e.g. Bra,C,La,SW,Wi] Whereas the former class usually yields higher efficiency, the latter allows local model checking (cf. SW] This observation has been exploited by Bradfield [Bra] for the automatic verification of infinite state systems for a ....

.... Properties The logic we consider may be viewed as a variant of the modal mu calculus [Ko] or the Hennessy Milner Logic with recursion [La] For technical reasons, however, we represent the formula to be investigated by means of a hierarchical system of (mutually recursive) equations (cf. [CS1,CS2]) This logic is as expressive as the alternation free modal mu calculus, see Section 3.4. 3.1 Syntax and Semantics of Basic Formulas Let Var be a (countable) set of variables, A a set of atomic propositions, and Act a set of actions. In what follows, X will range over Var, A over A, and a over ....

Cleaveland, R. and B. Steffen. "Computing Behavioural Relations, Logically." In Proceedings ICALP '91, 1991.

....the strongly connected components of the dependence graph. Of course, these constraints form in general a DAG structure. However, as in the hierarchical case, we can simply collapse this DAG to a list without runtime penalty. 2 This choice is an elaboration of the block graphs presented in [ClSt91b, ClKS92]. ffl The DAG structure reflects part of the ordering constraints within a strongly connected component: a constraint between two equations e 1 and e 2 is only kept if the row of e 1 precedes the row of e 2 in the value array. This DAG of equations is then collapsed by combining all equations ....

....is steered by a worklist that contains references to all the components whose counters are currently known to require decrement. The worklist is updated by adding references to all influenced components, whenever one counter became zero, which indicates a change of its corresponding boolean value [ClSt91, ClSt91b]. Hierarchical Fixpoints: Here, blocks are sequentially computed in the order indicated by the block graph. The fixpoint computation within the blocks is identical to the one in the homogeneous case. It should be noted that the counters for a block must be initialized immediately before its ....

[Article contains additional citation context not shown here]

R. Cleaveland, B. Steffen: "Computing Behavioural Relations, Logically", Proc. ICALP'91, Segovia (Spain), Aug. 1991, LNCS 510, Springer V.

....of methods (cf. 9, 14] and therefore to the need for tools, like the Concurrency Workbench [7, 8] which support all three. Moreover, such combined tools are not necessarily more complex than single purpose tools, as e.g. preorder checking may be efficiently reduced to model checking [10, 22]; the model checking algorithm in [10] leads to the most efficient algorithm known for general preorder checking. In this paper, we extend the algorithm of [10] to deal with a logic whose propositions are defined by least, as well as greatest, fixed points of mutually recursive systems of ....

....to the need for tools, like the Concurrency Workbench [7, 8] which support all three. Moreover, such combined tools are not necessarily more complex than single purpose tools, as e.g. preorder checking may be efficiently reduced to model checking [10, 22] the model checking algorithm in [10] leads to the most efficient algorithm known for general preorder checking. In this paper, we extend the algorithm of [10] to deal with a logic whose propositions are defined by least, as well as greatest, fixed points of mutually recursive systems of equations. Department of Computer Science, ....

[Article contains additional citation context not shown here]

R. Cleaveland and B. Steffen. "Computing Behavioural Relations, Logically." In Proceedings of the Eighteenth International Colloquium on Automata, Lagnages and Programming, Lecture Notes in Computer Science 510:127--138, 1991.

....strict discipline involving backtracking. This observation motivates the structure of our block graphs, which are lists of DAGs 4 (directed acyclic graphs) where edges represent ordering constraints and nodes collect the set 4 This choice is an elaboration of the block graphs presented in [ClSt91b, ClKS92] of all equations which need not be distinguished according to these constraints. This graph structure is already sufficient to uniformly capture even strongly optimized organizations of the fixpoint computation for the alternating case. Technically, the need for blocks, which are collections of ....

....according to ordering constraints is more expensive then the worklist oriented chaotic iteration allowed within a block. Thus efficient fixpoint algorithms will completely determine the fixpoint of a block before taking a switch. This approach is only guaranteed to be optimal when using counters [ClSt91, ClSt91b]. ffl For homogeneous fixpoints, a one component list containing a one element DAG is sufficient, as we are dealing with a single block here where no ordering constraints need to be taken care of. ffl hierarchical fixpoint computations postpone the evaluation of an equation until all equations ....

[Article contains additional citation context not shown here]

R. Cleaveland, B.Steffen: "Computing Behavioural Relations, Logically, " Proc. ICALP'91, Segovia (Spain), Aug. 1991, LNCS N.510, Springer.

No context found.

R. Cleaveland and B. Ste#en. Computing Behavioural relations logically. In proceedings of the 18 International Colloquium on Automata, Languages and Programming, Lecture Notes Computer Science 510, pages 127-138, Springer Verlag, 1991.

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