E. M. Clarke and E. A. Emerson. Synthesis of synchronization skeletons from branching time temporal logic. In Proceedings of the Workshop on Logics of Programs, volume 131, pages 52-71. Springer LNCS, 1982.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Together 153 generally considered infeasible to deal with unorganized descriptions. Structure helps to spot design flaws, but it can also be exploited to make algorithmic treatment more e#cient, or even possible at all. Well known examples for this are model checking problems. Model checking [CE82, CK96, Hol97] is a powerful technique for discovering inconsistencies in high level designs in hardware and communication protocols. Since it typically requires search in the global state space, much research aims at providing heuristics to make this step less time and space consuming. Consider ....

Edmund M. Clarke and E. Allen Emerson. Synthesis of Synchronization Skeletons from Branching Time Temporal Logic. In Proc. Workshop on Logics of Programs, volume 131 of Lecture Notes in Computer Science (LNCS), pages 52--71. Springer--Verlag, 1982. 153

....or shared variables. Typically, the communication structure o#ers asymmetries that can be exploited by means of introducing property preserving abstractions of sub components. Our specific motivation is a safety property preserving optimization of a model checking algorithm. Model checking [CE82, CK96, Hol97] is widely accepted as a useful technique for the formal verification of high level designs in hardware and communication protocols. Since it typically requires search in the global state space, much research aims at providing heuristics to make this step less time and space consuming. Consider 4 ....

E. M. Clarke and E. A. Emerson. Synthesis of synchronization skeletons from branching time temporal logic. Lecture Notes Comp. Sci., 131:52--71, 1982.

....since it is generally considered infeasible to deal with unorganized descriptions. Structure helps to spot design flaws, but it can also be exploited to make algorithmic treatment more e#cient, or even possible at all. Well known examples for this are model checking problems. Model checking [4, 11] is a powerful technique for discovering inconsistencies in high level designs in hardware and communication protocols. Since it typically requires search in the global state space, much research aims at providing heuristics to make this step less time and spaceconsuming. Consider once more ....

Edmund M. Clarke, Jr. and E. Allen Emerson. Synthesis of synchronization skeletons from branching time temporal logic. Lecture Notes Comp. Sci., 131:52--71, 1982.

....since it is generally considered infeasible to deal with unorganized descriptions. Structure helps to spot design flaws, but it can also be exploited to make algorithmic treatment more efficient, or even possible at all. Well known examples for this are model checking problems. Model checking [4,5,12] is a powerful technique for discovering inconsistencies in high level designs in hardware and communication protocols. Since it typically requires search in the global state space, much research aims at providing heuristics to make this step less time and space consuming. Consider once more the ....

Edmund M. Clarke, Jr. and E. Allen Emerson. Synthesis of synchronization skeletons from branching time temporal logic. Lecture Notes Comp. Sci., 131:52--71, 1982.

....the number of processes as well, but only singly exponential in the processes size. Furthermore, if there is any implementation, the algorithms produce one of at most doubly exponential size. Real time implementability and scheduling are also doubly exponential. 2 Background Clarke and Emerson [CE81] and Manna and Wolper [MW84] studied the synthesis of concurrent processes from their logical specifications. They proposed similar design procedures that consisted of the following three steps: first, write the system specification in propositional temporal logic, second, apply a tableau based ....

E.M. Clarke and A.E. Emerson, "Synthesis of synchronization skeletons from branching time temporal logic", in Proceedings of the Workshop on Logics of Programs (YorktownHeights, N.Y.). Lecture Notes in Computer Science, Springer-Verlag, New York, 1981, pp. 52--71.

....Our approach in GenEx is to automate the design of one aspect of the system components, that related to their control behavior. We modify the components to make the system enforce a given set of receptive safety properties. 1.1. 1 System Control, Synchronization and Receptiveness Clarke [EC82, CE82] has shown that properties of the control aspect for many systems are simpler than the properties of their data processing, and that the implementation of these two aspects can be separated. He discussed the generation of synchronization skeletons from temporal descriptions of system behavior. ....

E. M. Clarke and E. A. Emerson. "Synthesis of synchronization skeletons from branching time temporal logic". Lecture Notes Comp. Sci., 131:52--71, 1982.

....there is a simple regular language that requires exponential size to be represented by any BMD, even though BDDs can represent any regular language in linear size. This work was supported by the National Science Foundation under Grant CCR 9303017. 1. Introduction Model checking, proposed in [12], is a verification technique for determining whether a given property expressed as a temporal logic formula is satisfied by a system specification (see [15] for references and a summary of the successes of this technique. One of the major bottlenecks of model checking is the state explosion ....

E. M. Clarke and E. A. Emerson. Synthesis of synchronization skeletons from branching time temporal logic. Lecture Notes Comp. Sci., 131:52--71, 1982.

No context found.

E. M. Clarke and E. A. Emerson. Synthesis of synchronization skeletons from branching time temporal logic. In Proceedings of the Workshop on Logics of Programs, volume 131, pages 52-71. Springer LNCS, 1982.

No context found.

Clarke, E. M. and E. A. Emerson: 1982, `Synthesis of Synchronization Skeletons from Branching Time Temporal Logic'. In: Proceedings of the Workshop on Logics of Programs, Vol. 131. pp. 52--71.

No context found.

E. M. Clarke and E. A. Emerson. Synthesis of synchronization skeletons from branching time temporal logic. In Proceedings of the Workshop on Logics of Programs, volume 131, pages 52-71. Springer LNCS, 1982.

No context found.

E. M. Clarke and E. A. Emerson. Synthesis of synchronization skeletons from branching time temporal logic. In Proceedings of the Workshop on Logics of Programs, volume 131, pages 52-71. Springer LNCS, 1982.

....or all paths emanating from the current instant in time. Moreover, CTL allows the existential and universal quantification of a temporal predicates over paths. 3.5. 2 Model Checking Model checking is a technique for validating finite automata for adherence to constraints phrased in temporal logic[26]. A model checker is a tool which inputs a description of a finite state model and a set of temporal constraints, builds a representation of all executions of this model, exhaustively checks these executions for adherence to the constraints, and reports violations. Model checking has become ....

....from machine x , machine y is prepared for signal resume we need a language which can express constraints over time. The standard way to do this is to use a temporal logic. We want to supply these properties to automated state space analysis tools, and so chose Computation Tree Logic (CTL)[26, 27], as a language for expressing the properties. CTL expressions have three parts: a path quantifier, a temporal quantifier, and a predicate. 102 A path is a sequence of machine states. Different execution orderings yield different paths. Path quantifiers identify whether an invariant should apply ....

E. M. Clarke and E. A. Emerson. Synthesis of synchronization skeletons from branching time temporal logic. In Workshop on Logics of Programs, pages 52--71, 1981.

No context found.

Edmund M. Clarke and E. Allen Emerson. Synthesis of synchronization skeletons from branching time temporal logic. In Proc. Workshop on Logics of Programs, volume 131 of Lecture Notes in Computer Science (LNCS), pages 52--71. Springer--Verlag, 1982.

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