Modelling and Prototyping Collaborative Software Processes

The correct and timely creation of systems for coordination of group work depends on the ability to express, analyze, and experiment with protocols for managing multiple work threads. We present an evolution of the Trellis model that provides a formal basis for prototyping the coordination structure of a collaboration system. Like its predecessor, the new Trellis model has the nicely exploitable duality of being both graph formalism and parallel automaton. The automaton semantics provide dynamic information about the interactions of agents in a collaboration; the graph structure forms the basis for the static link structure of a hyperdocument. We give several analysis techniques for the model, and demonstrate its use by expressing the interaction structure of some common forms of collaborative system.

[1]  Walt Scacchi,et al.  On designing intelligent hypertext systems for information management in software engineering , 1987, Hypertext.

[2]  Watts S. Humphrey,et al.  Characterizing the software process: a maturity framework , 1988, IEEE Software.

[3]  Prasun Dewan,et al.  A high-level and flexible framework for implementing multiuser user interfaces , 1992, TOIS.

[4]  Gregory A. Hansen,et al.  Software Process Modeling , 1988 .

[5]  H. Dieter Rombach MVP-L: a language for process modeling in-the-large , 1991 .

[6]  Anatol W. Holt,et al.  Diplans: a new language for the study and implementation of coordination , 1988, TOIS.

[7]  E. Clarke,et al.  Automatic Veriication of Nite-state Concurrent Systems Using Temporal-logic Speciications. Acm , 1993 .

[8]  Willem R. van Biljon Extending Petri Nets for Specifying Man-Machine Dialogues , 1988, Int. J. Man Mach. Stud..

[9]  Catriel Beeri,et al.  A Logical Query Language for Hypertext Systems , 1992, ECHT.

[10]  Wolfgang Reisig,et al.  Petri Nets with Individual Tokens , 1982, Theor. Comput. Sci..

[11]  P. David Stotts,et al.  Browsing Parallel Process Networks , 1990, J. Parallel Distributed Comput..

[12]  P. Merlin,et al.  Recoverability of Communication Protocols - Implications of a Theoretical Study , 1976, IEEE Transactions on Communications.

[13]  Wolfgang Reisig,et al.  Petri Nets with Individual Tokens , 1982, Theor. Comput. Sci..

[14]  Wolfgang Reisig Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[15]  P. David Stotts,et al.  Dynamic adaptation of hypertext structure , 1991, HYPERTEXT '91.

[16]  Philip Meir Merlin,et al.  A study of the recoverability of computing systems. , 1974 .

[17]  Kurt Lautenbach,et al.  System Modelling with High-Level Petri Nets , 1981, Theor. Comput. Sci..

[18]  Christopher M. Lott,et al.  A MVP-L1 Solution for the Software-Process Modeling Problem , 1990 .

[19]  P. David Stotts,et al.  Hyperdocuments as automata: trace-based browsing property verification , 1992, ECHT '92.

[20]  P. David Stotts,et al.  Hypertextual concurrent control of a Lisp Kernel , 1992, J. Vis. Lang. Comput..

[21]  Gail E. Kaiser,et al.  Intelligent assistance for software development and maintenance , 1988, IEEE Software.

[22]  P. David Stotts,et al.  Temporal hyperprogramming , 1990, J. Vis. Lang. Comput..

[23]  P. David Stotts,et al.  Petri-net-based hypertext: document structure with browsing semantics , 1989, TOIS.

[24]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[25]  Kurt Jensen,et al.  Coloured Petri Nets and the Invariant-Method , 1981, Theor. Comput. Sci..

[26]  Joseph M. Goodman,et al.  HAM: a general-purpose hypertext abstract machine , 1987, Hypertext.