Results 71 to 80 of about 13,172 (205)
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
Multi‐Agent Reinforcement Learning for Cyber Defence Transferability and Scalability
Applied AI Letters, Volume 7, Issue 1, February 2026.A method for using mutli‐agent reinforcement learning that allows for zero shot transfer across network setups. Diagrams show the local observation construction, training and agent mapping process. The results for novel 15 and 30 node networks show effective transfer and improved scaling performance. ABSTRACT Reinforcement learning (RL) has shown to be
Andrew Thomas +2 more
wiley +1 more source
Scientific Programming, Volume 2019, Issue 1, 2019., 2019 The miniaturization and price reduction of sensors have encouraged the proliferation of smart environments, in which multitudinous sensors detect and describe the activities carried out by inhabitants. In this context, the recognition of activities of daily living has represented one of the most developed research areas in recent years.
Alberto G. Salguero +5 more
wiley +1 more source
Bisimulation Trees and the Decidability of Weak Bisimulations
Electronic Notes in Theoretical Computer Science, 1997 AbstractWe develop “bisimulation trees” as a means to prove decidability of weak bisimulation for restricted classes of BPP and BPA.
openaire +1 more source
Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge [PDF]
Logical Methods in Computer Science, 2005 This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a finite equational axiomatization over the process algebra obtained by adding an auxiliary operation proposed by Hennessy in 1981 to the recursion ...
Luca Aceto +3 more
doaj +1 more source
The Complexity of Bisimulation and Simulation on Finite Systems
, 2018 In this paper the computational complexity of the (bi)simulation problem over restricted graph classes is studied. For trees given as pointer structures or terms the (bi)simulation problem is complete for logarithmic space or NC$^1$, respectively.
Ganardi, Moses +2 more
core +2 more sources
Three Algorithms for Parallel Graph Summarization
Expert Systems, Volume 43, Issue 1, January 2026.ABSTRACT Most graph summarization algorithms are tailored to a specific graph summary model and were designed for one‐time computations only, that is, batch‐based computations. We developed a universal approach for parallel graph summarization and three algorithms to compute graph summaries—a batch‐based algorithm for static graphs, an incremental ...
Till Blume +3 more
wiley +1 more source
Memoryless Systems Generate the Class of all Discrete Systems
International Journal of Mathematics and Mathematical Sciences, Volume 2019, Issue 1, 2019., 2019 Automata are machines, which receive inputs, accordingly update their internal state, and produce output, and are a common abstraction for the basic building blocks used in engineering and science to describe and design complex systems. These arbitrarily simple machines can be wired together—so that the output of one is passed to another as its input ...
Erwan Beurier +3 more
wiley +1 more source
Algebra, coalgebra, and minimization in polynomial differential equations [PDF]
Logical Methods in Computer Science, 2019 We consider reasoning and minimization in systems of polynomial ordinary differential equations (ode's). The ring of multivariate polynomials is employed as a syntax for denoting system behaviours.
Michele Boreale
doaj +1 more source
From abstraction to reality: DARPA's vision for robust sim‐to‐real autonomy
AI Magazine, Volume 46, Issue 2, Summer 2025.Abstract The DARPA Transfer from Imprecise and Abstract Models to Autonomous Technologies (TIAMAT) program aims to address rapid and robust transfer of autonomy technologies across dynamic and complex environments, goals, and platforms. Existing methods for simulation‐to‐reality (sim‐to‐real) transfer often rely on high‐fidelity simulations and ...
Erfaun Noorani +3 more
wiley +1 more source