×

zbMATH — the first resource for mathematics

A modal logic for full LOTOS based on symbolic transition systems. (English) Zbl 1008.68081
Summary: 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.

MSC:
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68T15 Theorem proving (deduction, resolution, etc.) (MSC2010)
03B45 Modal logic (including the logic of norms)
Software:
PVS
PDF BibTeX XML Cite
Full Text: DOI