We define a translation from the User Action Notation (UAN) to the process algebra Communicating Sequential Processes (CSP). UAN is an informal notation, used for task modeling and design. Translating a UAN task description to CSP provides a base for rigorous development of an interactive system. The resulting CSP description is a suitable abstract starting point for development, as it describes externally visible behaviour with no mention of presented or underlying state. Our translation covers all UAN constructs except for waiting, interruptibility and true concurrency which cannot be expressed in interleaving, un-timed CSP. Our approach integrates task models, typically based on user-oriented concerns, into rigorous development which is ...
International audienceBusiness Process Modelling Notation (BPMN) intends to bridge the gap between b...
In proposing theories of how we should design and specify networks of processes it is necessary to s...
AbstractThe algebra of relations has been very successful for reasoning about possibly non-determini...
CSP (Communicating Sequential Processes) is a notation proposed by Hoare, for expressing process com...
The use of formal notations has many advantages in the specification of interactive systems. However...
The User Action Notation (UAN) is a notation for specifying how a user performs tasks using a given ...
Two possibilities of automated CSP (Communicating Sequential Processes) support are introduced in [1...
Many existing interface representation techniques, especially those associated with UIMS, are constr...
In proposing theories of how we should design and specify networks of processes it is necessary to s...
The Unified Modelling Language (UML) includes a variant of Statecharts [5], called State Diagrams (S...
Abstract: The algebra of Communicating Sequential Processes provides a facility to formal specify sy...
Almost all existing interface representation techniques, especially those associated with UIMS, are ...
technical reportCommunicating Sequential Processes (CSP) is a well known paradigm for communication ...
AbstractThe original CSP was a language for parallel imperative programs communicating by synchroniz...
This paper defines a formal semantics for a subset of the Unified Modeling Language (UML). It shows ...
International audienceBusiness Process Modelling Notation (BPMN) intends to bridge the gap between b...
In proposing theories of how we should design and specify networks of processes it is necessary to s...
AbstractThe algebra of relations has been very successful for reasoning about possibly non-determini...
CSP (Communicating Sequential Processes) is a notation proposed by Hoare, for expressing process com...
The use of formal notations has many advantages in the specification of interactive systems. However...
The User Action Notation (UAN) is a notation for specifying how a user performs tasks using a given ...
Two possibilities of automated CSP (Communicating Sequential Processes) support are introduced in [1...
Many existing interface representation techniques, especially those associated with UIMS, are constr...
In proposing theories of how we should design and specify networks of processes it is necessary to s...
The Unified Modelling Language (UML) includes a variant of Statecharts [5], called State Diagrams (S...
Abstract: The algebra of Communicating Sequential Processes provides a facility to formal specify sy...
Almost all existing interface representation techniques, especially those associated with UIMS, are ...
technical reportCommunicating Sequential Processes (CSP) is a well known paradigm for communication ...
AbstractThe original CSP was a language for parallel imperative programs communicating by synchroniz...
This paper defines a formal semantics for a subset of the Unified Modeling Language (UML). It shows ...
International audienceBusiness Process Modelling Notation (BPMN) intends to bridge the gap between b...
In proposing theories of how we should design and specify networks of processes it is necessary to s...
AbstractThe algebra of relations has been very successful for reasoning about possibly non-determini...