Results 1 
5 of
5
On an Intuitionistic Modal Logic
 Studia Logica
, 2001
"... . In this paper we consider an intuitionistic variant of the modal logic S4 (which we call IS4). The novelty of this paper is that we place particular importance on the natural deduction formulation of IS4our formulation has several important metatheoretic properties. In addition, we study models ..."
Abstract

Cited by 23 (5 self)
 Add to MetaCart
. In this paper we consider an intuitionistic variant of the modal logic S4 (which we call IS4). The novelty of this paper is that we place particular importance on the natural deduction formulation of IS4our formulation has several important metatheoretic properties. In addition, we study models of IS4, not in the framework of Kripke semantics, but in the more general framework of category theory. This allows not only a more abstract definition of a whole class of models but also a means of modelling proofs as well as provability. 1. Introduction Modal logics are traditionally extensions of classical logic with new operators, or modalities, whose operation is intensional. Modal logics are most commonly justified by the provision of an intuitive semantics based upon `possible worlds', an idea originally due to Kripke. Kripke also provided a possible worlds semantics for intuitionistic logic, and so it is natural to consider intuitionistic logic extended with intensional modalities...
Denotational Semantics for ProcessBased Simulation Languages. Part I: piDemos
, 1997
"... In this paper we present a method for translating the synchronisation behaviour of a process oriented discrete event simulation language into a process algebra. Such translations serve two purposes. The first exploits the formal structure of the target process algebraic representations to provide pr ..."
Abstract

Cited by 15 (10 self)
 Add to MetaCart
In this paper we present a method for translating the synchronisation behaviour of a process oriented discrete event simulation language into a process algebra. Such translations serve two purposes. The first exploits the formal structure of the target process algebraic representations to provide proofs of properties of the source system (such as deadlock freedom, fairness, liveness, ...) which can be very difficult to establish by simulation experiment. The second exploits the denotational semantics to better understand the language constructs as abstract entities and to reason about simulation models. Here we give the intuition and present the basic mechanisms using the ßDemos simulation language and the CCS and SCCS process algebras. The analysis of the synchronisations of full Demos is treated in a companion paper.
A Compositional Proof System for the Modal µCalculus
, 1994
"... We present a proof system for determining satisfaction between processes in a fairly general process algebra and assertions of the modal µcalculus. The proof system is compositional in the structure of processes. It extends earlier work on compositional reasoning within the modal µcalculus and com ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
We present a proof system for determining satisfaction between processes in a fairly general process algebra and assertions of the modal µcalculus. The proof system is compositional in the structure of processes. It extends earlier work on compositional reasoning within the modal µcalculus and combines it with techniques from work on local model checking. The proof system is sound for all processes and complete for a class of finitestate processes.
unknown title
"... Abstract We present a proof system for determiningsatisfaction between processes in a fairly general process algebra and assertions of the modal _calculus. The proof system is compositional in the structure of processes. It extends earlier workon compositional reasoning within the modal _calculus ..."
Abstract
 Add to MetaCart
Abstract We present a proof system for determiningsatisfaction between processes in a fairly general process algebra and assertions of the modal _calculus. The proof system is compositional in the structure of processes. It extends earlier workon compositional reasoning within the modal _calculus and combines it with techniques from work on local model checking. The proof systemis sound for all processes and complete for a class of finitestate processes. 1 Introduction The propositional _calculus of Kozen [11] whichwas introduced as a powerful extension of propositional dynamic logic, has received growing interest as a logic for concurrent systems. This is mainly due to the expressiveness of the logic,which is known to subsume many modal and temporal logics, and the fact that very few operators are needed in achieving this: The logic is an extension of relativized, minimal modal logic K also known as HennessyMilner logic in theprocess algebra community with minimum and