Translating UAN into CSP
نویسندگان
چکیده
In this paper 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 basis 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, untimed CSP. Our approach integrates task models, typically based on user-oriented concerns, into rigorous development which is typically system-oriented. It provides a basis for a framework for formal development of interactive systems.
منابع مشابه
Experiments in Translating CSP || B to Handel-C
This paper considers the issues involved in translating specifications described in the CSP‖B formal method into Handel-C. There have previously been approaches to translating CSP descriptions to Handel-C, and the work presented in this paper is part of a programme of work to extend it to include the B component of a CSP‖B description. Handel-C is a suitable target language because of its capab...
متن کاملOn the Conversion between Non-Binary and Binary Constraint Satisfaction Problems
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph translation and the hidden variable translation. However, there has been little theoretical or experimental work on how well backtracking algorithms perform on these binary representations in comparison to their performan...
متن کاملComputing Science Group THE ORDER ENCODING: FROM TRACTABLE CSP TO TRACTABLE SAT
Many mathematical and practical problems can be expressed as constraint satisfaction problems (CSPs). One way to solve a CSP instance is to encode it into SAT and use a SAT-solver. However, important information about the problem can get lost during the translation stage. For example, although the general constraint satisfaction problem is known to be NP-complete, there are some classes of CSP ...
متن کاملViewing CSP Specifications with UML-RT Diagrams
To precisely specify and reason about the properties of a system requires using formal methods like, for instance, process algebras. Complementary, semi-formal notations like UML are extensively used in practice to describe several architectural views of a system with the aid of modeling diagrams. In this paper we present an automated approach for translating specifications in the CSP process a...
متن کاملA Comparison of Two Secure Routing Protocols in Underwater Acoustic Network
There is an increasing requirement of the application of Underwater Acoustic Network (UAN) both in many fields. In the commercial applications, terrorists may carry through destroy activities; while in the military applications, even it is an inevitable activity to degrade the adversary UAN. Thus it can be seen that security measures must be integrated into UAN. This paper tries to do some effo...
متن کامل