Results 31 to 40 of about 21,948 (228)
Electronic Proceedings in Theoretical Computer Science, 2013 The paper explores properties of Łukasiewicz mu-calculus, a version of the quantitative/probabilistic modal mu-calculus containing both weak and strong conjunctions and disjunctions from Łukasiewicz (fuzzy) logic. We show that this logic encodes the well-
Matteo Mio, Alex Simpson
doaj +1 more source
A Two-Stage Multi-Objective Evolutionary Algorithm for Community Detection in Complex Networks
Mathematics, 2023 Community detection is a crucial research direction in the analysis of complex networks and has been shown to be an NP-hard problem (a problem that is at least as hard as the hardest problems in nondeterministic polynomial time).
Wenxin Zhu, Huan Li, Wenhong Wei
doaj +1 more source
A Local Logic for Realizability in Web Service Choreographies [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Web service choreographies specify conditions on observable interactions among the services. An important question in this regard is realizability: given a choreography C, does there exist a set of service implementations I that conform to C ?
R Ramanujam, S Sheerazuddin
doaj +1 more source
Syntactical characterization of nondeterministic logspace complexity class
Труды Института системного программирования РАН, 2018 NL is defined as the class of languages recognizable by logspace nondeterministic Turing machines. One of the main unsolved problems in complexity theory is that of relation between classes P and NL.
D. A. Nosov
doaj +1 more source
Известия высших учебных заведений. Поволжский регион: Физико-математические науки, 2021 Background. The study considers various aspects of constructing iterative anytime algorithms for solving the problem of state minimization of nondeterministic finite automata.
M.E. Abramyan
doaj +1 more source
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence [PDF]
Logical Methods in Computer Science, 2022 We provide a generic algorithm for constructing formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nondeterministic, probabilistic or weighted; genericity over the transition type is achieved by ...
Thorsten Wißmann +2 more
doaj +1 more source
Antichains for the Automata-Based Approach to Model-Checking [PDF]
Logical Methods in Computer Science, 2009 We propose and evaluate antichain algorithms to solve the universality and language inclusion problems for nondeterministic Buechi automata, and the emptiness problem for alternating Buechi automata. To obtain those algorithms, we establish the existence
Laurent Doyen, Jean-Francois Raskin
doaj +1 more source
On the complexity of solving linear congruences and computing nullspaces modulo a constant [PDF]
, 2013 We consider the problems of determining the feasibility of a linear congruence, producing a solution to a linear congruence, and finding a spanning set for the nullspace of an integer matrix, where each problem is considered modulo an arbitrary constant ...
de Beaudrap, Niel
core +1 more source
The parameterized space complexity of model-checking bounded variable first-order logic [PDF]
, 2019 The parameterized model-checking problem for a class of first-order sentences (queries) asks to decide whether a given sentence from the class holds true in a given relational structure (database); the parameter is the length of the sentence.
Chen, Yijia +2 more
core +3 more sources
Nondeterministic Moore automata and Brzozowski’s minimization algorithm
Theoretical Computer Science, 2012 A Moore automaton is a finite state machine where states are labeled by output symbols. Such an automaton defines the function that maps an input string to the output symbol labeling the last state of the run. This paper considers non-deterministic variants. The authors hence consider non-deterministic Moore automata (NMA), in which there could be many
CASTIGLIONE, Giuseppa +2 more
openaire +2 more sources