495 research outputs found
Separation of Test-Free Propositional Dynamic Logics over Context-Free Languages
For a class L of languages let PDL[L] be an extension of Propositional
Dynamic Logic which allows programs to be in a language of L rather than just
to be regular. If L contains a non-regular language, PDL[L] can express
non-regular properties, in contrast to pure PDL.
For regular, visibly pushdown and deterministic context-free languages, the
separation of the respective PDLs can be proven by automata-theoretic
techniques. However, these techniques introduce non-determinism on the automata
side. As non-determinism is also the difference between DCFL and CFL, these
techniques seem to be inappropriate to separate PDL[DCFL] from PDL[CFL].
Nevertheless, this separation is shown but for programs without test operators.Comment: In Proceedings GandALF 2011, arXiv:1106.081
Practical Reasoning for Very Expressive Description Logics
Description Logics (DLs) are a family of knowledge representation formalisms
mainly characterised by constructors to build complex concepts and roles from
atomic ones. Expressive role constructors are important in many applications,
but can be computationally problematical. We present an algorithm that decides
satisfiability of the DL ALC extended with transitive and inverse roles and
functional restrictions with respect to general concept inclusion axioms and
role hierarchies; early experiments indicate that this algorithm is well-suited
for implementation. Additionally, we show that ALC extended with just
transitive and inverse roles is still in PSPACE. We investigate the limits of
decidability for this family of DLs, showing that relaxing the constraints
placed on the kinds of roles used in number restrictions leads to the
undecidability of all inference problems. Finally, we describe a number of
optimisation techniques that are crucial in obtaining implementations of the
decision procedures, which, despite the worst-case complexity of the problem,
exhibit good performance with real-life problems
Recommended from our members
A survey of induction algorithms for machine learning
Central to all systems for machine learning from examples is an induction algorithm. The purpose of the algorithm is to generalize from a finite set of training examples a description consistent with the examples seen, and, hopefully, with the potentially infinite set of examples not seen. This paper surveys four machine learning induction algorithms. The knowledge representation schemes and a PDL description of algorithm control are emphasized. System characteristics that are peculiar to a domain of application are de-emphasized. Finally, a comparative summary of the learning algorithms is presented
Actor Network Procedures as Psi-calculi for Security Ceremonies
The actor network procedures of Pavlovic and Meadows are a recent graphical
formalism developed for describing security ceremonies and for reasoning about
their security properties. The present work studies the relations of the actor
network procedures (ANP) to the recent psi-calculi framework. Psi-calculi is a
parametric formalism where calculi like spi- or applied-pi are found as
instances. Psi-calculi are operational and largely non-graphical, but have
strong foundation based on the theory of nominal sets and process algebras. One
purpose of the present work is to give a semantics to ANP through psi-calculi.
Another aim was to give a graphical language for a psi-calculus instance for
security ceremonies. At the same time, this work provides more insight into the
details of the ANPs formalization and the graphical representation.Comment: In Proceedings GraMSec 2014, arXiv:1404.163
Exploring the power of converse events
Dynamic epistemic logic as viewed by Baltag, Moss and Solecki (DEL) and propositional dynamic logic (PDL) offer different semantics of events. On the one hand, DEL adds dynamics to epistemic logic by introducing so-called event models as syntactic objects into the language. On the other hand, PDL has instead transition relations between possible worlds. This last approach allows to easily introduce converse events. In this paper we add epistemics to this, and call the resulting logic epistemic dynamic logic (EDL). We show that DEL can be translated into EDL thanks to this use of the converse operator: it enables us to translate the structure of the event model directly within a particular axiomatization of EDL, without having to refer to a particular epistemic event model in the language (as done in DEL). It follows that EDL is more expressive and general than DEL and we characterize semantically and syntactically in EDL this embedding of DEL
Determinism and looping in combinatory PDL
AbstractIn this paper some propositional modal logics of programs are considered, based on the system CPDL (Combinatory PDL)—an extension of PDL with proper names for states. These proper names are atomic formulae which are satisfied at exactly one state, in each model. Among other things (e.g., decidability and finite-model property results) a version of Streett's conjecture that his axioms do axiomatize the infinite repeating construct repeat is established with respect to CPDL
Continuous probability distributions in model-based specification languages
PhD ThesisModel-based speci cation languages provide a means for obtaining assurance of dependability
of complex computer-based systems, but provide little support for modelling and
analysing fault behaviour, which is inherently probabilistic in nature. In particular,
the need for a detailed account of the role of continuous probability has been largely
overlooked.
This thesis addresses the role of continuous probability in model-based speci cation
languages. A model-based speci cation language (sGCL) that supports continuous
probability distributions is de ned. The use of sGCL and how it interacts with engineering
practices is also explored. In addition, a re nement ordering for continuous
probability distributions is given, and the challenge of combining non-determinism and
continuous probability is discussed in depth.
The thesis is presented in three parts. The rst uses two case studies to explore the
use of probability in formal methods. The rst case study, on
ash memory, is used
to present the capabilities of probabilistic formal methods and to determine the kinds
of questions that require continuous probability distributions to answer. The second,
on an emergency brake system, illustrates the strengths and weaknesses of existing languages
and provides a basis for exploring a prototype language that includes continuous
probability.
The second part of the thesis gives the formal de nition of sGCL's syntax and semantics.
The semantics is made up of two parts, the proof theory (transformer semantics)
and the underpinning mathematics (relational semantics). The additional language
constructs and semantical features required to include non-determinism as well as continuous
probability are also discussed. The most challenging aspect lies in proving the
consistency of the semantics when non-determinism is also included.
The third part uses a nal case study, on an aeroplane pitch monitor, to demonstrate
the use of sGCL. The new analysis techniques provided by sGCL, and how they t in
with engineering practices, are explored.EPSRC:
The School of Computing Science, Newcastle University:
DEPLOY project
Well structured program equivalence is highly undecidable
We show that strict deterministic propositional dynamic logic with
intersection is highly undecidable, solving a problem in the Stanford
Encyclopedia of Philosophy. In fact we show something quite a bit stronger. We
introduce the construction of program equivalence, which returns the value
precisely when two given programs are equivalent on halting
computations. We show that virtually any variant of propositional dynamic logic
has -hard validity problem if it can express even just the equivalence
of well-structured programs with the empty program \texttt{skip}. We also show,
in these cases, that the set of propositional statements valid over finite
models is not recursively enumerable, so there is not even an axiomatisation
for finitely valid propositions.Comment: 8 page
- …