Allen Linear (Interval) Temporal Logic --Translation to LTL and Monitor Synthesis-- [PDF]
, 2006 The relationship between two well established formalisms for temporal reasoning is first investigated, namely between Allen's interval algebra (or Allen's temporal logic, abbreviated \ATL) and linear temporal logic (\LTL).
A. Pnueli +6 more
core +1 more source
On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems [PDF]
, 2006 We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual convergence of
A. Arnold +25 more
core +2 more sources
Forward Analysis for WSTS, Part III: Karp-Miller Trees [PDF]
, 2020 This paper is a sequel of "Forward Analysis for WSTS, Part I: Completions" [STACS 2009, LZI Intl. Proc. in Informatics 3, 433-444] and "Forward Analysis for WSTS, Part II: Complete WSTS" [Logical Methods in Computer Science 8(3), 2012].
Blondin, Michael +2 more
core +3 more sources
Forking and independence for fragments of Jonsson sets
BULLETIN OF THE KARAGANDA UNIVERSITY-MATHEMATICS, 2018 The concept of independence plays a very important role in Model Theory for classification of a fixed complete theory. In this paper, we study the Jonsson theories, which, generally speaking, are not complete. For such theories, the concept of forking is introduced axiomatically in the framework of the study of the Jonsson subsets of the semantic model
openaire +2 more sources
About central types and the cosemanticness of the ∆-PM fragment of the Jonsson set
BULLETIN OF THE KARAGANDA UNIVERSITY-MATHEMATICS, 2017 This article is concerned with the enrichment of the signature. In own time, when studying the stability of the theory and the concept of an elementary pair of models, Mustafin T.G. had noticed that these things are related to each other and he introduced the concept T ∗-stability [1]. In fact, some enrichment of the signature is considered.
openaire +2 more sources
Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions [PDF]
, 2014 Probabilistic nondeterministic processes are commonly modeled as probabilistic LTSs (PLTSs). A number of logical characterizations of the main behavioral relations on PLTSs have been studied.
Crafa, Silvia, Ranzato, Francesco
core +1 more source
Efficient First-Order Temporal Logic for Infinite-State Systems [PDF]
, 2007 In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variety of first-order temporal logic that is both powerful enough for this form of ...
Dixon, Clare +3 more
core +2 more sources
The Complexity of Planning Problems With Simple Causal Graphs
, 2011 We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate plans for the class 3S of planning problems with binary state variables and ...
Giménez, Omer, Jonsson, Anders
core +1 more source
Genetic Diversity, Phylogenetics and Molecular Systematics of Guizotia Cass. (Asteraceae) [PDF]
, 2007 The genus Guizotia belongs to the tribe Heliantheae in the family Asteraceae. It has been placed under different subtribes. The genus has its center of origin, distribution and genetic diversity in Ethiopia, where G.
Geleta, Mulatu
core
A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes
, 2009 We propose a framework for reasoning about unbounded dynamic networks of infinite-state processes. We propose Constrained Petri Nets (CPN) as generic models for these networks.
Ahmed Bouajjani +11 more
core +1 more source