An adequate logic for full LOTOS

Calder, M., Maharaj, S. and Shankland, C. (2001) An adequate logic for full LOTOS. Lecture Notes in Computer Science, 2021, pp. 384-395.

[img]
Preview
Text
adequatecalder.pdf

268kB

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.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Calder, Professor Muffy
Authors: Calder, M., Maharaj, S., and Shankland, C.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Lecture Notes in Computer Science
Publisher:Springer Berlin / Heidelberg
ISSN:0302-9743
Copyright Holders:Copyright © 2001Springer
First Published:First published in Lecture Notes in Computer Science 2021:384-395
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher

University Staff: Request a correction | Enlighten Editors: Update this record