We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A Modal Logic for Full LOTOS based on Symbolic Transition Systems.
- Authors
Calder, M.; Maharaj, S.; Shankland, C.
- Abstract
Symbolic transition systems separate data from process behaviour by allowing the data to be uninstantiated. Designing an HML-like modal logic for these transition systems is interesting because of the subtle interplay between the quantifiers for the data and the modal operators (quantifiers on transitions). This paper presents the syntax and semantics of such a logic and discusses the design issues involved in its construction. The logic has been shown to be adequate with respect to strong early bisimulation over symbolic transition systems derived from Full LOTOS. We define what is meant by adequacy and discuss how we can reason about it with the aid of a mechanized theorem prover.
- Subjects
LOTOS (Computer program language); PROGRAMMING language semantics; FORMAL language semantics; SEMANTIC network analysis; SEMANTICS (Philosophy); COMPUTER programming
- Publication
Computer Journal, 2002, Vol 45, Issue 1, p55
- ISSN
0010-4620
- Publication type
Article
- DOI
10.1093/comjnl/45.1.55