1,781 research outputs found
Real-time and Probabilistic Temporal Logics: An Overview
Over the last two decades, there has been an extensive study on logical
formalisms for specifying and verifying real-time systems. Temporal logics have
been an important research subject within this direction. Although numerous
logics have been introduced for the formal specification of real-time and
complex systems, an up to date comprehensive analysis of these logics does not
exist in the literature. In this paper we analyse real-time and probabilistic
temporal logics which have been widely used in this field. We extrapolate the
notions of decidability, axiomatizability, expressiveness, model checking, etc.
for each logic analysed. We also provide a comparison of features of the
temporal logics discussed
Fifty years of Hoare's Logic
We present a history of Hoare's logic.Comment: 79 pages. To appear in Formal Aspects of Computin
Lukasiewicz mu-Calculus
We consider state-based systems modelled as coalgebras whose type incorporates branching, and show that by suitably adapting the definition of coalgebraic bisimulation, one obtains a general and uniform account of the linear-time behaviour of a state in such a coalgebra. By moving away from a boolean universe of truth values, our approach can measure the extent to which a state in a system with branching is able to exhibit a particular linear-time behaviour. This instantiates to measuring the probability of a specific behaviour occurring in a probabilistic system, or measuring the minimal cost of exhibiting a specific behaviour in the case of weighted computations
Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory
There are two fundamentally different approaches to specifying and verifying
properties of systems. The logical approach makes use of specifications given
as formulae of temporal or modal logics and relies on efficient model checking
algorithms; the behavioural approach exploits various equivalence or refinement
checking methods, provided the specifications are given in the same formalism
as implementations.
In this paper we provide translations between the logical formalism of
Hennessy-Milner logic with greatest fixed points and the behavioural formalism
of disjunctive modal transition systems. We also introduce a new operation of
quotient for the above equivalent formalisms, which is adjoint to structural
composition and allows synthesis of missing specifications from partial
implementations. This is a substantial generalisation of the quotient for
deterministic modal transition systems defined in earlier papers
Model Checking Classes of Metric LTL Properties of Object-Oriented Real-Time Maude Specifications
This paper presents a transformational approach for model checking two
important classes of metric temporal logic (MTL) properties, namely, bounded
response and minimum separation, for nonhierarchical object-oriented Real-Time
Maude specifications. We prove the correctness of our model checking
algorithms, which terminate under reasonable non-Zeno-ness assumptions when the
reachable state space is finite. These new model checking features have been
integrated into Real-Time Maude, and are used to analyze a network of medical
devices and a 4-way traffic intersection system.Comment: In Proceedings RTRTS 2010, arXiv:1009.398
- …