Heikki Tuominen

Embedding a Dialect of SDL in PROMELA

We describe a translation from a dialect of SDL-88 to PROMELA, the input language of the SPIN model checker. The fairly straightforward translation covers data types as well as processes, procedures, and services. Together with SPIN the translation provides a simulation and verification environment for most SDL features.

Elementary net systems and dynamic logic

Three connections between elementary net systems and propositional dynamic logic are studied: the use of dynamic logic as a query language for case graphs, the synthesis of elementary net systems from formulas of dynamic logic, and an axiomatization of the theory formed by properties of an elementary net system. The axiomatized theory consists of the formulas true in the initial case of the sequential case graph interpreted as a model of dynamic logic.

Dynamic Logic as a Uniform Framework for Theorem Proving in Intensional Logic

Dynamic logic is proposed as a uniform framewok for theorem proving in propositional intensional logic. Satisfiability and unsatisfiability preserving translations from various modal, deontic, epistemic, temporal, and intuitionistic calculi into dynamic logic calculi are defined and partly proved to be correct. The translations unify theorem proving in intensional logic by using dynamic logic as an intermediate logic for which the actual theorem provers can be implemented.

Proving properties of elementary net systems with a special-purpose theorem prover

Elementary net systems, basic net-theoretic models of distributed systems, as well as their properties are represented by formulas of deterministic propositional dynamic logic. A semantic tableaux based theorem prover is used to verify the properties, i.e. to find out whether they are entailed by the representations of the systems. The theorem prover implements a simplified tableaux decision procedure, the simplifications are due to the special nature of the set of formulas representing an elementary net system.