Z. Manna and P. Wolper. Synthesis of Communicating Processes from Temporal Logic Specifications. ACM Trans. Program. Lang. Syst., 6(1):68--93, 1984.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....simple: for example, it cannot impose global constraints on a solution and modules do not have operational semantics. This simplicity makes automation in the large possible. 16, 11] propose the tool Metaframe, based on linear temporal logic and using a variant of the synthesis algorithm of [10] (of exponential worst case complexity) The major di#erence with our framework is that they build only linear compositions (i.e. chains) rather than general graphs, as we do. Other di#erences are that in Metaframe, all possible solutions can be obtained, whereas in our case, we obtain only one ....

...., q) X C (3) The last element we need is a set of constraints on how many instances of a module type we can have. We formalize that as a function N inst : M # , where is the set of module types and for each module type A in N inst (A) is an interval. For example, if N inst (A) [1, 10], this means that at most 10 instances of A are available and at least 1 instance should be used, whereas if N inst (A) N , then an arbitrary number of instances of A can be used, possibly none. We say that a set of module instances respects N inst if for each module type A, if nA is the ....

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM TOPLAS, 6(1), January 1984.

....the tasks over which those dependences are defined. That is, the precise transitions for a task s state transition diagram do not affect the representations of the different dependencies. As a result, our procedure generates an open system. By contrast, traditional temporal logic synthesis methods [13, 27] require a specification of the entire system. Thus their results have to be recomputed whenever the system is modified. Our synthesis procedure also takes the event attributes into account. However, this aspect has not yet been fully formalized and its details remain beyond the scope of the ....

Z. Manna and P. Wolper, "Synthesis of Communicating Processes from Temporal Logic Specifications," ACM Transactions on Programming Languages and Systems, vol. 6, no. 1, pp. 68--93, January 1984.

....of our tool in Section 5 along the lines of the motivating example for Cadweld [4] This allows a direct comparison with the most similar approach. A more detailed discussion of related work can be found in [1,13] Our synthesis component works by model construction roughly along the lines of [9]. In general global constraints lead to an exponential worst case complexity, which is not surprising for a global search problem. However, as confirmed by our experience in a joint project with Siemens Nixdorf, typical specifications consist of a number of well defined subgoals which must be met ....

....which is defined as follows: Definition 1 (SLTL) The syntax of Semantic Linear Time Temporal Logic (SLTL) is given by: # : tt type(t c ) # m c # G# #U# where t c and m c represent type and module constraints, respectively. The logic can be regarded as a variant of PTL [9] or a linear time variant of CTL [5] The predicate semantic accounts for the fact that atomic propositions and actions are interpreted over their own logics. SLTL formulas are interpreted over the set of all finite legal design plans, i.e. all the sequences of design tasks where the output ....

Z.Manna,P.Wolper:"Synthesis of Communicating Processes from Temporal Logic Specifications," ACM TOPLAS Vol.6, N.1, Jan. 1984, pp.68-93.

.... It is known that Buchi # QLTL [1] and Rabin k # QCTL # k [7] By applying Theorem 11, we have that Buchi(Rabin k ) QLTL(QCTL # k ) It follows that QLTL(QCTL # k ) is expressively equivalent to MSO# [ 1 , 2 , succ i ) i=0 , 1] Since QLTL and QCTL # k are nonelementarily decidable [1, 33], by Corollary 12, we have that QLTL(QCTL # k ) is nonelementarily decidable. Let EQLTL be the fragment of QLTL consisting of formulas of the form 1 . n #, where # is a PLTL formula. Similarly, we define EQCTL # k . It is easy to show that Buchi # EQLTL, and thus EQLTL # QLTL. Similarly, ....

P. Wolper. Synthesis of Communicating Processes from Temporal Logic Specifications. PhD thesis, Standford University, Palo Alto, CA, 1982.

....the two priority schemes. The major drawback of using Mona is that the automata generated do not have acceptance conditions for infinite executions. This makes specifying liveness conditions di#cult. Traditionally, synthesis was intended for generating complete systems from a specification [118] and not a component as presented in Chapter 13. Since simple parts of the code are easier to write by hand than to specify, we think it makes sense to combine handwritten code with synthesized code. Synthesis based on automata has been studied widely, and [131] gives an overview of the area. In ....

....to minimal deterministic automata (MDFA) accepting the language specified by the formula. The automata generated do not contain any acceptance condition for infinite executions so we will only be considering safety The method we study here is a variation of classical synthesis as described in e.g. [118, 131], in that the method is partly based on an existing control program. The aim of the synthesis described here is to restrict the behavior of an existing (hopefully very simple) control program such that it satisfies certain properties given by the user. The executions of the existing control ....

Z. Manna and A. Pnueli. Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6(1):68--93, January 1984.

....several decision problems for agent design, and closely related problems have also been studied in the computer science literature. Perhaps the closest to our view is the work of Manna, Pnueli, Wolper, and colleagues on the automatic synthesis of systems from temporal logic specifications [4, 11, 13]. In this work, tasks are specified as formulae of temporal logic, and constructive proof methods for temporal logic are used to construct model like structures for these formulae, from which the desired system can then be extracted. In artificial intelligence, the planning problem is most ....

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6(1):68--93, January 1984.

....(iii) More work on formalising the re nement with silent actions, particlarly those with meaningful semantic interpretation, would be needed for step (ii) Furthermore, the use of state graphs as an initial speci cation language is not necessarily the best option. Temporal logic based techniques [10, 11] may merit further investigation. 2 De nition of the basic Signal The basic Signal protocol speci es an ACM with capacity 1, re reading not permitted and overwriting permitted. In other words, writing can happen when the Signal contains either 0 or 1 item of unread data. A write data access ....

Manna, Z. and Wolper P., Synthesis of communicating processes from Temporal Logic speci- cations, ACM Transactions on Programming Languages and Systems, Vol.6, No.1, pp.68-93, January 1984.

....dining philosophers that refers to a single process is not of much interest. There are two possible ways to approach the synthesis problem for distributed systems. One approach is to use a synthesis procedure for a single process, and then decompose the process according to the given architecture [EC82, MW84]. While this approach has a computational advantage, known decomposition algorithms are not complete in the sense that a speci cation may be realizable with respect to a given architecture yet the decomposition algorithm would fail [PR90] Thus, one can view decomposition as a heuristic for the ....

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic speci- cations. ACM TOPLAS, 6(1):68-93, January 1984.

....variants of MetricIntervalTL should be explored. However, completeness is often lost in firstorder variants [23] ffl The development of programs from specifications should be supported: the automaton produced by the proposed technique might be helpful as a program skeleton in the style of [24]. 35 ....

P. Wolper. Synthesis of Communicating Processes from Temporal-Logic Specifications. PhD thesis, Stanford University, 1982. 37

....produces an infinite sequence of events. A property of a reactive system, then, is an language containing the infinite event sequences that satisfy the property. There is a very pleasant expressive equivalence between modal logics, classical logics, and finite automata for defining languages [Buc62,Kam68,GPSS80,Wol82]. Let TL stand for the propositional linear temporal logic with next and until operators, and let Q TL and E TL stand for the extensions of TL with propositional quantifiers and grammar (or automata) connectives, respectively. Let ML 1 and ML 2 stand for the first order and second order monadic ....

P.L. Wolper. Synthesis of Communicating Processes from Temporal Logic Specifications. PhD thesis, Stanford University, 1982.

....unit) or some other internal actions of the environment. Based on this definition, we construct universal stubs and drivers that represent all possible sequences of actions. When LTL local assumptions are available, we can synthesize refined models of environments, using tableau like methods [21, 13]. A local assumption describes the temporal relations assumed to exist among the executions of the interface operations of the unit, invoked by one particular environment. We assume that the parameters in unit calls have been abstracted to finite domains; Section 4 discusses how this is achieved. ....

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic. ACM Transactions on Programming Languages and Systems (TOPLAS), 6(1):68-93, 1984.

.... 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 temporal logic. These constraints capture the following significant classes of ....

....and conditional occurrence. ffl It transforms an SLTL specification automatically into a set of linear sequences of PM components by means of a minimal model generator for the underlying modal logic (cf. 24] The algorithm, which works by model construction roughly along the lines of [20], determines the set of all legal compositions satisfying the constraints based on the underlying repository. ffl It visualizes the solutions graphically by a solution graph: each path from the start to the success node represents a solution. ffl It supports the investigation of the complete set ....

Z. Manna, P. Wolper: "Synthesis of Communicating Processes from Temporal Logic Specifications ", ACM TOPLAS Vol.6, N.1, Jan. 1984, pp.68-93.

....to fill in the gap between specification and operational semantics. We provide a constructive method to obtain the operational semantics of a system specified through temporal logic by means of a tableaux like method based on the decision procedure for temporal logic satisfiability described in [4, 25]. Note that fairness or liveness properties can be specified, having an operational counterpart reflected on the acceptance condition of the obtained automaton. We point out how the results can be useful in monitoring applications and compare with related work. Through the paper, we assume that ....

....satisfy the specification. The synthesis algorithm here presented capitalises on the results obtained in [5] and consists of an adapted and extended version of the tableaux based decision procedure for temporal logic presented in [4] and, more specifically, of the synthesis method proposed in [25]. We start by introducing the envisaged tableaux system [3] for the temporal logic we are using. 4.1 Tableaux for temporal logic A tableau is a finite tree to whose nodes are associated sets of formulae. Given a certain set of tree formation (inference) rules and a set of formulae we can build ....

[Article contains additional citation context not shown here]

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6(1), pages 68--93, 1984.

....logic specifications. Manna and Wolper present an algorithm that takes as input a linear time temporal logic specification of the synchronization part of a concurrent system, and generates as output a program skeleton (based upon Hoare s CSP formalism [33] that realizes the specification [52]. The idea is that the functionality of a concurrent system can generally be divided into two parts: a functional part, which actually performs the required computation in the program, and a synchronization part, which ensures that the system components cooperate in the correct way. For example, ....

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6(1):68--93, January 1984.

....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 satisfiability algorithm which ....

Z. Manna and P. Wolper, "Synthesis of Communicating Processes from Temporal Logic Specifications", ACM Transactions on Programming Languages and Systems, volume 6, number 1, January 1984, pp. 68--93.

....that a given finite state program M meets a specification p formulated in temporal logic, using a model checking algorithm (cf. CE81] QS82] CES86] Ku94] 2. Mechanical synthesis of a program M meeting a temporal specification p using a decision procedure for testing satisfiability (cf. [EC82, MW84, PR89]) 3. Executable temporal logic specifications. This approach [BFGGO89] may be viewed as an elegant variation of the synthesis approach. While synthesis might be seen as a process of compiling temporal logic specifications, in contrast, this approach amounts to interpreting the specifications ....

Manna, Z. and Wolper, P. L., Synthesis of Communicating Processes from Temporal Logic Specifications, vol. 6, no. 1, pp. 68-93, Jan. 84.

....6 Related Work Previous work [7 9] on program synthesis has addressed the problem of synthesizing a program that satis es a given speci cation. These synthesis algorithms are based on the decision procedure for testing temporal satis ability proposed by Emerson and Clarke [7] and Manna and Wolper [8]. Previous work on synthesizing fault tolerant programs includes [9 12] In [9, 12] the authors assume that the fault cannot a ect the internal state of a process; the fault can interact only through input and output signals. By way of contrast [11] and this paper permits a more general model of ....

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specications. ACM Transactions on Programming Languages and Systems, 6:68-93, 1984.

....or CIRCAL[8] is also good for control structures, but it does not support negation and declarative expressions (like sometime or always) which are common to Temporal Logic. In this paper, we show an implementation of interval temporal logic theorem prover. This method is a tableau driven method[12, 14] and a practical implementation of [5, 7] It also generates a deterministic state diagram as a verification result. We have developped first order Interval Temporal Logic interpreter using a kind of clausal form. It is easy to combine the result of verification and the interpreter, since the ....

.... 1: Real time Task Combination ( T proj (length(5) 2(c) length(15) T ) length(3) proj 3(a) T) less(3) length(5) proj 3(b) T) less(5) 2( a b) 2( b c) 2( c a) 2 Verification Methods To verify a temporal logic, several methods are known such as the Tableau Method [14], Finite Automaton Generation [2] and Model Checking[10, 4] Local ITL is also known to be decidable [11] using conversion to Quantified Linear Time Temporal Logic. However, this conversion generates one extra variable for each operator which makes verification space time hard. It also ....

[Article contains additional citation context not shown here]

P. Wolper. Synthesis of communicating processes from temporal logic specifications. Technical Report STAN-CS-82-925, Stanford University, 1982. 16

....of the system from the perspective of another part. But, their application presupposes such a decomposition. Thus, the global logics seem more appropriate do define a system. Given a temporal logic specification one can use tableau method to derive the corresponding synchronization skeleton, cf. [6,9], i.e. a transition system that realizes the specification. Thus, we can safely assume that the reactive system is already given in the form of a transition system S = #S, s, #, T #. Now, the task is to find as concurrent a realization as possible. Luckily, there is a way to turn S into ....

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, vol. 6(1): pp. 68--93, 1984.

....constraints can be expressed by temporal logic formulae which are interpreted just in such state sequences. Temporal logic is an extension of classic predicate logic by temporal quantifiers and operators like always , sometime , next , etc. It has primarily been used for program verification [MaP81, Wo83, MaW84, ClES86, Kr87], but has also been applied to database specifications by many authors in the last decade [Se80, CaCF82, EhLG84, Ku84, LiEG85, CaS87, LiS87, FiS88, Li90, Sa91] 1 Temporal formulae, however, usually are interpreted in infinite state sequences. Since in practice only a partial, finite prefix of ....

Manna, Z. and Wolper, P.: Synthesis of Communicating Processes from Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems, Vol. 6 (1984), 68--93.

....happens can be expressed by formulae of the type G#, and simple liveness properties # eventually happens by formulae of the type F#. However, there are some rather straightforward properties that cannot be expressed in terms of the until and nexttime operators, for example at every even moment # [102]. Because of this, various more expressive formalisms have been studied, most notably Wolper s extended temporal logic ETL [102, 103] and the linear time mu calculus. Wolper s ETL is based on an infinite family of temporal operators, one corresponding to each regular grammar. The linear time ....

....F#. However, there are some rather straightforward properties that cannot be expressed in terms of the until and nexttime operators, for example at every even moment # [102] Because of this, various more expressive formalisms have been studied, most notably Wolper s extended temporal logic ETL [102, 103], and the linear time mu calculus. Wolper s ETL is based on an infinite family of temporal operators, one corresponding to each regular grammar. The linear time mu calculus was first introduced by Barringer, Kuiper and Pnueli in [7, 8, 9] to define temporal semantics for recursive procedures. It ....

Wolper, P.: Synthesis of Communicating Processes from Temporal Logic Specifications, PhD thesis, Stanford University, 1982

....the set of sequences satisfying the formula . Claim 1 A state sequence oe satisfies the temporal formula iff oe is an X variant of a computation of Pi . Proof (sketch) Obviously, a tester is nothing more than a symbolic version of the construction of a temporal tableau (e.g. see [MW84] LP85] MP95] Therefore, most of the necessary justification of Claim 1 can be taken from these papers. Here, we would only like to elaborate on the salient point of the symbolic representation of the tester as consisting of several boolean variables, each representing one of the principally ....

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Trans. Prog. Lang. Sys., 6:68--93, 1984.

....produces an infinite sequence of events. A property of a reactive system, then, is an language containing the infinite event sequences that satisfy the property. There is a very pleasant expressive equivalence between modal logics, classical logics, and finite automata for defining languages [Kam68, GPSS80, Wol82]. Let TL stand for the propositional linear temporal logic with next and until operators, and let Q TL and E TL stand for the extensions of TL with propositional quantifiers and grammar (or automata) connectives, respectively. Let ML 1 and ML 2 stand for the first order and second order monadic ....

Pierre Leon Wolper. Synthesis of Communicating Processes from Temporal Logic Specifications. PhD thesis, Stanford, 1982. 14

....all that necessary. First, one can check whether A accepts some word to determine whether is satisfiable [SVW85,WVS83] This gives us a decision procedure for satisfiability that runs in polynomial space. Secondly, one can view A as a synthesized program that implements the specification [MW84]. Thirdly, given a finite state program P , one can combine P with A and then check whether P satisfies by a reachability analysis of the combined program [Va85,VW86] Finally, given a program P one can use A to derive proof obligations that when checked will guarantee the correctness of P ....

Manna, Z., Wolper, P.: Synthesis of communicating processes from temporal logic specifications. ACM Trans. on Programming Languages, 1984, pp. 68--93.

.... the complexities of the model checking and the satisfiability problems for the logic CTL are significantly higher than these for its less expressive subset CTL [SC85, VS85] Similarly, while the containment problem for DBW can be solved in NLOGSPACE [WVS83, Kur87] it is PSPACE complete for BW [Wol82]. Finally, while the complexity of the nonemptiness problem for BT can be solved in quadratic time [VW86b] it is NP complete for RT [Eme85, VS85, EJ88] The interested readers can find more examples in [Eme90, Tho90] In the automata theoretic approach to verification, we translate ....

P. Wolper. Synthesis of Communicating Processes from Temporal Logic Specifications. PhD thesis, Stanford University, 1982.

....data structures such as integers, lists and trees. Deductive frameworks and tools play a large role in this task [MW92, SWL 94] Reactive synthesis focuses on obtaining a program that satisfies a desired temporal specification, that is, which guarantees some ongoing behavior over time [Wol82, PR89] This synthesis task has relied mostly on automatatheoretic tools for the algorithmic, automatic synthesis of finite state programs. It has also given rise to the (algorithmic) model checking approach to verification [CE81] Recent work in our group [AM94, Anu95] has identified different ....

P. Wolper. Synthesis of Communicating Processes from Temporal-Logic Specifications. PhD thesis, Stanford University, 1982. 3

....unit) or some other internal actions of the environment. Based on this definition, we construct universal stubs and drivers that represent all possible sequences of actions. When LTL local assumptions are available, we can synthesize refined models of environments, using tableau like methods [21, 13]. A local assumption describes the temporal relations assumed to exist among the executions of the interface operations of the unit, invoked by one particular environment. We assume that the parameters in unit calls have been abstracted to finite domains; Section 4 discusses how this is achieved. ....

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic. ACM Transactions on Programming Languages and Systems (TOPLAS), 6(1):68-93, 1984.

....concurrent system skeletons from temporal logic specifications. Manna and Wolper present an algorithm that takes as input a linear time temporal logic specification of the synchronization part of a concurrent system, and generates as output a program skeleton that realizes the specification [13]. Similar work is reported by Clarke and Emerson [5] who synthesize synchronization skeletons from branching time temporal logic (CTL) specifications. In artificial intelligence, the planning problem is most closely related to our achievement based task environments [1] STRIPS was the archetypal ....

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6(1):68--93, Jan. 1984.

....interactions with its environment. Therefore it is necessary for realizability[1] 2] of its specification that the reactive system can keep reacting correctly to any kind of its environment behavior. Temporal logics have been studied as a language for describing reactive system specifications[3][4] and a realizability judgment method for temporal specifications and a program construction method from realizable specifications is found in [5] As for un realizable and satisfiable specifications, three interesting properties of them are introduced in [6] e.g. strong satisfiability, stepwise ....

Z.Manna, P.Wolper, Synthesis of Communicating processes from Temporal Logic Specifications, ACM Trans. Programming Languages and Systems 6(1) (1984) 68-93.

....temporal logic can be translated to the rst order theory of one successor and hence to in nite word automata. From a logician s point of view, this could be seen as settling the question, but an interest in using temporal logic for computer science applications, in particular program synthesis [MW84,EC82] triggered a second look at the problem. Indeed, it was rather obvious that a nonelementary construction was not necessary to build an automaton from a temporal logic formula; it could be done within a single exponential by a direct construction [WVS83,VW94] As originally presented, this This ....

Zohar Manna and Pierre Wolper. Synthesis of communicating processes from temporal logic speci cations. ACM Transactions on Programming Languages and Systems, 6(1):68-93, January 1984.

....temporal logic can be translated to the first order theory of one successor and hence to infinite word automata. From a logician s point of view, this could be seen as settling the question, but an interest in using temporal logic for computer science applications, in particular program synthesis [MW84, EC82] triggered a second look at the problem. Indeed, it was quite obvious that a nonelementary construction was not necessary to build an automaton from a temporal logic formula; it could be done within a single exponential by a direct construction [WVS83, VW94] As originally presented, this ....

Zohar Manna and Pierre Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6(1):68--93, January 1984.

No context found.

Z. Manna and P. Wolper. Synthesis of Communicating Processes from Temporal Logic Specifications. ACM Trans. Program. Lang. Syst., 6(1):68--93, 1984.

No context found.

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic. ACM Transactions on Programming Languages and Systems (TOPLAS), 6(1):68--93, 1984.

No context found.

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic. ACM TOPLAS 6(1) (1984) 68--93.

No context found.

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6:68--93, 1984.

No context found.

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic. ACM Transactions on Programming Languages and Systems (TOPLAS), 6(1) (1984) 68--93.

No context found.

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic. ACM Transactions on Programming Languages and Systems (TOPLAS), 6(1) (1984) 68-93.

No context found.

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6:68--93, 1984.

No context found.

P. Wolper. Synthesis of Communicating Processes from Temporal-Logic Specifications. PhD thesis, Stanford University, 1982.

No context found.

P. Wolper. Synthesis of Communicating Processes from Temporal Logic Specifications. PhD thesis, Stanford University, 1982.

No context found.

P. Wolper and Z. Manna. Synthesis of communicating processes from temporal logic specifications. In Proceedings of the 1981.

No context found.

P. Wolper. Synthesis of Communicating Processes from Temporal Logic Speci cations. PhD thesis, Stanford University, 1982.

No context found.

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM TOPLAS, 6(1):68--93, January 1984.

No context found.

P. Wolper. Synthesis of Communicating Processes from Temporal Logic Specifications. PhD thesis, Stanford University, Dpeartment of Computer Science, 1982. 17

No context found.

Wolper, P. Synthesis of Communicating Processes From Temporal Logic Specifications, unpublished manuscript, Stanford University, 1981.

No context found.

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Trans. Program. Lang. and Syst., 6(1):68--93, 1984.

No context found.

Manna, Z., Wolper, P.: Synthesis of communicating processes from temporal logic specifications. Proc. Logics of Programs, 253--281, 1981.

No context found.

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM TOPLAS, 6(1):68--93, January 1984.

No context found.

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specications. ACM Transactions on Programming Languages and Systems, 6:68-93, 1984.

No context found.

Wolper, P., Synthesis of Communicating Processes from Temporal Logic Specifications, Ph.D. Thesis, Stanford Univ., 1982.

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