Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
TCS
2010
11 years 4 months ago
Weak bisimulation for Probabilistic Timed Automata
We are interested in describing timed systems that exhibit probabilistic behaviour. To this purpose, we consider a model of Probabilistic Timed Automata and introduce a concept of ...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
LICS
2010
IEEE
11 years 8 months ago
Weak Equivalences in Psi-Calculi
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...
Magnus Johansson, Jesper Bengtson, Joachim Parrow,...
IANDC
2010
116views more  IANDC 2010»
11 years 8 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...
ENTCS
1998
94views more  ENTCS 1998»
11 years 9 months ago
Derivation of Characteristic Formulae
This paper shows how modal mu-calculus formulae characterizing finite-state processes up to strong or weak bisimulation can be derived directly from the well-known greatest fixp...
Markus Müller-Olm
ENTCS
2002
76views more  ENTCS 2002»
11 years 9 months ago
A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras
In [19] Rutten introduced the notion of weak bisimulations and weak bisimilarity for coalgebras of the functor F(X) = X +O. In the present paper I will introduce a notion of weak ...
Jan Rothe
TCS
2008
11 years 9 months ago
Using bisimulation proof techniques for the analysis of distributed abstract machines
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
Damien Pous
ENTCS
2007
126views more  ENTCS 2007»
11 years 9 months ago
Notes on Generative Probabilistic Bisimulation
In this notes we consider the model of Generative Probabilistic Transition Systems, and Baier and Hermanns’ notion of weak bisimulation defined over them. We prove that, if we ...
Simone Tini
ENTCS
2006
141views more  ENTCS 2006»
11 years 9 months ago
Refining the Undecidability Border of Weak Bisimilarity
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
Mojmír Kretínský, Vojtech Reh...
CBSE
2008
Springer
11 years 11 months ago
State Space Reduction Techniques for Component Interfaces
Abstract. Automata-based interface and protocol specifications provide an elegant framework to capture and automatically verify the interactive behavior of component-based software...
Markus Lumpe, Lars Grunske, Jean-Guy Schneider
COORDINATION
2006
Springer
12 years 1 months ago
Stochastic Reasoning About Channel-Based Component Connectors
Abstract. Constraint automata have been used as an operational model for component connectors that coordinate the cooperation and communication of the components by means of a netw...
Christel Baier, Verena Wolf
books