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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
