Skip to search formSkip to main contentSkip to account menu
Lightweight specification and analysis of dynamic systems with rich configurations
TLDR
Electrum is proposed, an extension of the Alloy specification language with temporal logic operators, where both rich configurations and expressive temporal properties can easily be defined, and two alternative model-checking techniques are proposed, one bounded and the other unbounded, to verify systems expressed in this language.
View on ACM
On Determinisation of Good-for-Games Automata
TLDR
The main results of this work answer the question whether parity GFG automata actually present an improvement in terms of state-complexity the number of states compared to the deterministic ones.
View via Publisher
Nondeterminism in the Presence of a Diverse or Unknown Future
TLDR
It is shown that GFT=GFG⊃DBP, and described a determinization construction for GFG automata, which shows the possible succinctness of GFG and GFT automata compared to deterministic automata.
View via Publisher
Büchi Good-for-Games Automata Are Efficiently Recognizable
Good-for-Games (GFG) automata offer a compromise between deterministic and nondetermin-istic automata. They can resolve nondeterministic choices in a step-by-step fashion, without needing any…
View via Publisher
Kleene Algebra with Hypotheses
TLDR
The Horn theory of star continuous Kleene algebras is characterised in terms of downward closed languages and it is shown that when restricting the shape of allowed hypotheses, the problems lie in various levels of the arithmetical or analytical hierarchy.
View via Publisher
Varieties of Cost Functions
TLDR
Eilenberg's varieties theorem and profinite equational characterisations of lattices of regular languages are generalised by generalising two results on regular languages to cost functions.
View via Publisher
On the Expressive Power of Cost Logics over Infinite Words
TLDR
This work develops this theory over infinite words, and shows that the classical results FO = LTL and MSO = WMSO also hold in this cost setting (where the equivalence is now up to ≈), and describes connections with forms of weak alternating automata with counters.
View via Publisher
Linear Temporal Logic for Regular Cost Functions
TLDR
This paper defines an extension of Linear Temporal Logic over finite words to describe cost functions, and gives an explicit translation from this new logic to two dual form of cost automata, and shows that the natural decision problems for this logic are PSPACE-complete, as it is the case in the classical setting.
View PDF on arXiv
Cyclic proofs, system t, and the power of contraction
TLDR
A cyclic proof system C over regular expression types, inspired by linear logic and non-wellfounded proof theory, is studied and it is proved that the two upper bounds on the expressivity of C are obtained: ACA0 and RCA0.
View on ACM
Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation
View via Publisher
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License