Sciweavers

498 search results - page 82 / 100
» A Formal Foundation for ODRL
Sort
View
ENTCS
2006
173views more  ENTCS 2006»
14 years 9 months ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal
CN
2007
88views more  CN 2007»
14 years 9 months ago
DMTP: Controlling spam through message delivery differentiation
Unsolicited commercial email, commonly known as spam, has become a pressing problem in today’s Internet. In this paper we re-examine the architectural foundations of the current...
Zhenhai Duan, Yingfei Dong, Kartik Gopalan
DAM
2007
85views more  DAM 2007»
14 years 9 months ago
Testing primitivity on partial words
Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in numerous research areas including formal language...
Francine Blanchet-Sadri, Arundhati R. Anavekar
JOT
2008
123views more  JOT 2008»
14 years 9 months ago
An MOF2-based Services Metamodel
As Service-Oriented Computing is gaining mainstream adoption, Services are emerging as core-building blocks of today's applications. In particular, web services have become t...
Harshavardhan Jegadeesan, Sundar Balasubramaniam
AI
1998
Springer
14 years 9 months ago
What Robots Can Do: Robot Programs and Effective Achievability
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot...
Fangzhen Lin, Hector J. Levesque