Abstract
In order to analyze or better develop modern computer games it is critical to have an appropriate representation framework. In this paper a symbolic representation of modern computer narratives is described, and related to a general model of operational behaviour. The resulting structure can then be used to verify desirable properties, or as the basis for a narrative development system.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baggett, D., Lee, F., Munn, P., Ewing, G., Noble, J.: Plot in interactive works (was re: Attitudes to playing (longish)). Discussion thread in rec.arts.int-fiction archives (1994)
Olsson, M., Ewing, G.: Plot DAGs “undo”, and finite automata (was: Notes on “Annoy”). Discussion thread in rec.arts.int-fiction archives (1994)
Baggett, D., Plotkin, A.C., Arnold, J., Shiovitz, D., Clements, M.: Plot DAGs revisited (was re: Game design in general). Discussion thread in rec.arts.int-fiction archives (1995), http://bang.dhs.org/if/raif/pre1997/thrd14.html#07050
Forman, C.E.: Game design at the drawing board. XYZZY News (1997), http://www.xyzzynews.com/xyzzy.4e.html
Mateas, M.: An Oz-centric review of interactive drama and believable agents. Technical Report CMU-CS-97-156, School of Computer Science, Carnegie Mellon University (1997), http://www-2.cs.cmu.edu/afs/cs.cmu.edu/project/oz/web/papers/CMU-CS-97-%156.html
Burg, J., Boyle, A., Lang, S.D.: Using constraint logic programming to analyze the chronology in “A Rose for Emily”. Computers and the Humanities 34, 377–392 (2000)
Brooks, K.M.: Do story agents use rocking chairs? The theory and implementation of one model for computational narrative. In: The 4th ACM International Conference on Multimedia, pp. 317–328 (1996)
Brooks, K.: Programming narrative. In: The 1997 IEEE Symposium on Visual Languages, pp. 380–386 (1997)
Strohecker, C.: A case study in interactive narrative design. In: The Conference on Designing Interactive Systems: Processes, Practices, Methods, and Techniques (1997)
Roberts, M.J.: TADS the text adventure development system (1987), Software see http://tads.org
van der Aalst, W.M.P.: The application of Petri nets to workflow management. Journal of Circuits, Systems and Computers 8, 21–66 (1998)
Adams, E.: The designer’s notebook: “Bad game designer, no twinkie!”. Online article from Gamasutra (1998), http://www.gamasutra.com/features/designers_notebook/19980313.htm
Reisig, W.: Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets. Spring-Verlag (1988)
Cheng, A., Esparza, J., Palsberg, J.: Complexity results for 1-safe nets. Theoretical Computer Science 147, 117–136 (1995)
Esparza, J.: Decidability and complexity of Petri net problems—An introduction. In: Lectures on Petri Nets I: Basic Models, Springer, Heidelberg (1998)
Ausiello, G., Italiano, G.F., Nanni, U.: Optimal traversal of directed hypergraphs. Technical Report TR-92-073, International Computer Science Institute, University of California at Berkeley (1992), http://citeseer.nj.nec.com/ausiello92optimal.html
Pastor, E., Cortadella, J., Pena, M.A.: Structural methods to improve the symbolic analysis of Petri nets. In: The 20th International Conference on Application and Theory of Petri Nets, pp. 26–45 (1999), http://citeseer.nj.nec.com/pastor99structural.html
Adams, S.: Scott Adams grand adventures (S.A.G.A) (2003), http://www.msadams.com
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Verbrugge, C. (2003). A Structure for Modern Computer Narratives. In: Schaeffer, J., Müller, M., Björnsson, Y. (eds) Computers and Games. CG 2002. Lecture Notes in Computer Science, vol 2883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40031-8_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-40031-8_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20545-6
Online ISBN: 978-3-540-40031-8
eBook Packages: Springer Book Archive