Sciweavers

238 search results - page 34 / 48
» Compositional Proof Methods for Concurrency: A Semantic Appr...
Sort
View
ESAW
2006
Springer
15 years 1 months ago
Modelling and Executing Complex and Dynamic Business Processes by Reification of Agent Interactions
Interaction refers to an abstract and intangible concept. In modelling, intangible concepts can be embodied and made explicit. This allows to manipulate the abstractions and to bui...
Marco Stuit, Nick B. Szirbik
FM
2008
Springer
127views Formal Methods» more  FM 2008»
14 years 11 months ago
A Schedulerless Semantics of TLM Models Written in SystemC Via Translation into LOTOS
TLM (Transaction-Level Modeling) was introduced to cope with the increasing complexity of Systems-on-Chip designs by raising the modeling level. Currently, TLM is primarily used fo...
Olivier Ponsini, Wendelin Serwe
APAL
2008
104views more  APAL 2008»
14 years 9 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
FM
2006
Springer
127views Formal Methods» more  FM 2006»
15 years 1 months ago
Using Domain-Independent Problems for Introducing Formal Methods
Abstract. The key to the integration of formal methods into engineering practice is education. In teaching, domain-independent problems -i.e., not requiring prior engineering backg...
Raymond T. Boute
TMM
2010
241views Management» more  TMM 2010»
14 years 4 months ago
Mining Compositional Features From GPS and Visual Cues for Event Recognition in Photo Collections
As digital cameras with Global Positioning System (GPS) capability become available and people geotag their photos using other means, it is of great interest to annotate semantic e...
Junsong Yuan, Jiebo Luo, Ying Wu