P. David Stotts
- 1.Galton Antony, editor. Temporal Logics and their applications. Academic Press, Harcourt Brace Jovanovich, Publishers, 1987. Google Scholar
Digital Library
- 2.H. Barringer, R. Kuiper, and A. Pnueli. Now you may compose temporal logic specifications. In In Proc. of the Sixteenth ACM Symp. on Theory of Computing, pages 51-63, 1984. Google ScholarDigital Library
- 3.C. Beeri and Y. Kornatzky. A logical query language for hypertext systems. In A. Rizk, N. Streitz, and J. Andr6, editors, Hypertext: Concepts, Systems, and Applications, pages 67-80. Cambridge University Press, November 1990. Proceedings of the European Conference on Hypertext. Google Scholar
- 4.M. Ben-Aft, A. Pnueli, and Z. Manna. The temporal logic of branching time. In In Proc. eighth ACM Symp. on Principles of Programming Languages, pages 164-176, 1981. Google ScholarDigital Library
- 5.J. R. Bursh, E. M. Clark, and K. L. McMillan. Symbolic model checking: 10 to the 20 states and beyond. Carnegie Mellon and Stanford Universities, 1989.Google Scholar
- 6.R.M. Burstall. Program proving as hand simulation with a little induction. Information Processing, 74:308-312, 1974.Google Scholar
- 7.Brad Campbell and Joseph M. Goodman. HAM: A general purpose hypertext abstract machine. Communications of the ACM, 31(7):856-861, July 1988. Google ScholarDigital Library
- 8.S. Christodoulakis, E Ho, and M. Theodoridou. The multimedia object presentation manager of MINOS: A symmetric approach. In Proceedings of ACM SIGMOD '86, pages 295-310, May 1986. Washington, DC. Google ScholarDigital Library
- 9.S. Christodoulakis, M. Theodoridou, F. Ho, and M. Papa. Multimedia document presentation, information extraction, and document formation in MINOS: A model and a system. ACM Transactions on Office Information Systems, 4(4):345- 383, October 1986. Google ScholarDigital Library
- 10.E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8:244-263, 1986. Google ScholarDigital Library
- 11.E. M. Clarke and Grumberg. Research on automatic verification of finite-state concurrent systems. Ann. Rev. Comput. Sci., 2:269-290, 1987.Google ScholarCross Ref
- 12.Emerson and Srinivasan. Branching time temporal logic. In In Proc. of the REX School~Workshop 1988 on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. Springer-Verlag, 1989. Google ScholarDigital Library
- 13.E. A. Emerson and J. Y. Halpern. "sometimes" and "not never" revisited: on branching vs. linear time. in In Proc. Tenth ACM Syrup. on Principles of Programming Languages, pages 127-140, 1983. Google ScholarDigital Library
- 14.R. Furuta and E D. Stotts. Structured dynamic behavior in hypertext. Technical Report CS-TR- 2597 (UMIACS-TR-91-14), University of Maryland Department of Computer Science and Institute for Advanced Computer Studies, January 1991. Google ScholarDigital Library
- 15.D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness, in In Proc. seventh ACM Syrup. on Principles of Programming Languages, pages 163-173, 1980. Google ScholarDigital Library
- 16.Frank G. Halasz. Reflections on NoteCards: Seven issues for the next generation of hypermedia systems. Communications of the ACM, 31 (7):836-852, July 1988. Google ScholarDigital Library
- 17.K. Kahn and G. A. Gorry. Mechanizing temporal knowledge. Artificial Intelligence, 9:67-95, 1977.Google ScholarDigital Library
- 18.R. A. Kowalski and M. j. Sergot. A logic-based calculus of events. New Generation Computing, 4:67-95, 1983. Google ScholarDigital Library
- 19.L. Lamport. "sometime" is sometimes "not never": on the temporal logic of programs. In In Proc. seventh ACM Symp. on Programming Languages, pages 174-185, 1980. Google ScholarDigital Library
- 20.R. M. Le~, H. Coelho, and J. C. Cotta. Temporal inferencing on administrative databases. Information Systems, 10:197-206, 1985.Google ScholarCross Ref
- 21.Z. Manna and A. Pnueli. Verification of concurrent programs: the temporal framework. In R. S. Boyer and J. S. Moore, editors, The Correctness Problem in Computer Science, pages 215-273. Academic Press, 1981.Google Scholar
- 22.Gary Marchionini and Ben Shneiderman. Finding facts vs. browsing knowledge in hypertext systems. Computer, 21(1):70-80,January 1988. Google ScholarDigital Library
- 23.B. Moszkowski. Reasoning about digital circuits. Ph.D. dissertation, Standford University, CA, 1983. Google ScholarDigital Library
- 24.Tadao Murata. Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77(4):541-580, April 1989.Google ScholarCross Ref
- 25.J.L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice-Hall, Inc., 1981. Google ScholarDigital Library
- 26.James L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice-Hail, Inc., 1981. Google ScholarDigital Library
- 27.Pinter and Wolper. A temporal logic for reasoning about partially ordered computations. In In Proc. of the third ACM Syrup. on Principles of Distributed Computing, 1984. Google ScholarDigital Library
- 28.A. Pnueli. The temporal logic of programs. In In Proc. Eighteenth IEEE Symp. on Foundations of Computer Science, pages 46-67, 1977.Google ScholarDigital Library
- 29.Wolfgang Reisig. Petri Nets: An Introduction. Springer-Verlag, 1985. Google ScholarDigital Library
- 30.Ben Shneiderman. User interface design for the Hyperties electronic encyclopedia. In Proceedings of Hypertext '87, pages 189-194, November 1987. Published by the Association for Computing Machinery, 1989. Google ScholarDigital Library
- 31.A. Sinachopoulos. Logics for petri-nets: Partial order logics, branching time logics and how to distinguish between them. Petri Net Newsletter, pages 9-14, 8 1989.Google Scholar
- 32.P. David Stotts and Richard Furuta. Petri-netbased hypertext: Document structure with browsing semantics. ACM Transactions on Information Systems, 7(1):3-29, January 1989. Google ScholarDigital Library
- 33.P. David Stotts and Richard Furuta. Temporal hyperprogramming. Journal of Visual Languages and Computing, 1(3):237-253, 1990.Google ScholarDigital Library
- 34.P. David Stotts and Richard Furuta. Browsing parallel process networks. Journal of Parallel and Distributed Computing, 9:224-235,1990. Google ScholarDigital Library
- 35.I. Suzuki and H. Lu. Temporal petri nets and their application to modeling and analysis of a h~dshake daisy chain arbiter. IEEE Trans. Comput., 38(5):696-704,1989. Google ScholarDigital Library
- 36.Z. Wolper. Temporal logic can be more expressive. In In Proc. of the twentysecond IEEE Symp. on Foundations of Computer Science, pages 340- 348, 1981.Google ScholarDigital Library
- 37.Polle T. Zellweger. Directed paths through collections of multi-media documents. In Hypertext '87, November 1987. Position paper.Google Scholar
- 38.PoUe T. Zellweger. Active paths through multimedia documents. In J. C. van Vliet, editor, Document Manipulation and Typography, pages 19-34. Cambridge University Press, April 1988. Proceedings of the International Conference on Electronic Publishing, Document Manipulation, and Typography, Nice (France), April 20-22, 1988. Google ScholarDigital Library
Index Terms
- Hyperdocuments as automata: trace-based browsing property verification
Recommendations
Hyperdocuments as automata: verification of trace-based browsing properties by model checking
We present a view of hyperdocuments in which each document encodes its own browsing semantics in its links. This requires a mental shift in how a hyperdocument is thought of abstractly. Instead of treating the links of a document as defining a static ...
Interrupt Timed Automata: verification and expressiveness
We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.
While the reachability problem is undecidable for ...
On stateless multihead automata: Hierarchies and the emptiness problem
We look at stateless multihead finite automata in their two-way and one-way, deterministic and nondeterministic variations. The transition of a k-head automaton depends solely on the symbols currently scanned by its k heads, and every such transition ...
Comments