64,421 research outputs found
A Formal Model of QoS-Aware Web Service Orchestration Engine
QoS-aware applications can satisfy not only the functional requirements of
the customers, but also the QoS requirements. QoS-aware Web Service
orchestration translates the QoS requirements of the customers into those of
its component Web Services. In a system viewpoint, we discuss issues on
QoS-aware Web Service orchestration and design a typical QoS-aware Web Service
orchestration engine called QoS-WSOE. More importantly, we establish a formal
model of QoS-WSOE based on actor systems theory. Within the formal model, we
use a three-layered pyramidal structure to capture the requirements of the
customers with a concept named QoS-Aware WSO Service, characteristics of
QoS-WSOE with a concept named QoS-Aware WSO System, and structures and
behaviors of QoS-WSOE with a concept named QoS-Aware WSO Behavior. Conclusions
showing that a system with QoS-Aware WSO Behavior is a QoS-Aware WSO System and
further can provide QoS-Aware WSO Service are drawn
Reversible Truly Concurrent Process Algebra
We design a reversible version of truly concurrent process algebra CTC which
is called RCTC. It has good properties modulo several kinds of strongly
forward-reverse truly concurrent bisimulations and weakly forward-reverse truly
concurrent bisimulations. These properties include monoid laws, static laws,
new expansion law for strongly forward-reverse truly concurrent bisimulations,
\tau laws for weakly forward-reverse truly concurrent bisimulations, and
congruences for strongly and weakly forward-reverse truly concurrent
bisimulations.Comment: 40 pages. arXiv admin note: substantial text overlap with
arXiv:1410.5131, arXiv:1611.09035, arXiv:1703.0015
The Equivariant Noncommutative Atiyah-Patodi-Singer Index Theorem
In [Wu], the noncommutative Atiyah-Patodi-Singer index theorem was proved. In
this paper, we extend this theorem to the equivariant case.Comment: to appear in K-Theor
The spectral action for sub-Dirac operators
In this paper, for foliations with spin leaves, we compute the spectral
action for sub-Dirac operators
A note on equivariant eta forms
In this note, we prove the regularity of eta forms by the Clifford
asymptotics. Then we generalize this result to the equivariant case
Weakly True Concurrency and Its Logic
We firstly find the existence of silent event in true concurrency
(named weakly true concurrency) by defining weakly true concurrent behaviors
and weakly true concurrent logics. Based on Paolo Baldan and Silvia Crafa's
comprehensive work on (strongly) true concurrency, we find the correspondence
between weakly true concurrent equivalences and weakly true concurrent logics.Comment: arXiv admin note: text overlap with arXiv:1110.4094 by other author
An Algebraic Approach for Approximity
Comparison to traditionally accurate computing, approximate computing focuses
on the rapidity of the satisfactory solution, but not the unnecessary accuracy
of the solution. Approximate bisimularity is the approximate one corresponding
to traditionally accurate bisimilarity. Based on the work of distances between
basic processes, we propose an algebraic approach for distances between
processes to support a whole process calculus CCS, which contains prefix, sum,
composition, restriction, relabeling and recursion
Truly Concurrent Process Algebra to Unifying Quantum and Classical Computing
Based on our previous work on truly concurrent process algebra, we use it to
unify quantum and classical computing for open and closed quantum systems. This
resulted algebra can be used to verify the behaviors of quantum and classical
computing mixed systems, with a flavor of true concurrency
A Process Algebra for Games
Using formal tools in computer science to describe games is an interesting
problem. We give games, exactly two person games, an axiomatic foundation based
on the process algebra ACP (Algebra of Communicating Process). A fresh operator
called opponent's alternative composition operator (OA) is introduced into ACP
to describe game trees and game strategies, called GameACP. And its sound and
complete axiomatic system is naturally established. To model the outcomes of
games (the co-action of the player and the opponent), correspondingly in
GameACP, the execution of GameACP processes, another operator called playing
operator (PO) is extended into GameACP. We also establish a sound and complete
axiomatic system for PO. To overcome the new occurred non-determinacy
introduced by GameACP, we extend truly concurrent process algebra APTC for
games called GameAPTC. Finally, we give the correctness theorem between the
outcomes of games and the deductions of GameACP and GameAPTC processes.Comment: 24 pages, 16 figure
Multiply twisted products
In this paper, we compute the index form of the multiply twisted products. We
study the Killing vector fields on the multiply twisted product manifolds and
determine the Killing vector fields in some cases. We compute the curvature of
the multiply twisted products with a semi-symmetric metric connection and show
that the mixed Ricci-flat multiply twisted products with a semi-symmetric
metric connection can be expressed as multiply warped products. We also study
the Einstein multiply warped products with a semi-symmetric metric connection
and the multiply warped products with a semi-symmetric metric connection with
constant scalar curvature, we apply our results to generalized Robertson-Walker
spacetimes with a semi-symmetric metric connection and generalized Kasner
spacetimes with a semi-symmetric metric connection and find some new examples
of Einstein affine manifolds and affine manifolds with constant scalar
curvature. We also consider the multiply twisted product Finsler manifolds and
we get some interesting properties of these spaces.Comment: 45page
- …