4,117 research outputs found
Fragments and frame classes:Towards a uniform proof theory for modal fixed point logics
This thesis studies the proof theory of modal fixed point logics. In particular, we construct proof systems for various fragments of the modal mu-calculus, interpreted over various classes of frames. With an emphasis on uniform constructions and general results, we aim to bring the relatively underdeveloped proof theory of modal fixed point logics closer to the well-established proof theory of basic modal logic. We employ two main approaches. First, we seek to generalise existing methods for basic modal logic to accommodate fragments of the modal mu-calculus. We use this approach for obtaining Hilbert-style proof systems. Secondly, we adapt existing proof systems for the modal mu-calculus to various classes of frames. This approach yields proof systems which are non-well-founded, or cyclic.The thesis starts with an introduction and some mathematical preliminaries. In Chapter 3 we give hypersequent calculi for modal logic with the master modality, building on work by Ori Lahav. This is followed by an Intermezzo, where we present an abstract framework for cyclic proofs, in which we give sufficient conditions for establishing the bounded proof property. In Chapter 4 we generalise existing work on Hilbert-style proof systems for PDL to the level of the continuous modal mu-calculus. Chapter 5 contains a novel cyclic proof system for the alternation-free two-way modal mu-calculus. Finally, in Chapter 6, we present a cyclic proof system for Guarded Kleene Algebra with Tests and take a first step towards using it to establish the completeness of an algebraic counterpart
Decomposing GR(1) Games with Singleton Liveness Guarantees for Efficient Synthesis
Temporal logic based synthesis approaches are often used to find trajectories
that are correct-by-construction for tasks in systems with complex behavior.
Some examples of such tasks include synchronization for multi-agent hybrid
systems, reactive motion planning for robots. However, the scalability of such
approaches is of concern and at times a bottleneck when transitioning from
theory to practice. In this paper, we identify a class of problems in the GR(1)
fragment of linear-time temporal logic (LTL) where the synthesis problem allows
for a decomposition that enables easy parallelization. This decomposition also
reduces the alternation depth, resulting in more efficient synthesis. A
multi-agent robot gridworld example with coordination tasks is presented to
demonstrate the application of the developed ideas and also to perform
empirical analysis for benchmarking the decomposition-based synthesis approach
SPDL Model Checking via Property-Driven State Space Generation
In this report we describe how both, memory and time requirements for stochastic model checking of SPDL (stochastic propositional dynamic logic) formulae can significantly be reduced. SPDL is the stochastic extension of the multi-modal program logic PDL.\ud
SPDL provides means to specify path-based properties with or without timing restrictions. Paths can be characterised by so-called programs, essentially regular expressions, where the executability can be made dependent on the validity of test formulae. For model-checking SPDL path formulae it is necessary to build a product transition system (PTS)\ud
between the system model and the program automaton belonging to the path formula that is to be verified.\ud
In many cases, this PTS can be drastically reduced during the model checking procedure, as the program restricts the number of potentially satisfying paths. Therefore, we propose an approach that directly generates the reduced PTS from a given SPA specification and an SPDL path formula.\ud
The feasibility of this approach is shown through a selection of case studies, which show enormous state space reductions, at no increase in generation time.\u
Geometry of Discrete Quantum Computing
Conventional quantum computing entails a geometry based on the description of
an n-qubit state using 2^{n} infinite precision complex numbers denoting a
vector in a Hilbert space. Such numbers are in general uncomputable using any
real-world resources, and, if we have the idea of physical law as some kind of
computational algorithm of the universe, we would be compelled to alter our
descriptions of physics to be consistent with computable numbers. Our purpose
here is to examine the geometric implications of using finite fields Fp and
finite complexified fields Fp^2 (based on primes p congruent to 3 mod{4}) as
the basis for computations in a theory of discrete quantum computing, which
would therefore become a computable theory. Because the states of a discrete
n-qubit system are in principle enumerable, we are able to determine the
proportions of entangled and unentangled states. In particular, we extend the
Hopf fibration that defines the irreducible state space of conventional
continuous n-qubit theories (which is the complex projective space CP{2^{n}-1})
to an analogous discrete geometry in which the Hopf circle for any n is found
to be a discrete set of p+1 points. The tally of unit-length n-qubit states is
given, and reduced via the generalized Hopf fibration to DCP{2^{n}-1}, the
discrete analog of the complex projective space, which has p^{2^{n}-1}
(p-1)\prod_{k=1}^{n-1} (p^{2^{k}}+1) irreducible states. Using a measure of
entanglement, the purity, we explore the entanglement features of discrete
quantum states and find that the n-qubit states based on the complexified field
Fp^2 have p^{n} (p-1)^{n} unentangled states (the product of the tally for a
single qubit) with purity 1, and they have p^{n+1}(p-1)(p+1)^{n-1} maximally
entangled states with purity zero.Comment: 24 page
Cyclic proof systems for modal fixpoint logics
This thesis is about cyclic and ill-founded proof systems for modal fixpoint logics, with and without explicit fixpoint quantifiers.Cyclic and ill-founded proof-theory allow proofs with infinite branches or paths, as long as they satisfy some correctness conditions ensuring the validity of the conclusion. In this dissertation we design a few cyclic and ill-founded systems: a cyclic one for the weak Grzegorczyk modal logic K4Grz, based on our explanation of the phenomenon of cyclic companionship; and ill-founded and cyclic ones for the full computation tree logic CTL* and the intuitionistic linear-time temporal logic iLTL. All systems are cut-free, and the cyclic ones for K4Grz and iLTL have fully finitary correctness conditions.Lastly, we use a cyclic system for the modal mu-calculus to obtain a proof of the uniform interpolation property for the logic which differs from the original, automata-based one
- ā¦