20 search results - page 2 / 4 » Deriving Weak Bisimulation Congruences from Reduction System... |
LICS
2000
IEEE
13 years 10 months ago
2000
IEEE
Concurrent ML is an extension of Standard ML with π-calculus-like primitives for multi-threaded programming. CML has a reduction semantics, but to date there has been no labelled...
ICALP
2011
Springer
12 years 9 months ago
2011
Springer
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...
CBSE
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. Automata-based interface and protocol specifications provide an elegant framework to capture and automatically verify the interactive behavior of component-based software...
ICTCS
2007
Springer
14 years 11 days ago
2007
Springer
ing from Prioritized/Weighted Internal Immediate Actions Marco Bernardo and Alessandro Aldini Universit`a di Urbino “Carlo Bo” – Italy Markovian process calculi constitute a ...
IFIP
2010
Springer
13 years 1 months ago
2010
Springer
We propose a timed broadcasting calculus for wireless systems. The operational semantics of our calculus is given both in terms of a Reduction Semantics and in terms of a Labelled ...