Results 1  10
of
13
Fast Meldable Priority Queues
, 1995
"... We present priority queues that support the operations MakeQueue, FindMin, Insert and Meld in worst case time O(1) and Delete and DeleteMin in worst case time O(log n). They can be implemented on the pointer machine and require linear space. The time bounds are optimal for all implementations wh ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
We present priority queues that support the operations MakeQueue, FindMin, Insert and Meld in worst case time O(1) and Delete and DeleteMin in worst case time O(log n). They can be implemented on the pointer machine and require linear space. The time bounds are optimal for all implementations where Meld takes worst case time o(n).
On the proof theory of modal mucalculus
 Studia Logica
, 2008
"... We study the prooftheoretic relationship between two deductive systems for the modal mucalculus. First we recall an infinitary system which contains an omega rule allowing to derive the truth of a greatest fixed point from the truth of each of its (infinitely many) approximations. Then we recall a ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We study the prooftheoretic relationship between two deductive systems for the modal mucalculus. First we recall an infinitary system which contains an omega rule allowing to derive the truth of a greatest fixed point from the truth of each of its (infinitely many) approximations. Then we recall a second infinitary calculus which is based on nonwellfounded trees. In this system proofs are finitely branching but may contain infinite branches as long as some greatest fixed point is unfolded infinitely often along every branch. The main contribution of our paper is a translation from proofs in the first system to proofs in the second system. Completeness of the second system then follows from completeness of the first, and a new proof of the finite model property also follows as corollary. 1
The Modal µCalculus and the Logic of Common Knowledge
 PHD THESIS, INSTITUT FÜR INFORMATIK UND ANGEWANDTE MATHEMATIK, UNIVERSITÄT
, 2002
"... ..."
Canonical completeness of infinitary µ
 Submitted. Address Thomas Studer Institut für Informatik und angewandte Mathematik, Universität Bern Neubrückstrasse 10, CH3012
"... This paper presents a new model construction for a natural cutfree infinitary version K + ω (µ) of the propositional modal µcalculus. Based on that the completeness of K + ω (µ) and the related system Kω(µ) can be established directly – no detour, for example through automata theory, is needed. As ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This paper presents a new model construction for a natural cutfree infinitary version K + ω (µ) of the propositional modal µcalculus. Based on that the completeness of K + ω (µ) and the related system Kω(µ) can be established directly – no detour, for example through automata theory, is needed. As a side result we also obtain a finite, cutfree sound and complete system for the propositional modal µcalculus. 1
Journal Applied Logic, 5(4):681–689, 2007.
"... This thesis provides an overview of my work on the proof theory for modal fixed point logics. In particular, it summarizes the main results of the following papers. 1. G. Jäger, M. Kretz, and T. Studer. Cutfree common knowledge. ..."
Abstract
 Add to MetaCart
This thesis provides an overview of my work on the proof theory for modal fixed point logics. In particular, it summarizes the main results of the following papers. 1. G. Jäger, M. Kretz, and T. Studer. Cutfree common knowledge.
STM 2006 Through modeling to synthesis of security automata 1
"... We define a set of process algebra operators, that we call controller operators, able to mimic the behavior of security automata introduced by Schneider in [17] and by Ligatti and al. in [3]. Security automata are mechanisms for enforcing security policies that specify acceptable executions of progr ..."
Abstract
 Add to MetaCart
We define a set of process algebra operators, that we call controller operators, able to mimic the behavior of security automata introduced by Schneider in [17] and by Ligatti and al. in [3]. Security automata are mechanisms for enforcing security policies that specify acceptable executions of programs. Here we give the semantics of four controllers that act by monitoring possible untrusted component of a system in order to enforce certain security policies. Moreover, exploiting satisfiability results for temporal logic, we show how to automatically build these controllers for a given security policy.
A Syntactical Treatment of Simultaneous Fixpoints in the Modal µCalculus
, 2007
"... We provide a purely syntactical treatment of simultaneous fixpoints in the modal µcalculus by proving directly in Kozen’s axiomatisation their properties as greatest and least fixpoints, that is, the fixpoint axiom and the induction rule. Further, we apply our result in order to get a completeness ..."
Abstract
 Add to MetaCart
We provide a purely syntactical treatment of simultaneous fixpoints in the modal µcalculus by proving directly in Kozen’s axiomatisation their properties as greatest and least fixpoints, that is, the fixpoint axiom and the induction rule. Further, we apply our result in order to get a completeness result for characteristic formulae of finite pointed transition systems. Keywords: Modal µcalculus, proof theory, Kozen’s axiomatisation, simultaneous fixpoints