The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 4 of 4

Showing per page

Order by Relevance | Title | Year of publication

The compositional construction of Markov processes II

L. de Francesco AlbasiniN. SabadiniR. F. C. Walters — 2011

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We add sequential operations to the categorical algebra of weighted and Markov automata introduced in [L. de Francesco Albasini, N. Sabadini and R.F.C. Walters, 
arXiv:0909.4136]. The extra expressiveness of the algebra permits the description of hierarchical systems, and ones with evolving geometry. We make a comparison with the probabilistic automata of Lynch [ 37 (2007) 977–1013].

The compositional construction of Markov processes II

L. de Francesco AlbasiniN. SabadiniR. F.C. Walters — 2011

RAIRO - Theoretical Informatics and Applications

We add sequential operations to the categorical algebra of weighted and Markov automata introduced in [L. de Francesco Albasini, N. Sabadini and R.F.C. Walters, 
]. The extra expressiveness of the algebra permits the description of hierarchical systems, and ones with evolving geometry. We make a comparison with the probabilistic automata of Lynch [ (2007) 977–1013].

Page 1

Download Results (CSV)