6 citations found. Retrieving documents...
R.J.K. Jacob, "A State Transition Diagram Language for Visual Programming," IEEE Computer, vol. 18, no. 8, pp. 51- 59, 1985.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
DLoVe: Using Constraints to Allow Parallel Processing in.. - Deligiannidis (2002)   (Correct)

....When the mouse button is released, the Event Handler receives another token (e.g. LEFTUP ) transitions to the Start state, disables Link L1, and enables Link L2. At this point, the hand object relationship is terminated. Further details of this state diagram notation itself are found in [30] [27]. 6. Parallel Processing in DLoVe One of the major difficulties with parallel processing is in transforming a program written for a sequential machine into one that executes on multiple machines in parallel. A program written in DLoVe, however, can be initially written to execute on a single ....

R.J.K. Jacob, "A State Transition Diagram Language for Visual Programming," IEEE Computer, vol. 18, no. 8, pp. 51- 59, 1985.


Demonstrational and Constraint-Based Techniques for.. - Zanden, Myers (1995)   (3 citations)  (Correct)

....demonstrational techniques. Probably the most popular specification technique is to allow a user to open a property sheet for a widget and edit the widget s properties. This technique is used in the interface builders discussed in Section 2.1. Dataflow diagrams [42] and state transition diagrams [13] represent two other types of popular specification techniques. Lapidary uses an approach based on property sheets for specifying behaviors, although it also permits demonstrational techniques to be used for specifying behaviors. The behaviors supported by Lapidary are also graphics independent ....

Robert J.K. Jacob. "A State Transition Diagram Language for Visual Programming". IEEE Computer 18, 8 (Aug. 1985), 51-59. Lapidary - 46 -


Interaction in Really Graphical User Interfaces - Viehstaedt, Minas (1994)   (4 citations)  (Correct)

....order to find out about these conflicts, an analysis of the entire system is necessary. If we want to tell whether a FSM is deterministic or not, a local analysis (i.e. for each state) is sufficient. Except from Harel s Statecharts, there have been several earlier suggestions for extending FSMs [7, 8]. We consider Statecharts here since it has gained some popularity and is the first to incorporate parallelism. Statecharts is a very powerful model where states can be arranged in a hierarchy and actions permit generating user defined, high level events. The multiagent model adds encapsulation to ....

R.J.K. Jacob, "A state transition diagram language for visual programming", Computer, vol. 18, pp. 51--59, Aug. 1985.


Semiformal Visual Languages, a case study - Ibrahim   (Correct)

.... ways, this is an extension of what has already been done for many years now for the design of user interfaces (graphics, text, voice, sound, video or a combination of these) by using state transition diagrams, first as a paper and pencil methodology [11] and, later, with computer supported tools [9][17] The major difference being that these visual programming methodologies were meant to be used by programmers to ease the design and the implementation of their programs. Therefore, the visual formalism was designed as a formal notation to build the actual implementation of the application. ....

....was designed as a formal notation to build the actual implementation of the application. There was thus no room for natural language in the specification and the visual language had to allow for the specification of the lowest levels of details of the algorithm under construction. For instance, in [9], the diagrammatic component of the formalism is completed with a more classical textual programming language. Similarly, in [17] the state transition diagrams only specify the user interface of the application; the rest of the application still has to be designed and implemented in a traditional ....

Robert J. K. Jacob; "A State Transition Diagram Language for Visual Programming"; IEEE Computer, Aug. 1985, pp 51-59.


A High Level Language for Specifying Graph-Based Languages and .. - Kleyn, Browne (1994)   (7 citations)  (Correct)

....not involve text, and a graph object a mathematical abstraction that can be displayed graphically. 2 December 17, 1994 and their Programming Environments (Draft) State transition systems in which the states are represented as nodes and the transition between them as edges. The system in[Jac85] is a state transition graph system for specifying dialogs in user interfaces. The PROSPEC uses coupled pairs of state transition graphs for specifying and validating network protocols [CL88] Commercial GBLs for specifying image and signal processing, and graphics rendering such as AVS ....

R. J. K. Jacob. A state transition diagram language for visual programmingformulation and programming of parallel computers: A unified approach. Computer, 18(8):51--59624--631, August 1985.


A High Level Language for Specifying Graph-Based Languages and.. - Kleyn (1995)   (7 citations)  (Correct)

....are labeled with input symbols representing transitions that can occur between states. In this model the current state is represented by one node and not distributed over many nodes. More complex variations of this basic model have been developed. For example the system described in [ShuJLin, Jac85] is a transition network diagram model for specifying interaction in user interfaces. In this model there are several types of links which represent different types of transitions (e.g. user input, interface output, function invocation) Another example is modelling communications protocols. ....

R. J. K. Jacob. A state transition diagram language for visual programming. Computer, 18(8):51--59, August 1985.

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