Zobrazeno 1 - 10
of 166
pro vyhledávání: '"Valmari, Antti"'
Autor:
Valmari, Antti, Hella, Lauri
Publikováno v:
Notre Dame J. Formal Logic 64(1): 61--93 (February 2023)
We provide a sound and complete proof system for an extension of Kleene's ternary logic to predicates. The concept of theory is extended with, for each function symbol, a formula that specifies when the function is defined. The notion of "is defined"
Externí odkaz:
http://arxiv.org/abs/2112.04436
Publikováno v:
Logical Methods in Computer Science, Volume 17, Issue 3 (July 21, 2021) lmcs:7038
One of the most popular state-space reduction techniques for model checking is partial-order reduction (POR). Of the many different POR implementations, stubborn sets are a very versatile variant and have thus seen many different applications over th
Externí odkaz:
http://arxiv.org/abs/2012.15704
Publikováno v:
FoSSaCS 2020, vol. 12077 of LNCS, pp. 482-501
In model checking, partial-order reduction (POR) is an effective technique to reduce the size of the state space. Stubborn sets are an established variant of POR and have seen many applications over the past 31 years. One of the early works on stubbo
Externí odkaz:
http://arxiv.org/abs/1910.09829
Autor:
Valmari, Antti
Publikováno v:
CEUR Workshop Proceedings Vol-1525 2015, pp. 91-105
This publication introduces A State Space Exploration Tool that is based on representing the model under verification as a piece of C++ code that obeys certain conventions. Its name is ASSET. Model checking takes place by compiling the model and the
Externí odkaz:
http://arxiv.org/abs/1504.02597
Autor:
Valmari, Antti
Publikováno v:
ACSD 2015, 15th IEEE International Conference on Application of Concurrency to System Design, pp. 10-19
A system is AG EF terminating, if and only if from every reachable state, a terminal state is reachable. This publication argues that it is beneficial for both catching non-progress errors and stubborn set state space reduction to try to make verific
Externí odkaz:
http://arxiv.org/abs/1504.02587
Autor:
Valmari, Antti
Publikováno v:
EPTCS 151, 2014, pp. 355-369
A rather easy yet rigorous proof of a version of G\"odel's first incompleteness theorem is presented. The version is "each recursively enumerable theory of natural numbers with 0, 1, +, *, =, logical and, logical not, and the universal quantifier eit
Externí odkaz:
http://arxiv.org/abs/1402.7253
Autor:
Valmari, Antti
Publikováno v:
Logical Methods in Computer Science, Volume 9, Issue 4 (November 12, 2013) lmcs:858
The detailed behaviour of a system is often represented as a labelled transition system (LTS) and the abstract behaviour as a stuttering-insensitive semantic congruence. Numerous congruences have been presented in the literature. On the other hand, t
Externí odkaz:
http://arxiv.org/abs/1310.8408
Autor:
Valmari, Antti
Publikováno v:
Acta Cybernetica 21 (2014) 307--330
Although the halting problem is undecidable, imperfect testers that fail on some instances are possible. Such instances are called hard for the tester. One variant of imperfect testers replies "I don't know" on hard instances, another variant fails t
Externí odkaz:
http://arxiv.org/abs/1307.7066
Autor:
Valmari, Antti, Lehtinen, Petri
Publikováno v:
Dans Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, Bordeaux : France (2008)
Let PT-DFA mean a deterministic finite automaton whose transition relation is a partial function. We present an algorithm for minimizing a PT-DFA in $O(m \lg n)$ time and $O(m+n+\alpha)$ memory, where $n$ is the number of states, $m$ is the number of
Externí odkaz:
http://arxiv.org/abs/0802.2826
Autor:
Valmari, Antti1 (AUTHOR) antti.valmari@jyu.fi
Publikováno v:
Acta Informatica. Oct2020, Vol. 57 Issue 3-5, p353-383. 31p.
