20 search results - page 3 / 4 » Deriving Weak Bisimulation Congruences from Reduction System... |
SAS
1999
Springer
13 years 11 months ago
1999
Springer
The intrinsic complexity of most protocol speci cations in particular, and of asynchronous systems in general, lead us to study combinations of static analysis with classical model...
TAPSOFT
1991
Springer
13 years 11 months ago
1991
Springer
Abstract. CBS is a simple and natural CCS-like calculus where processes speak one at a time and are heard instantaneously by all others. Speech is autonomous, contention between sp...
DAC
2005
ACM
14 years 8 months ago
2005
ACM
A rational Arnoldi method for passivity-preserving model-order reduction (MOR) with implicit multi-point moment matching for systems with frequency-dependent interconnects is desc...
ENTCS
1998
13 years 7 months ago
1998
We consider a generalisation of Larsen and Skou’s [19] reactive probabilistic transition systems which exhibit three kinds of choice: action-guarded probabilistic choice, extern...
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
Reactive systems, proposed by Leifer and Milner, represent a meta-framework aimed at deriving behavioral congruences for those specification formalisms whose operational semantics...