Sciweavers

74 search results - page 5 / 15
» Product Automata and Process Algebra
Sort
View
CORR
2008
Springer
112views Education» more  CORR 2008»
14 years 9 months ago
Analytic aspects of the shuffle product
There exist very lucid explanations of the combinatorial origins of rational and algebraic functions, in particular with respect to regular and context free languages. In the searc...
Marni Mishna, Mike Zabrocki
65
Voted
FGCS
2006
83views more  FGCS 2006»
14 years 9 months ago
Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems
We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as network...
Anne Benoit, Brigitte Plateau, William J. Stewart
107
Voted
ACS
2011
14 years 4 months ago
The Compositional Construction of Markov Processes
We describe an algebra for composing automata in which the actions have probabilities. We illustrate by showing how to calculate the probability of reaching deadlock in k steps in...
Luisa de Francesco Albasini, Nicoletta Sabadini, R...
96
Voted
HYBRID
2000
Springer
15 years 1 months ago
Computing Optimal Operation Schemes for Chemical Plants in Multi-batch Mode
We propose a computer-aided methodology to automatically generate time optimal production schemes for chemical batch plants operating in multi-batch mode. Our approach is based on ...
Peter Niebert, Sergio Yovine
KBSE
2008
IEEE
15 years 3 months ago
The Consistency of Web Conversations
Abstract—We describe BPELCheck, a tool for statically analyzing interactions of composite web services implemented in BPEL. Our algorithm is compositional, and checks each proces...
Jeffrey Fischer, Rupak Majumdar, Francesco Sorrent...