Pearson, Justin and Bryans, Jeremy W. (1998) Constraint Oriented Specification with CSP and Real Time Temporal Logic. Technical report. University of Kent (KAR id:21625)
PDF
Language: English |
|
Click to download this file (287kB)
Preview
|
Preview |
This file may not be suitable for users of assistive technology.
Request an accessible format
|
|
Postscript
Language: English |
|
Click to download this file (271kB)
Preview
|
Preview |
This file may not be suitable for users of assistive technology.
Request an accessible format
|
Abstract
A popular specification style, particularly for the initial specification of a system, is the em constraint-oriented style, where the constraints are properties required to hold of the final system. One of the difficulties of using this style is that, for any particular notation, certain types of constraints are much harder to capture than others. In this paper we propose such a specification framework, which allows the specifier a choice of two languages: Communicating Sequential Processes (CSP) and a version of Propositional Temporal Logic (PTL). The components of a specification have to be checked for mutual consistency, to do this we present a common semantic framework for both PTL and CSP.
Item Type: | Monograph (Technical report) |
---|---|
Uncontrolled keywords: | Constraint Oriented Specification, CSP, Propositional Temporal Logic |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Mark Wheadon |
Date Deposited: | 22 Aug 2009 19:36 UTC |
Last Modified: | 16 Nov 2021 10:00 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/21625 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):