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. © Springer-Verlag Berlin Heidelberg 2001.
Cite
CITATION STYLE
APA
Calder, M., Maharaj, S., & Shankland, C. (2001). An adequate logic for full LOTOS. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2021 LNCS, pp. 384–395). Springer Verlag. https://doi.org/10.1007/3-540-45251-6_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free