Sciweavers

222 search results - page 11 / 45
» On the Refinement of Atomic Actions
Sort
View
AAAI
1998
13 years 10 months ago
An Algebra for Cyclic Ordering of 2D Orientations
Wedefine an algebra of ternary relations for cyclic ordering of 2Dorientations. Thealgebra (1) is a refinement of the CYCORDtheory; (2) contains 24 atomic relations, hence 224 gen...
Amar Isli, Anthony G. Cohn
ENTCS
2006
112views more  ENTCS 2006»
13 years 8 months ago
Interface Automata with Complex Actions
Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in componentbased systems, we ...
Shahram Esmaeilsabzali, Farhad Mavaddat, Nancy A. ...
BIRTHDAY
2004
Springer
14 years 2 months ago
A Trace Semantics for Long-Running Transactions
Abstract. A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be...
Michael J. Butler, C. A. R. Hoare, Carla Ferreira
FAC
2008
114views more  FAC 2008»
13 years 8 months ago
Specification of communicating processes: temporal logic versus refusals-based refinement
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
Gavin Lowe
ICCV
2011
IEEE
12 years 8 months ago
Parsing Video Events with Goal inference and Intent Prediction
In this paper, we present an event parsing algorithm based on Stochastic Context Sensitive Grammar (SCSG) for understanding events, inferring the goal of agents, and predicting th...
Mingtao Pei, School of Computer Science, Yunde Jia...