Sciweavers

18 search results - page 4 / 4
» Foundations of Concurrent Kleene Algebra
Sort
View
ICFEM
2007
Springer
15 years 9 months ago
Testing for Refinement in CSP
Abstract. CSP is a well-established formalism for modelling and verification of concurrent reactive systems based on refinement. Consolidated denotational models and an effective t...
Ana Cavalcanti, Marie-Claude Gaudel
LICS
1998
IEEE
15 years 9 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
173
Voted
WADT
1999
Springer
15 years 10 months ago
From States to Histories
Based on the FOCUS theory of distributed systems (see [Broy, Stølen 01]) that are composed of interacting components we introduce a formal model of services and layered architectu...
Manfred Broy