A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Filters
Enforcing Integrity of Execution in Distributed Workflow Management Systems
2007
IEEE International Conference on Services Computing (SCC 2007)
Preserved Fulltext
{l n−i (O)} P K pol i+1 to b i+1 . ...
As a result, this flexible decentralized setting raises specific security requirements, such as the compliance of the overall sequence of operations with the pre-defined workflow execution plan, that are ...
In our approach, we map onion structures with workflow execution patterns in order to build proofs of execution and enforce access control on workflow data. ...
doi:10.1109/scc.2007.57
dblp:conf/IEEEscc/MontagutM07
fatcat:yrcgm5kfxzaljapxgk4xgt5jya
Task-Oriented Petri Net Models for Discrete Event Simulation
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Model structure and behavior conform to realities of railway control. ...
Systems are considered, in which arriving tasks are executed in alternative ways, according to the actual state of particular system resources. ...
A state Θ Θ Θ Θ ( τ τ τ τ ) of the net is defined by sets of tokens with data structures describing contents of places in a moment τ τ τ τ : Θ Θ Θ Θ ( τ τ τ τ )={Θ Θ Θ Θ ( p , τ τ τ τ ) p∈P} .( 9 ) The ...
doi:10.1007/3-540-46043-8_106
fatcat:znysieihrbcxlgwlutpl375ofy
Reactive Turing Machines with Infinite Alphabets
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We propose a notion of of nominal executability based on RTMs with atoms, and show that every effective transition system with atoms is nominally executable. ...
As a result, we define a notion of RTM with atoms. It is a more restricted variant of RTMs in which the sets of actions and data symbols are still allowed to be infinite. ...
We let π K be an arbitrary K-automorphism, and we show that π K (P) is an α-conversion of P, i.e., π K (P) = α P. We show it by a structural induction on P. ...
arXiv:1610.06552v3
fatcat:l4yvkjifdvc27grzpry4iiewt4
A Formal Approach for Business Processes Description, Customization and Automation
2013
Lecture Notes on Software Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Based on structured tokens Petri Net, the resulting workflow model can represent both control flow and shared data in the workflow process. ...
The importance of data in business processes has increased progressively in recent years motivated by the need for executable workflow models according to the process control rules. ...
The modeling phase starts with defining the exchanged information flows (data structures) between roles, the information system database or with other applications from the information system (see Fig. ...
doi:10.7763/lnse.2013.v1.5
fatcat:6b2d3qwofzft5jmzv4ok4pcyau
The Collection Virtual Machine: An Abstraction for Multi-Frontend Multi-Backend Data Analysis
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In recent years, the advent of data science with its increasingly numerous and complex types of analytics has made this challenge even more difficult. ...
In practice, system designers are overwhelmed by the number of combinations and typically implement only one analysis/platform combination, leading to repeated implementation effort -- and a plethora of ...
Similarly, the data structures used typically for linear algebra (both dense and sparse) are composed of arrays and structs, so we can express them with the same data types as shown in the table. ...
arXiv:2004.01908v2
fatcat:7k2svf6sobghrexr7oaaaezgeu
Trace-based decision making in interactive application: Case of Tamagotchi systems
2014
2014 International Conference on Control, Decision and Information Technologies (CoDIT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Each situation confines activities and interactions related to a common context, resources and system actors. ...
We present our exploratory work for situation preselecting in interactive applications, assuming that the application is an Interactive Adaptive System based on a sequence of contextualized "situations ...
pro k / sit _ i ( ) k=1 m ∏ (3) Then, we obtain a set of posteriori probabilities and we compute the probability for each situation with: P sit _ i ( ) = posterior sit _ i ( ) posterior sit _ i ( ) i= ...
doi:10.1109/codit.2014.6996880
dblp:conf/codit/HoRNE14
fatcat:tes4gizhc5bh7i6h7tjtptx6pm
Towards a Theory for Testing Non-terminating Programs
2009
2009 33rd Annual IEEE International Computer Software and Applications Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Reasoning at the program semantics level permits to cope with infinite paths (and non-feasible paths) when defining test data adequacy criteria. ...
Though they are ubiquitous in real-world applications, testing these programs requires new theoretic developments as usual definitions of test data adequacy criteria ignore infinite paths. ...
Definition 8: (The poset of all sequences L ∞ ) Given an LTS associated with a program P , the poset of all sequences of P is defined as: L ∞ def = ∞ k=1 P(L k ) ∪ P( P / ∼) In general, the poset of all ...
doi:10.1109/compsac.2009.30
dblp:conf/compsac/GotliebP09
fatcat:vmpmobvocramrcyfebtpgnkefy
Symbolic Execution Techniques Extended to Systems
2009
2009 Fourth International Conference on Software Engineering Advances
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper presents a symbolic execution framework devoted to system models, recursively defined by interconnecting component models. ...
The paper introduces a small set of primitives dedicated to this purpose, together with their associated symbolic execution rules. ...
In the following, such data are modeled by means of a data specification SP = (Ω, ax) as defined in the appendix and supposed given in the sequel. ...
doi:10.1109/icsea.2009.21
dblp:conf/icsea/GastonABL09
fatcat:tymb7dztmjadzjr6q557dlngvi
An Abstract Object Oriented Runtime System for Heterogeneous Parallel Architecture
2013
2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
We validate our approach with a multiscale algorithm to solve partial derivative equations that we have implemented with this runtime system and benchmarked on various heterogeneous hardware architecture ...
In our paper we present an abstract object oriented runtime system that helps to develop scientific application for new hererogenous architecture based on multi-node of multi-core processors enhanced with ...
Task execution: When a task is executed, data user structures are recovered with a DataArgs object that stores data handlers and their access mode. ...
doi:10.1109/ipdpsw.2013.144
dblp:conf/ipps/Gratien13
fatcat:5th2hbd7yjbrxpa4ivtobhuzce
Run-time interpretation of information system application models in mobile cloud environments
2019
Computer Science and Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We propose an architectural framework for building the distributed information system applications in which the application models are directly interpreted during execution. ...
Our framework is based on a holistic application model represented as a graph structure complemented with a procedural action scripting language that can express more complex software behavior. ...
This work has been supported in part by Croatian Science Foundation's funding of the project UIP-2014-09-7945.
Run-time Interpretation of IS Models in Mobile Cloud ...
doi:10.2298/csis180829021t
fatcat:gajpseat3ba5xajuhjuxvorbmm
PList-based Divide and Conquer Parallel Programming
2020
Journal of Communications Software and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We also give a detailed description of the data structures and functions involved in the PLists extension of the JPLF, and extended performance experiments are described and analyzed. ...
In this paper we unveil new applications that emphasize the new class of computations that can be executed within the JPLF framework. ...
In this case the P List data structures are appropriate to be used, with a PosList formed by the prime factors of n: [r 1 , r 2 , . . . , r k ] . ...
doi:10.24138/jcomss.v16i2.1029
fatcat:aq4jqb3qxzfhlnizivvc5zokvq
Applying Testability Transformations to Achieve Structural Coverage of Erlang Programs
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We have developed a testing-technique that takes advantage of this tree-structure, which we demonstrate with respect to a small case study of an Erlang telephony system. ...
The challenge of achieving structural coverage can thus be interpreted as a tree-search procedure. ...
We're grateful to its academic and industrial members for input to this work and suggestions to improve the process. ...
doi:10.1007/978-3-642-05031-2_6
fatcat:6pudlgealzdpta5flyoebekzp4
Adaptive Data Stream Management System Using Learning Automata
2011
Advanced Computing An International Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Systems which are able to process data streams with such properties are called Data Stream Management Systems (DSMS). ...
In many modern applications, data are received as infinite, rapid, unpredictable and time-variant data elements that are known as data streams. ...
A learning automaton is separated into two groups with constant and variable structures [24, 25] . ...
doi:10.5121/acij.2011.2501
fatcat:vrrlhp7wtbay3bijvjp52lskpq
Method for assessing software reliability of the document management system using the RFID technology
2016
MATEC Web of Conferences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The deliberations presented in this study refer to the method for assessing software reliability of the document management system, using the RFID technology. ...
The knowledge of the reliability structure of the software makes it possible to properly plan the time and financial expenses necessary to build the software, which would meet the reliability requirements ...
It may be shown that the reliability indicator of the software R(R) with reliability structure R, understood as the probability of its proper execution for a single set of input data, is defined by formula ...
doi:10.1051/matecconf/20167604009
fatcat:gcezyntaxzgnvnc5kkzq2isbgu
Mathematical support and software for data processing in robotic neurocomputer systems
2018
MATEC Web of Conferences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We suggest analytical expressions for performance evaluation in neural computer information processing, aimed at development of methods, algorithms and software that optimize such systems. ...
The paper addresses classification and formal definition of neurocomputer systems for robotic complexes, based on the types of associations among their elements. ...
the state task of the Ministry of Education and Science of the Russian Federation No. 2.9519.2017 / BC on the topic "Technologies for parallel processing of data in neurocomputer devices and systems". ...
doi:10.1051/matecconf/201816103004
fatcat:jpdeiexvjfalbewf4cz3rbkdre
« Previous
Showing results 1 — 15 out of 440,108 results