scholarly journals Simulating Taverna workflows using stochastic process algebras

2011 ◽  
Vol 23 (16) ◽  
pp. 1920-1935 ◽  
Author(s):  
Vasa Curcin ◽  
Paolo Missier ◽  
David De Roure

2011 ◽  
Vol 55 (7) ◽  
pp. 866-881 ◽  
Author(s):  
J. Hillston ◽  
M. Tribastone ◽  
S. Gilmore






2002 ◽  
Vol 50 (2-3) ◽  
pp. 79-82 ◽  
Author(s):  
Roberto Gorrieri ◽  
Ulrich Herzog ◽  
Jane Hillston


2011 ◽  
Vol 22 (04) ◽  
pp. 823-841 ◽  
Author(s):  
THOMAS HENZINGER ◽  
BARBARA JOBSTMANN ◽  
VERENA WOLF

In this survey, we compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. All these languages — matrix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded command models — describe continuous-time Markov chains, but they differ according to important properties, such as compositionality, expressiveness and succinctness, executability, and ease of use. Moreover, they provide different support for checking the well-formedness of a model and for analyzing a model.



Sign in / Sign up

Export Citation Format

Share Document