Skip to main content
Book ChapterOPEN ACCESS

A Symbolic Semantics and Bisimulation for Full Lotos

  • Calder M
  • Shankland C
Kluwer Academic Publishers, (2006), 185-200
DOI: 10.1007/0-306-47003-9_12
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A symbolic semantics for Full LOTOS in terms of symbolic transition systems is defined; the semantics extends the (infinitely branching) standard semantics by giving meaning to data parameterised behaviours, and provides a finitely branching representation for behaviours. Symbolic bisimulation is defined. This extends our previous work [14], making the definitions more amenable to automated reasoning and processes with recursion.

Cite

CITATION STYLE

APA

Calder, M., & Shankland, C. (2006). A Symbolic Semantics and Bisimulation for Full Lotos. In Formal Techniques for Networked and Distributed Systems (pp. 185–200). Kluwer Academic Publishers. https://doi.org/10.1007/0-306-47003-9_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free