Results 61 to 70 of about 6,025 (211)
Verification of parallelising transformations of KPN models
IET Cyber-Physical Systems: Theory &Applications, Volume 4, Issue 3, Page 276-289, September 2019., 2019 Parallelising transformations of Kahn process networks (KPNs) are important mechanisms for achieving speedup for deployment on heterogeneous multiprocessor systems particularly in the domain of signal processing applications. Correctness of such parallelising transformations is crucial for their reliable applications.
Chandan Karfa +2 more
wiley +1 more source
Bisimulation, games, and logic
DAIMI Report Series, 1994 In a recent paper by Joyal, Nielsen, and Winskel, bisimulation is defined in an abstract and uniform way across a wide range of different models for concurrency. In this paper, following a recent trend in theoretical computer science, we characterize their abstract definition game-theoretically and logically in a non-interleaving model.
Nielsen, Mogens, Clausen, Christian
openaire +3 more sources
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
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
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
Computation Tree Logic with Deadlock Detection [PDF]
Logical Methods in Computer Science, 2009 We study the equivalence relation on states of labelled transition systems of satisfying the same formulas in Computation Tree Logic without the next state modality (CTL-X).
Rob van Glabbeek +2 more
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
Modelling the Embedded Control System Using iUML‐B Pattern State Machine
Journal of Control Science and Engineering, Volume 2018, Issue 1, 2018., 2018 Developing the formal model based on the Event‐B design pattern is an excellent method to improve the development efficiency of the embedded control system and improve the reusability of the formal model. However, the instantiation of the Event‐B design pattern requires the manual writing of a large number of model codes, which brings a great deal of ...
Han Peng +4 more
wiley +1 more source