## A symbolic semantics and bisimulation for Full LOTOS (2001)

### Cached

### Download Links

- [www.cs.stir.ac.uk]
- [www.cs.stir.ac.uk]
- [www.dcs.gla.ac.uk]
- [www.dcs.gla.ac.uk]
- [www.dcs.gla.ac.uk]
- [eprints.gla.ac.uk]
- DBLP

### Other Repositories/Bibliography

Venue: | PROC. FORMAL TECHNIQUES FOR NETWORKED AND DISTRIBUTED SYSTEMS (FORTE XIV |

Citations: | 32 - 6 self |

### BibTeX

@INPROCEEDINGS{Calder01asymbolic,

author = {Muffy Calder and Carron Shankland},

title = {A symbolic semantics and bisimulation for Full LOTOS},

booktitle = {PROC. FORMAL TECHNIQUES FOR NETWORKED AND DISTRIBUTED SYSTEMS (FORTE XIV},

year = {2001},

pages = {184--200},

publisher = {Kluwer Academic Publishers}

}

### OpenURL

### Abstract

A symbolic semantics for Full LOTOS in terms of symbolic transition systems is defined; the semantics extends the standard one by giving meaning to symbolic, or (data) parameterised processes. Symbolic bisimulation is defined and illustrated with reference to examples. The approachtaken follows that applied to message passing CCS in [HL95], but differs in several significant aspects, taking account of the particular features of LOTOS: multi-way synchronisation, value negotiation, selection predicates.

### Citations

154 |
Symbolic bisimulations
- Hennessy, Lin
- 1995
(Show Context)
Citation Context ...tions; the data values are still present therefore the process remains infinite branching. The third solution is to adopt a symbolic approach such as the symbolic semantics for message passing CCS in =-=[10]-=-. We drew on this approach for our earlier work [14] in defining a symbolic semantics and bisimulation for LOTOS. That definition did not deal effectively with recursive processes, and could not be ea... |

36 |
An introduction to lotos: learning by examples
- Logrippo, Faci, et al.
- 1992
(Show Context)
Citation Context ...r conclusions and discuss future directions. 2. Distinguishing Features of LOTOS We assume the reader is familiar with the standard LOTOS syntax and semantics [11]. An accessible tutorial to LOTOS is =-=[12]-=-. Here we present three related features distinguishing LOTOS from most of the standard process algebras, particularly message passing CCS: multi-way (broadcast) synchronisation, value negotiation, an... |

22 | The Story of the Therac-25 - Thomas - 1994 |

20 | Modelling and Analysing User Views of Telecommunications Services
- Thomas
(Show Context)
Citation Context ... number of branches. Finally, as a consequence of this approach it is not possible to reason about partial, or data parameterised, behaviour expressions. Our experiences with LOTOS applications (e.g. =-=[15, 16]-=-) indicate that this is highly desirable. The advantage of the standard approach is that it easily accommodates multiway synchronisation, i.e. associative synchronisation between two or more processes... |

19 | A Modal Logic for Full LOTOS based on Symbolic Transition Systems. The Computer Journal
- Calder, Maharaj, et al.
- 2001
(Show Context)
Citation Context ... fv(T 0 ). The definition of free variables is extended to terms in the obvious way. Terms, rather than STSs, are used as the basis for defining the bisimulation in the next section, and the logic in =-=[5, 6]-=-. Definition 2 (Transitions between terms) T b a- T 0 implies T b a- T 0 0 T b gE- T 0 implies T b gE- T 0 0 where fv(E ) fv(T ) T b gx- T 0 implies T b [z =x ] gz- T 0 0 where x 62 fv(T )� z 62 fv(T ... |

16 | An Adequate Logic for Full LOTOS
- Calder, Maharaj, et al.
- 2001
(Show Context)
Citation Context ... fv(T 0 ). The definition of free variables is extended to terms in the obvious way. Terms, rather than STSs, are used as the basis for defining the bisimulation in the next section, and the logic in =-=[5, 6]-=-. Definition 2 (Transitions between terms) T b a- T 0 implies T b a- T 0 0 T b gE- T 0 implies T b gE- T 0 0 where fv(E ) fv(T ) T b gx- T 0 implies T b [z =x ] gz- T 0 0 where x 62 fv(T )� z 62 fv(T ... |

9 |
Catalogue of LOTOS correctness preserving transformation
- Bolognesi
- 1992
(Show Context)
Citation Context ... some sort of separation of the concerns of data and processes seems appropriate. There are three kinds of solution to this problem. The first is to get rid of data altogether in a brute force manner =-=[1]-=- which changes the behaviour of the process. The second is to construct a process representation of the data type [2, 9]. This approach only converts data operations into process operations; the data ... |

9 | Symbolic Bisimulation for Full LOTOS
- Shankland, Thomas
- 1997
(Show Context)
Citation Context ...tandard 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. LOTOS, symbolic transition systems, symbolic bisimulation. 1. Introduction LOTOS [11] is a message passing p... |

8 |
From data structure to process structure
- Brinksma
(Show Context)
Citation Context ...o this problem. The first is to get rid of data altogether in a brute force manner [1] which changes the behaviour of the process. The second is to construct a process representation of the data type =-=[2, 9]-=-. This approach only converts data operations into process operations; the data values are still present therefore the process remains infinite branching. The third solution is to adopt a symbolic app... |

7 |
Specifying Abstract Data Types with LOTOS
- Gotzhein
- 1987
(Show Context)
Citation Context ...o this problem. The first is to get rid of data altogether in a brute force manner [1] which changes the behaviour of the process. The second is to construct a process representation of the data type =-=[2, 9]-=-. This approach only converts data operations into process operations; the data values are still present therefore the process remains infinite branching. The third solution is to adopt a symbolic app... |

5 | Fundamentals of Algebraic Speci cation 1: Equations and Initial Semantics. EATCS Monographs on Theoretical Computer Science - Ehrig, Mahr - 1985 |

5 | On the Design of SideStick Controllers in Fly-by-Wire Aircraft - Thomas, Ormsby - 1994 |

5 | Implementing a modal logic over data and processes using XTL
- Bryans, Shankland
- 2001
(Show Context)
Citation Context ...ame processes as that bisimulation. Tools to support model checking of FULL with respect to LOTOS specifications (or STSs) are also being developed based on several different implementation paradigms =-=[3, 4, 13]-=-. Acknowledgments The authors would like to thank Savi Maharaj for useful input on the definition of bisimulation, and Ed Brinksma for many fruitful discussions on reasoning about LOTOS. Carron Shankl... |

5 |
Simulation Techniques for the Validation of LOTOS Specifications
- Eertink
- 1994
(Show Context)
Citation Context ...ot be easily implemented (since it required an infinite stock of new names). These problems are addressed here and the definitions considerably revised. The symbolic approach is also taken by Eertink =-=[8]-=-. While Eertink's semantics achieves a separation of the concerns of data and process, without losing information, it is rather operational, concentrating on using the semantics in a simulation tool. ... |

3 | Veri cation of the Link Layer Protocol of the IEEE-1394 Serial Bus (FireWire): an Experiment with E-LOTOS - Sighireanu, Mateescu - 1998 |

3 |
Using Rewriting Logic to implement the modal logic FULL
- Bryans, Verdejo, et al.
- 2001
(Show Context)
Citation Context ...ame processes as that bisimulation. Tools to support model checking of FULL with respect to LOTOS specifications (or STSs) are also being developed based on several different implementation paradigms =-=[3, 4, 13]-=-. Acknowledgments The authors would like to thank Savi Maharaj for useful input on the definition of bisimulation, and Ed Brinksma for many fruitful discussions on reasoning about LOTOS. Carron Shankl... |

2 | Simulation Techniques for the Validation of LOTOS Speci cations - Eertink - 1994 |

2 |
Implementing the modal logic FULL using Ergo
- Robinson, Shankland
- 2001
(Show Context)
Citation Context ...ame processes as that bisimulation. Tools to support model checking of FULL with respect to LOTOS specifications (or STSs) are also being developed based on several different implementation paradigms =-=[3, 4, 13]-=-. Acknowledgments The authors would like to thank Savi Maharaj for useful input on the definition of bisimulation, and Ed Brinksma for many fruitful discussions on reasoning about LOTOS. Carron Shankl... |