Results 1  10
of
12
The ProofTheory and Semantics of Intuitionistic Modal Logic
, 1994
"... Possible world semantics underlies many of the applications of modal logic in computer science and philosophy. The standard theory arises from interpreting the semantic definitions in the ordinary metatheory of informal classical mathematics. If, however, the same semantic definitions are interpret ..."
Abstract

Cited by 109 (0 self)
 Add to MetaCart
(Show Context)
Possible world semantics underlies many of the applications of modal logic in computer science and philosophy. The standard theory arises from interpreting the semantic definitions in the ordinary metatheory of informal classical mathematics. If, however, the same semantic definitions are interpreted in an intuitionistic metatheory then the induced modal logics no longer satisfy certain intuitionistically invalid principles. This thesis investigates the intuitionistic modal logics that arise in this way. Natural deduction systems for various intuitionistic modal logics are presented. From one point of view, these systems are selfjustifying in that a possible world interpretation of the modalities can be read off directly from the inference rules. A technical justification is given by the faithfulness of translations into intuitionistic firstorder logic. It is also established that, in many cases, the natural deduction systems induce wellknown intuitionistic modal logics, previously given by Hilbertstyle axiomatizations. The main benefit of the natural deduction systems over axiomatizations is their
Model checking partial state spaces with 3valued temporal logics
 In Computer Aided Verification
, 1999
"... ..."
(Show Context)
Presheaf Models for Concurrency
, 1999
"... In this dissertation we investigate presheaf models for concurrent computation. Our aim is to provide a systematic treatment of bisimulation for a wide range of concurrent process calculi. Bisimilarity is defined abstractly in terms of open maps as in the work of Joyal, Nielsen and Winskel. Their wo ..."
Abstract

Cited by 45 (19 self)
 Add to MetaCart
(Show Context)
In this dissertation we investigate presheaf models for concurrent computation. Our aim is to provide a systematic treatment of bisimulation for a wide range of concurrent process calculi. Bisimilarity is defined abstractly in terms of open maps as in the work of Joyal, Nielsen and Winskel. Their work inspired this thesis by suggesting that presheaf categories could provide abstract models for concurrency with a builtin notion of bisimulation. We show how
History Dependent Automata
, 2001
"... In this paper we present historydependent automata (HDautomata in brief). They are an extension of ordinary automata that overcomes their limitations in dealing with historydependent formalisms. In a historydependent formalism the actions that a system can perform carry information generated i ..."
Abstract

Cited by 32 (9 self)
 Add to MetaCart
In this paper we present historydependent automata (HDautomata in brief). They are an extension of ordinary automata that overcomes their limitations in dealing with historydependent formalisms. In a historydependent formalism the actions that a system can perform carry information generated in the past history of the system. The most interesting example is calculus: channel names can be created by some actions and they can then be referenced by successive actions. Other examples are CCS with localities and the historypreserving semantics of Petri nets. Ordinary
Petri Nets and Bisimulations
 THEORETICAL COMPUTER SCIENCE
, 1995
"... Several categorical relationships (adjunctions) between models for concurrency have been established, allowing the translation of concepts and properties from one model to another. A central example is a coreflection between Petri nets and asynchronous transition systems. The purpose of the pres ..."
Abstract

Cited by 16 (7 self)
 Add to MetaCart
(Show Context)
Several categorical relationships (adjunctions) between models for concurrency have been established, allowing the translation of concepts and properties from one model to another. A central example is a coreflection between Petri nets and asynchronous transition systems. The purpose of the present paper is to illustrate the use of such relationships by transferring to Petri nets a general concept of bisimulation.
HistoryDependent Automata
 ELECTR. NOTES IN TH. COMP. SCI
, 1998
"... In this paper we present historydependent automata (HDautomata in brief). They are an extension of ordinary automata that overcomes their limitations in dealing with historydependent formalisms. In a historydependent formalism the actions that a system can perform carry information generated in ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
In this paper we present historydependent automata (HDautomata in brief). They are an extension of ordinary automata that overcomes their limitations in dealing with historydependent formalisms. In a historydependent formalism the actions that a system can perform carry information generated in the past history of the system. The most interesting example is calculus: channel names can be created by some actions and they can then be referenced by successive actions. Other examples are CCS with localities and the historypreserving semantics of Petri nets. Ordinary automata are an unsatisfactory operational model for these formalisms: infinite automata are obtained for all the systems with in nite computations, even for very simple ones; moreover, the ordinary definition of bisimulation does not apply in these cases, thus preventing the reusage of standard theories and algorithms. In this paper we show that HDautomata are an adequate model for the historydependent formalisms. We pr...
On the Expressive Power of CTL*
 IN PROC. 14TH IEEE SYMP. LOGIC IN COMPUTER SCIENCE (LICS'99
, 1999
"... We show that the expressive power of the branching time logic CTL coincides with that of the class of bisimulation invariant properties expressible in socalled monadic path logic: monadic second order logic in which set quantification is restricted to paths. In order to prove this result, we first ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
We show that the expressive power of the branching time logic CTL coincides with that of the class of bisimulation invariant properties expressible in socalled monadic path logic: monadic second order logic in which set quantification is restricted to paths. In order to prove this result, we first prove a new Composition Theorem for trees. This approach is adapted from the approach of Hafer and Thomas in their proof that CTL coincides with the whole of monadic path logic over the class of full binary trees.
History Preserving Bisimulation for Contextual Nets ⋆
"... Abstract. We investigate the notion of history preserving bisimulation [15,18,3] for contextual P/T nets, a generalization of ordinary P/T Petrinetswhereatransitionmaycheckforthepresenceoftokenswithout consuming them (nondestructive read operations). A first equivalence, simply called HPbisimulati ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We investigate the notion of history preserving bisimulation [15,18,3] for contextual P/T nets, a generalization of ordinary P/T Petrinetswhereatransitionmaycheckforthepresenceoftokenswithout consuming them (nondestructive read operations). A first equivalence, simply called HPbisimulation, is based on Winskel’s prime event structures. A finer equivalence, called RHPbisimulation (where “R ” stands for “read”), relies on asymmetric event structures [1], a generalization of prime event structures which gives a more faithful account of the dependencies among transition occurrences arising in contextual net computations. Extending the work in [11,19], we show that HPbisimulation is decidable for finite nsafe contextual nets. Moreover by resorting to causal automata [12] — a variation of ordinary automata introduced to deal with history dependent formalisms — we can obtain an algorithm for deciding HPbisimulation and for getting a minimal realization. Decidability of RHPbisimulation, instead, remains an open question. 1
Bisimulation Quantified Modal Logics: Decidability
"... abstract. Bisimulation quantifiers are a natural extension of modal logics. They preserve the bisimulation invariance of modal logic, while allowing monadic secondorder expressivity. Unfortunately, it is not the case that extension by bisimulation quantifiers always preserves the decidability of a ..."
Abstract
 Add to MetaCart
(Show Context)
abstract. Bisimulation quantifiers are a natural extension of modal logics. They preserve the bisimulation invariance of modal logic, while allowing monadic secondorder expressivity. Unfortunately, it is not the case that extension by bisimulation quantifiers always preserves the decidability of a modal logic. Here we examine a general class of modal logics for which decidability is preserved under extension by bisimulation quantifiers.
Compiled Labelled Deductive Systems for Access Control
"... abstract. This paper proposes a Compiled Labelled Deductive System, called ACCLDS, for reasoning about rolebased access control in distributed systems, which builds upon Massacci’s tableau system for rolebased access control. The ACCLDS system overcomes some of the limitations of Massaci’s approac ..."
Abstract
 Add to MetaCart
(Show Context)
abstract. This paper proposes a Compiled Labelled Deductive System, called ACCLDS, for reasoning about rolebased access control in distributed systems, which builds upon Massacci’s tableau system for rolebased access control. The ACCLDS system overcomes some of the limitations of Massaci’s approach by combining its multimodal propositional language with a labelling algebra that allows reasoning explicitly about dynamic properties of the accessibility relations. This combined feature, which is typical of the Compiled Labelled Deductive framework, facilitates a sound and complete, and more natural ACCLDS reasoning mechanism than Massacci’s sound and only partially complete tableau system. Limitations of the usefulness of Massacci’s multimodal logic in formalising access control systems are also discussed, showing that they relate to the initial formulation of Abadi’s calculus for access control. Solutions for overcoming these limitations are briefly proposed within the context of the ACCLDS system. 1