Symbolic Bisimulation for Full LOTOS

  title={Symbolic Bisimulation for Full LOTOS},
  author={Carron Shankland and Muffy Calder},
A symbolic semantics for Full LOTOS in terms of symbolic transition systems is defined, following the approach taken for message passing CCS in [HL95a], altered to take account of the particular features of LOTOS (multi-way synchronisation, value negotiation, selection predicates). Symbolic bisimulation over symbolic transition systems is defined, and symbolic bisimulation on ground behaviour expressions is shown to preserve the usual concrete (strong) bisimulation on the standard semantics… 
A Symbolic Semantics and Bisimulation for Full LOTOS
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
A Modal Logic over Early Symbolic Transition Systems
Symbolic transition systems separate data from process behaviour by allowing the data to be symbolic. Designing a HML-like modal logic for these transition systems is interesting because of the
Formal specification and temporal proof techniques for mixed systems
  • J. Royer
  • Computer Science
    Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001
  • 2001
A proposition trying to cope with the issue of formal specifications of mixed systems, the Graphic Abstract data Type (GAT) approach, which is a mixed formalism based on Symbolic Transition Systems (STSs) and algebraic specifications of partial.
Diet: Developing Implementation and Extending Theory a Symbolic Approach to Reasoning about Lotos Gr/m07779/01 Individual Grant Review Report Executive Summary
  • Computer Science
The aims of the project were to support symbolic reasoning about LOTOS speciications by implementing a symbolic model checker for temporal logic and LOTOS, and also proved some crucial theoretical results which were not part of the original plan.
Mixed formal specifications with PVS
  • M. Allemand, J. Royer
  • Computer Science
    Proceedings 16th International Parallel and Distributed Processing Symposium
  • 2002
This paper presents how to translate a GAT into PVS using the benefit of the PVS automatic generation of type-correctness conditions and shows some proofs of temporal properties.
Extended symbolic transition graphs with assignment
  • Weijia Deng, Huimin Lin
  • Computer Science
    29th Annual International Computer Software and Applications Conference (COMPSAC'05)
  • 2005
An extension of symbolic transition graphs with assignment is proposed which combines the advantages of both the assignment-before-action and the Assignment-after-action approaches, and avoids creating multiple copies in the graph for a recursive process definition.
KORRIGAN: a Formal ADL with Full Data Types and a Temporal Glue
This paper demonstrates that KORRIGAN may be used at the formal specification level to describe components, and provides full data types, temporal logic gluing facilities, structuring and readability.
Control and Datatypes using the ViewFormalism ( Long Version ) last revision : February 9 , 2000
Mixed speciication formalisms are dealt with, i.e. formalisms with both a static (data types) and a dynamic (behaviour) part, that allow one to specify systems at an abstract level and to avoid state explosion.
Formal specification of mixed components with Korrigan
The Korrigan model is presented, which allows one to specify in a uniform and structured way both datatypes and behaviours using Symbolic Transition Systems and algebraic specifications and is relevant to describe the architecture and communication schemes of systems that may present a complex structure.
A PVS Experiment with Asynchronous Communicating Components DRAFT
This work proposes to use an algorithm which decides if the system has bounded mailboxes and computes the reachable mailbox contents of the system and generates a PVS specification coping with dynamic behaviour and data type which is simpler since it removes the need for some mailboxes.


Experiences with specification and verification in LOTOS: a report on two case studies
  • C. Kirkwood, Muffy Calder
  • Computer Science
    Proceedings of 1995 IEEE Workshop on Industrial-Strength Formal Specification Techniques
  • 1995
The problems of verifying properties of LOTOS specifications are considered with specific reference to two case studies, one of which was proposed by an industrial collaborator, and some conclusions about the verification process are drawn.
Communication and concurrency
  • R. Milner
  • Computer Science
    PHI Series in computer science
  • 1989
This chapter discusses Bisimulation and Observation Equivalence as a Modelling Communication, a Programming Language, and its application to Equational laws.
Algebraic laws for nondeterminism and concurrency
The paper demonstrates, for a sequence of simple languages expressing finite behaviors, that in each case observation congruence can be axiomatized algebraically and the algebraic language described here becomes a calculus for writing and specifying concurrent programs and for proving their properties.
From Data Structure to Process Structure
This paper shows how for a well-known class of processes (bags, queues, stacks, etc.) descriptions in terms of simple process definitions and complex state parameters can be transformed in a stepwise fashion into equivalent systems of interacting processes with state parameters of reduced complexity.
Communicating sequential processes
This paper suggests that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method. When
On the design of side-stick controllers in fly-by-wire aircraft
This paper presents the problem of designing the functional behaviour of the interaction between two side-stick controllers, an autopilot, and a flight control computer in a fly-by-wire aircraft. Two