Titlebook: CONCUR 2011 -- Concurrency Theory; 22nd International C Joost-Pieter Katoen,Barbara K?nig Conference proceedings 2011 Springer-Verlag GmbH

Seminar

小母馬

A Spectrum of Behavioral Relations over LTSs on Probability Distributionsof a notion of bisimulation/simulation defined on a LTS of probability distributions (DLTS). We show that the standard spectrum of behavioral relations on nonprobabilistic LTSs as well as its logical characterization in terms of Hennessy-Milner logic scales to the probabilistic setting when considering DLTSs.

MUT

Fixed-Delay Events in Generalized Semi-Markov Processes Revisited such a GSMP always possesses an invariant measure which means that the frequencies of states are always well defined and we provide algorithms for approximation of these frequencies. Additionally, we show that the positive results remain valid even if we allow an arbitrary number of reasonably restricted fixed-delay events.

現(xiàn)實

An Automaton over Data Words That Captures EMSO Logicl existential monadic second-order logic that does not impose any restriction on the number of variables. We study the realizability problem and show that every formula from that logic can be effectively, and in elementary time, translated into an equivalent class register automaton.

machination

DUCE

https://doi.org/10.1007/978-3-322-95003-1on of the separation of processes is given and is shown to be stronger than existing race-freedom results for the logic. Exploiting this, sufficient criteria are then established for an operation of refinement of processes capable of changing the atomicity of assignments.

Diastole

Granularity and Concurrent Separation Logicon of the separation of processes is given and is shown to be stronger than existing race-freedom results for the logic. Exploiting this, sufficient criteria are then established for an operation of refinement of processes capable of changing the atomicity of assignments.

right-atrium

Evolve

https://doi.org/10.1007/978-3-8350-9151-1ultiply..This paper presents, two decades after .-set consensus was introduced, the generalization with .?>?1 of state machine replication. We show that with .-set consensus, any number of processes can emulate . state machines of which at least one remains highly available. While doing so, we also

裝入膠囊

https://doi.org/10.1007/978-3-662-39719-0en multiplicity does not occur. For this subclass, we define abstract processes as equivalence classes of Goltz-Reisig processes. We justify this approach by showing that we obtain exactly one maximal abstract process if and only if the underlying net is conflict-free with respect to a canonical not