|Appears in Collections:||Computing Science and Mathematics Conference Papers and Proceedings|
|Peer Review Status:||Refereed|
|Title:||Implementing a modal logic over data and processes using XTL|
|Citation:||Bryans J & Shankland C (2001) Implementing a modal logic over data and processes using XTL In: Kim M, Chin B, Kang D, Lee D (ed.) Formal Techniques for Networked and Distributed Systems, FORTE 2001, IFIP TC6/WG6.1 - 21st International Conference on Formal Techniques for Networked and Distributed Systems, New York, Boston, Dordrecht, London, Moscow: Kluwer Academic Press. Implementing a modal logic over data and processes using XTL, 28.8.2001 - 31.8.2001, Cheju Island, Korea, pp. 201-216.|
|Series/Report no.:||IFIP Advances in Information and Communication Technology, 69|
|Conference Name:||Implementing a modal logic over data and processes using XTL|
|Conference Location:||Cheju Island, Korea|
|Abstract:||The modal logic FULL is designed to capture strong bisimulation over early symbolic transition systems (STSs) for full LOTOS. It provides a compact way of expressing and verifying properties involving both data and transitions. In this paper we present a restricted prototype implementation of a model checker for LOTOS for queries written using the FULL logic. The model checker is developed within the CADP package using XTL.|
|Status:||Post-print (author final draft post-refereeing)|
|Rights:||The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.|
|forte01xtl.pdf||1.24 MB||Adobe PDF||Under Permanent Embargo Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.