Executor Passive Model CompositeVSSS CompositeExecutor CompositeVSSS Model AtomicVSSS AtomicExecutor AtomicVSSS Model Fig. 3. Operational diagrams for abstract executors: CompositeExecutor and AtomicExecutor. transition functions and mapping functions. When the CompositeExecutor receives an inETRI Journal, volume 18, number 4, January 1997 Kyou H. Lee et al. 253 Fig. 4. Operational diagrams for...

We describe a formally well founded approach to link data and processes conceptually, based on adopting UML class diagrams to represent data, and BPMN to represent the process. The UML class diagram together with a set of additional process variables, called Artifact, form the information model of the process. All activities of the BPMN process refer to such an information model by means of OCL...

Hierarchical Task Networks (HTNs) are a family of powerful planning algorithms that have been successfully applied to many complex, real-world domains. However, they are limited to predictable domains. In this paper we present HOPPER (Hierarchical Ordered Partial-Plan Executor and Re-planner), a hierarchical planning agent that produces partial plans in a similar way to HTNs but can also handle...

RAPID is a run-time system that uses an inspector/executor approach to parallelize irregular computations by embodying graph scheduling techniques to optimize interleaved communication and computation with mixed granularities. It provides a set of library functions for specifying irregular data objects and tasks that access these objects, extracts a task dependence graph from data access patter...

Abstract GDart is an ensemble of tools allowing dynamic symbolic execution JVM programs. The engine decomposed into three different components: a decision (DSE), concolic executor (SPouT), and SMT solver backend meta-strategy solving problems (JConstraints). component loosely coupled with the by newly introduced communication protocol. At SV-COMP 2022, solved 471 586 tasks finding more correct ...

We present a small set of programming abstractions to simplify eecient implementations for block-structured scientiic calculations on SMP clusters. We have implemented these abstractions in KeLP 2.0, a C++ class library. KeLP 2.0 provides hierarchical SMPD control ow to manage two levels of parallelism and locality. Additionally, to tolerate slow inter-node communication costs, KeLP 2.0 combine...

Centralized robot soccer becomes more and more popular project of science and technology. Because of its global vision, the decision-making and motion control becomes the keystone and the multilevel hierarchical structure is suitable. The robot controller is the ’Brain-less’ executor, the motion controller includes all kinds of action functions and the organizing level can adopt different decis...

Applications that manipulate sparse data structures contain memory reference patterns that are unknown at compile time due to indirect accesses such as A[B[i]]. To exploit parallelism and improve locality in such applications, prior work has developed a number of run-time reordering transformations (RTRTs). This paper presents the Sparse Polyhedral Framework (SPF) for specifying RTRTs and compo...