Stotts, P. D. / Furuta, R. / Ruiz, J. C. "Hyperdocuments as Automata: Trace-based Browsing Property Verification" in EC'92 [EC'92]  Home/Search   Document Details and Download   Summary   Related Articles   Check

....by giving a rigorous definition of the logic used, by considering the underlying proof theory, by considering the issue of framing and its relationship to multi authoring, and by presenting more complex examples which treat the issue of composition in a more rigorous fashion. Furuta and Stotts [18, 19] make use of a temporal logic for specifying and tracing dynamic link paths in hypertext documents. Their logic is somewhat di#erent from ours, and does not require, for example, any notion of projection, and their application is also rather di#erent. In contrast, interval temporal logic has a ....

P.D. Stotts, R. Furuta, and J.C. Ruiz. "Hyperdocuments as Automata: Trace-Based Browsing Property Verification". In D. Lucarella, J. Nanard, M. Nanard, and P. Paolini, editors, Proc. the ACM Conf. Hypertext (ECHT '92), pages 272--281. ACM Press, 1992. (Nov. 30--Dec. 4, 1992, Milan, Italy).

....a mechanism for automatic linking (as well as automatic creation of other components such as nodes or buttons) They regard link traversal as a complex inferencing process that may use application level procedures. Such bridge laws are presented in a logic based model. Stotts, Furuta and Ruiz [43] present a browsing semantics of hypertext documents by examining links The Computer Journal, Vol. 00, No. 0, 1996 On the Expressiveness of Links in Hypertext Systems 15 alone. They consider that links form an automaton instead of a static directed graph. Using branching time logics, they perform ....

P. David Stotts, Richard Furuta, and J. Cyrano Ruiz, (1992). Hyperdocuments as Automata: Trace-Based Browsing Property Verification. In Proceeding of te ACM Conference on Hypertext, pages 272--281.

....schema. In order to query pages we also associate with a Hypertext database an information repository, which maps each state of the reachability relation to a set of conditions that are true at that state. In logical terminology a Hypertext database is a temporal structure [EMER90] see also [STOT92] whereby temporal logic is used to formalise the notion of a Hypertext database) The process of traversing links and following a trail of information in a Hypertext database is called navigation (or alternatively link following) In graph theoretic terms a trail in a Hypertext database is a path ....

P.D. Stotts, R. Furata and J.C. Ruiz, Hyperdocuments as automata: Trace-based browsing property verification. In: Proceedings of the ACM Conference on Hypertext, ECHT'92, pp. 272-281, 1992.

....some property P becomes true: fl :P P . Example 6 above provides a specific example. 5 Related Work There has been little previous work on applying temporal logic to the field of electronic publishing. King [10, 11] justify the use of ITL in this area and present examples. Furuta and Stotts [16, 15] make use of a temporal logic for specifying and tracing dynamic link paths in hypertext documents. Their logic is somewhat different from ours, and does not require, for example, any notion of projection, and their application is also rather different. In contrast, interval temporal logic has a ....

P.D. Stotts, R. Furuta, and J.C. Ruiz. Hyperdocuments as automata: Trace-based browsing property verification. In Proc. ACM Conf. on Hypertext, pages 272--281. ACM Press, 1992.

....none of them are excluded from the model. In order to use Petri nets to describe browsing, the operations dealing with the hierarchical structure of objects (composites, towers and cities) are translated into operations that are equivalent to the simple follow link. Unlike Stotts, Furuta and Ruiz [14] we combine the operations offered by the hypertext system (or presentation layer) with the link structure of the document, in order to characterize the browsing semantics of document and system as a unity. By using existing analysis tools for (different kinds of) Petri nets one can easily detect ....

....the document and the potential ways the document can be used. To study the browsing semantics of a hyperdocument Zheng and Pong [19] use the statecharts [7] formalism, which is especially useful for modeling the behavior of hyperdocuments which contain composite structures. Stotts, Furuta and Ruiz [14] use automata theory. The set of all possible paths through a hyperdocument can be viewed as the language accepted by an automaton. The formalism of languages accepted by automata is very well known, and numerous tools for analyzing automata exist. The main shortcoming in the previously quoted ....

[Article contains additional citation context not shown here]

STOTTS, P., FURUTA, R., AND RUIZ, J. Hyperdocuments as automata: Trace-based browsing property verification. In Proc. ACM Conf. on Hypertext'92 (Dec. 1992), pp. 272--281.

....accurate discovery of the structure is necessary. A search facility can operate better if it is able to find a significant part of the structure in the limited time the reader wants to search. The relationship between browsing and hypertext structure has been studied formally by several authors [8, 9, 13, 12]. While a formal analysis may pinpoint specific problems with hypertexts, such as loops and dead ends, they provide little insight in the general lost in hyperspace problem, which simply means that a user has no accurate perception of the hypertext s structure, and of his current position in ....

STOTTS, P., FURUTA, R., AND RUIZ, J. Hyperdocuments as automata: Trace-based browsing property verification. In Proc. ACM Conf. on Hypertext'92 (Dec. 1992), pp. 272--281.

....We have used our formalism to specify complex applications that have been later implemented in different application environmnts (like Toolbook, HTML, etc) Other authors have used formal techniques to specify the navigation and interface structure of hypermedia applications. For example in [Stotts et al..92] branching temporal logic is used to expressing some dynamic properties a document should exhibit during browsing and a model checking approach is used to verify that these properties are met by the system (expressed as an automaton) In this case temporal logic is not used as an specification ....

P.D. Stotts, R. Furuta and J.C. Ruiz. "Hyperdocuments as Automata: Trace-based Browsing Property Verification". ACM ECHT Conference, Milano, 1992. 11

....use Petri nets in UI was made by Shew Yoo in 1989 [SY89] in his project KBSE (Knowledge Base Software Environment) This supported concurrent programming based on Object Oriented Knowledgebase. In 1991 David Scott and Richard Furuta used Petri nets in modelling the behavior of a Hypertext System [FS89, SF91, SFR92]. They used petri nets for specification of presentation objects when a hypertext is browsed. Petri net al..so provided modelling of synchronization of simultaneous traversals of separate paths through the Hypertext. Jensen, Shapiro and Albrecht developed hierarchical Colored Petri nets based ....

P. David Stotts, Richard Furuta, and J. Cyrano Ruiz. Hyperdocuments as automata: Trace-based browsing property verification, 1992.

....the output of a trail query and finite automata that accept star free regular languages. In Section 6 we investigate the computational complexity of navigation in a Hypertext database. Finally, in Section 7 we give our concluding remarks. 2 A Brief Survey of Related Work Several researchers [MEND88, STOT89, STOT92] have recognized that the semantics of navigation in a Hypertext database can be formalized in terms of finite automata [HOPC79, PERR90] In [MEND88] a query language, called G , is described in which the database graph is defined as a finite automaton, a query is defined as a regular ....

....special cases of Petri nets when the reachability problem is easier see [ESPA94] Thus there is a trade off between expressiveness and complexity, which implies that in practice only special cases of the reachability problem can be incorporated into the navigation semantics of the said model. In [STOT92] a Hypertext database (called a hyperdocument) is viewed as a finite automaton, called the link automaton. A branching temporal logic [EMER90] language, called HTL , is proposed for the specification of properties that should be exhibited when navigating through a Hypertext database. HTL is based ....

[Article contains additional citation context not shown here]

P.D. Stotts, R. Furata and J.C. Ruiz, Hyperdocuments as automata: Tracebased browsing property verification. In: Proceedings of the ACM Conference on Hypertext, ECHT'92, pp. 272-281, 1992.

....exploring structured documents with typed links via an SQL like query language. The model represents a structured document with hypertext links as a complex object, where the paths through the object structure are used, as first class citizens, in formulating queries. Compared to other approaches [29, 26] paths (including hypertext links) are defined in conformance with the generic logical structure of a document (DTD) and do not require additional data structure for their creation and storage. Several examples of queries illustrate, from a practical point of view, the expressive power of the ....

P. D. Stotts, R. Furuta, and J. C. Ruiz. Hyperdocuments as Automata: Trace-based Browsing Property Verification. In ECHT'92, pages 272--281. ACM, December 1992.

No context found.

Stotts, P. D., Furuta, R., and Ruiz, J. C. Hyperdocuments asautomata: Tracebased browsing propertyverification. In Proceedings of the ACM ConferenceonHypertext (ECHT '92), D. Lucarella, J. Nanard, M. Nanard, and P.Paolini, Eds. ACM Press, 1992, pp. 272--281.

No context found.

P. D. Stotts, R. Furuta, and J. C. Ruiz. Hyperdocuments as automata:Trace-based browsing propertyverifi.' In Proceedings of the 1992 European Conference on Hypertext (ECHT92: November30--, cember 4, Milan, Italy), pages 272--281. ACM Press, New York, 1992.

....will then get a target user group to browse the hyperdocuments, thereby experiencing a simulation of the groupware behavior; they will provide feedback about the effectiveness of the specified interactions. The engineer will also analyze the collaborative protocols using model checking software [11] we have developed, looking for logical errors in its specification. At this point in prototyping, a hyperdocument exists that simulates the group interaction behavior of the desired groupware but does not provide any of the data exchange or functionality. After the interaction protocols are ....

P. D. Stotts, R. Furuta, and J. C. Ruiz. Hyperdocuments as automata: Trace-based browsing property verification. In Proceedings of the 1992 European Conference on Hypertext (ECHT92: November 30--December 4, Milan, Italy), pages 272--281. ACM Press, New York, 1992.

....machine to see if the subcomponents of a formulae hold at each state. By composing the truth values of these subformulae, one obtains a truth value for the entire formula. For PT nets, we obtain a state machine from the coverability graph. The details of our use of CTL are discussed elsewhere [14]. For this rationale, it is sufficient to give an idea of how the method is applied to net models. The Trellis document shown in figure 11 is a small net that expresses the browsing behavior found in some hypertext systems, namely that when a link is followed out of a node, the source content ....

P. D. Stotts, R. Furuta, and J. C. Ruiz. Hyperdocuments as automata: Trace-based browsing property verification. In Proceedings of the 1992 European Conference on Hypertext (ECHT92: November 30-- December 4, Milan, Italy), pages 272--281. ACM Press, New York, 1992.

....informal reasoning, one cannot be sure all important behavior has been deduced. When is it safe to stop reasoning Formal analysis methods We have developed analysis techniques for CTNs that allow a designer to determine if the behavior of a net matches formal specifications of desired behavior [17]. Our current analysis software is a modification of a model checking system developed by Clarke for verifying the behavior of concurrent programs. Since the Trellis model is based on a concurrent automaton (Petri net) hyperprograms are expressions of concurrent processes and are quite amenable ....

Stotts, P. D., Furuta, R., and Ruiz, J. C. Hyperdocuments as automata: Trace-based browsing property verification. In Proceedings of the 1992 European Conference on Hypertext (ECHT92: November 30--December 4, Milan, Italy) (1992), ACM Press, New York, pp. 272--281.

....by Clarke s MCB CTL language model checker [5] In doing so, they discovered some unexpected inconsistencies in previouslypublished specifications that were believed correct. The target they used is identical to the one we have used in our previously reported research in the hypertext domain [28] 2 There is no distinction in this figure in the sense of the net specification between the dashed lines and the solid lines they are distinguished in the diagram merely for purposes of graphical presentation. and consequently similar results can be expected for CPS applications. Less ....

....definition component is a complete programminglanguage (scripting language) The uniqueness of the Trellis model is expression of processes with a notation that is less powerful for programming, but also fully amenable to state space analysis. This has been the point of some of our past research [28]; as shown in the example of SCR (A7 aircraft) requirements, analysis is often desirable, if not absolutely necessary. Little, if any, other hypermedia research has looked at this browsing process analysis. We are currently adapting the Trellis analysis methods to the new colored model. In the ....

P. David Stotts, Richard Furuta, and J. Cyrano Ruiz. Hyperdocuments as automata: Trace-based browsing property verification. In D. Lucarella, J. Nanard, M. Nanard, and P. Paolini, editors, Proceedings of the ACM Conference on Hypertext (ECHT '92), pages 272--281. ACM Press, 1992.

....machine to see if the subcomponents of a formulae hold at each state. By composing the truth values of these subformulae, one obtains a truth value for the entire formula. For PT nets, we obtain a state machine from the coverability graph. The details of our use of CTL are discussed elsewhere [SFR92]. For this rationale, it is sufficient to give an idea of how the method is applied to Trellis models. The Trellis document shown in Figure 7 is a small net that expresses the browsing behavior found in some hypertext systems, namely that when a link is followed out of a node, the source content ....

P. D. Stotts, R. Furuta, and J. C. Ruiz. Hyperdocuments as automata: Trace-based browsing property verification. In Proceedings of the 1992 European Conference on Hypertext (ECHT92: November 30-- December 4, Milan, Italy), pages 272--281. ACM Press, New York, 1992.

....hold at each state. By composing the truth values of these subformulae, one obtains a truth value for the entire formula. For PT nets, we obtain a useful state machine from the coverability graph explained in an earlier Trellis paper [SF89a] The details of our use of CTL are discussed elsewhere [SFR92]. For this rationale, it is sufficient to give an idea of how the method is applied to Trellis (and eventually to IMP ACT) models. The Trellis document shown in Figure 9 is a small net that expresses the browsing behavior found in some hypertext systems, namely that when a link is followed out of ....

P. David Stotts, Richard Furuta, and J. Cyrano Ruiz. Hyperdocuments as automata: Trace-based browsing property verification. In D. Lucarella, J. Nanard, M. Nanard, and P. Paolini, editors, Proceedings of the ACM Conference on Hypertext (ECHT '92), pages 272--281. ACM Press, 1992.

....hold at each state. By composing the truth values of these subformulae, one obtains a truth value for the entire formula. For PT nets, we obtain a useful state machine from the coverability graph explained in an earlier Trellis paper [SF89] The details of our use of CTL are discussed elsewhere [SFR92]. For this rationale, it is sufficient to give an idea of how the method is applied to Trellis models. The Trellis document shown in Figure 6 is a small net that expresses the browsing behavior found in some hypertext systems, namely that when a link is followed out of a node, the source content ....

P. D. Stotts, R. Furuta, and J. C. Ruiz. Hyperdocuments as automata: Trace-based browsing property verification. In Proceedings of the 1992 European Conference on Hypertext (ECHT92: November 30--December 4, Milan, Italy), pages 272--281. ACM Press, New York, 1992.

....Engineering Department University of Maryland College Park, MD 20742 This work is based upon work supported by the National Science Foundation under grant numbers IRI 9007746 and IRI 9015439. Portions of this work were reported previously in preliminary form at the ECHT 92 conference [41]. Abstract As hypertext systems proliferate and as networks become more ubiquitous, an important problem is to determine how to provide hyperdocument interoperability. Instead of taking the approach of standardizing, and implementing, a large and complex set of browsing features gleaned from ....

....first on Trellis documents, and then on a Hyperties document, to emphasize the system independence of the idea. We conclude with a discussion of the limitations of the work as it now stands, and directions for more research. Portions of this work have been previously reported in preliminary form [41]. 1.1 Links only document behavior Trellis is a general man machine interaction model that has been used previously as the basis for various hypertext systems and experiments [36, 38, 37] Though we will first explain our general verification techniques in the context of Trellis, we would like ....

Stotts, P. D., Furuta, R., and Ruiz, J. C. Hyperdocuments as automata: Tracebased browsing property verification. In Proceedings of the ACM Conference on Hypertext (ECHT '92), D. Lucarella, J. Nanard, M. Nanard, and P. Paolini, Eds. ACM Press, 1992, pp. 272--281.

No context found.

Stotts, P. D. / Furuta, R. / Ruiz, J. C. "Hyperdocuments as Automata: Trace-based Browsing Property Verification" in EC'92 [EC'92]

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