Sciweavers

243 search results - page 42 / 49
» Process Algebra: An Algebraic Theory of Concurrency
Sort
View
TIM
2010
144views Education» more  TIM 2010»
14 years 4 months ago
Extending Polynomial Chaos to Include Interval Analysis
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
Antonello Monti, Ferdinanda Ponci, Marco Valtorta
MEMOCODE
2003
IEEE
15 years 2 months ago
Bridging CSP and C++ with Selective Formalism and Executable Specifications
CSP (Communicating Sequential Processes) is a useful algebraic notation for creating a hierarchical behavioural specification for concurrent systems, due to its formal interproces...
William B. Gardner
ISSTA
2009
ACM
15 years 2 months ago
Run-time conformance checking of mobile and distributed systems using executable models
This paper describes an approach for conformance testing of mobile and distributed systems. The approach is based on kiltera — a novel, high-level language supporting the descri...
Ahmad A. Saifan, Ernesto Posse, Jürgen Dingel
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
76
Voted
ENTCS
2008
120views more  ENTCS 2008»
14 years 9 months ago
Specifying and Executing Reactive Scenarios With Lutin
This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infini...
Pascal Raymond, Yvan Roux, Erwan Jahier