Sciweavers

132 search results - page 13 / 27
» Process Equivalences as Global Bisimulations
Sort
View
MFCS
1991
Springer
13 years 11 months ago
CCS Dynamic Bisimulation is Progressing
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still w...
Ugo Montanari, Vladimiro Sassone
IJFCS
2008
130views more  IJFCS 2008»
13 years 7 months ago
Equivalence of Labeled Markov Chains
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...
Laurent Doyen, Thomas A. Henzinger, Jean-Fran&cced...
CONCUR
2004
Springer
13 years 11 months ago
Extended Process Rewrite Systems: Expressiveness and Reachability
Abstract. We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less exp...
Mojmír Kretínský, Vojtech Reh...
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 8 months ago
Characterising Probabilistic Processes Logically
Abstract. In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the...
Yuxin Deng, Rob J. van Glabbeek
MSCS
2010
84views more  MSCS 2010»
13 years 6 months ago
Channel abstractions for network security
Abstractions for Network Security† MICH E L E B U G L I E S I, R I C C A R D O F O C A R D I Dipartimento di Informatica, Universit`a Ca’ Foscari, Venice. Received 6 October 20...
Michele Bugliesi, Riccardo Focardi