Sciweavers

66 search results - page 2 / 14
» Rate-Based Transition Systems for Stochastic Process Calculi
Sort
View
LICS
2000
IEEE
13 years 11 months ago
Models for Name-Passing Processes: Interleaving and Causal
We study syntax-free models for name-passing processes. For interleaving semantics, we identify the indexing structure required of an early labelled transition system to support t...
Gian Luca Cattani, Peter Sewell
IANDC
2006
121views more  IANDC 2006»
13 years 7 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton
BIRTHDAY
2005
Springer
14 years 27 days ago
Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes
The paper introduces a novel approach to the synthesis of labelled transition systems for calculi with name mobility. The proposal is based on a graphical encoding: Each process is...
Fabio Gadducci, Ugo Montanari
TGC
2010
Springer
13 years 5 months ago
Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Processes
Rate transition systems (RTS) are a special kind of transition systems introduced for defining the stochastic behavior of processes and for associating continuous-time Markov chain...
Marco Bernardo, Rocco De Nicola, Michele Loreti
ENTCS
2002
95views more  ENTCS 2002»
13 years 7 months ago
Deriving Bisimulation Congruences: A 2-categorical Approach
We introduce G-relative-pushouts (GRPO) which are a 2-categorical generalisation of relative-pushouts (RPO). They are suitable for deriving labelled transition systems (LTS) for p...
Vladimiro Sassone, Pawel Sobocinski