Sciweavers

66 search results - page 4 / 14
» Rate-Based Transition Systems for Stochastic Process Calculi
Sort
View
CONCUR
2005
Springer
14 years 27 days ago
Deriving Weak Bisimulation Congruences from Reduction Systems
The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by labelled transition syst...
Roberto Bruni, Fabio Gadducci, Ugo Montanari, Pawe...
FOSSACS
2008
Springer
13 years 9 months ago
Symbolic Semantics Revisited
Abstract. Symbolic bisimulations were introduced as a mean to define value-passing process calculi using smaller, possibly finite labelled transition systems, equipped with symboli...
Filippo Bonchi, Ugo Montanari
IFM
2010
Springer
113views Formal Methods» more  IFM 2010»
13 years 5 months ago
Translating Pi-Calculus into LOTOS NT
Process calculi supporting mobile communication, such as the π-calculus, are often seen as an evolution of classical value-passing calculi, in which communication between processe...
Radu Mateescu, Gwen Salaün
LICS
2006
IEEE
14 years 1 months ago
Saturated Semantics for Reactive Systems
The semantics of process calculi has traditionally been specified by labelled transition systems (LTS), but with the development of name calculi it turned out that reaction rules...
Filippo Bonchi, Barbara König, Ugo Montanari
ENTCS
2007
123views more  ENTCS 2007»
13 years 7 months ago
Labelled Markov Processes as Generalised Stochastic Relations
Labelled Markov processes (LMPs) are labelled transition systems in which each transition has an associated probability. In this paper we present a universal LMP as the spectrum o...
Michael W. Mislove, Dusko Pavlovic, James Worrell