|Appears in Collections:||Computing Science and Mathematics Conference Papers and Proceedings|
|Peer Review Status:||Refereed|
|Title:||An Adequate Logic for Full LOTOS|
|Citation:||Calder M, Maharaj S & Shankland C (2001) An Adequate Logic for Full LOTOS In: Oliveira JN, Zave P (ed.) FME 2001: Formal Methods for Increasing Software Productivity, Berlin Heidelberg: Springer. International Symposium of Formal Methods Europe, 12.3.2001 - 16.3.2001, Berlin, Germany, pp. 384-395.|
|Series/Report no.:||Lecture Notes in Computer Science, 2021|
|Conference Name:||International Symposium of Formal Methods Europe|
|Conference Location:||Berlin, Germany|
|Abstract:||We present a novel result for a logic for symbolic transition systems based on LOTOS processes. The logic is adequate with respect to bisimulation defined on symbolic transition systems.|
|Status:||Publisher version (final published refereed version)|
|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.|
|fme01.pdf||193.82 kB||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.