TCS
2010
13 years 7 months ago
2010
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 ...
LICS
2010
IEEE
13 years 11 months ago
2010
IEEE
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...
IANDC
2010
13 years 11 months ago
2010
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...
ENTCS
1998
14 years 3 days ago
1998
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...
ENTCS
2002
14 years 7 days ago
2002
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 ...
TCS
2008
14 years 10 days ago
2008
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...
ENTCS
2007
14 years 12 days ago
2007
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 ...
ENTCS
2006
14 years 13 days ago
2006
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
CBSE
2008
Springer
14 years 2 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...
COORDINATION
2006
Springer
14 years 4 months ago
2006
Springer
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...