38 search results - page 3 / 8 » Non-interleaving bisimulation equivalences on Basic Parallel... |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. While distributed systems with transfer of processes have become pervasive, methods for reasoning about their behaviour are underdeveloped. In this paper we develop a bis...
CONCUR
2003
Springer
13 years 11 months ago
2003
Springer
We present a process-algebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “input-enabled” property, w...
IANDC
2006
13 years 6 months ago
2006
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
CONCUR
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving...
LPAR
2010
Springer
13 years 4 months ago
2010
Springer
We investigate the complexity of preorder checking when the specification is a flat finite-state system whereas the implementation is either a non-flat finite-state system or a st...