LISA: A new symbolic package for the definition, analysis and resolution of Markovian processes
Francesco Marinuzzi, Stefano Soliani · 1992
This paper presents the symbolic and inductive techniques adopted by LISA, a system for the symbolic computation related to the analysis and resolution of complex systems modelled through Markov Chains.The package is especially useful to model systems and algorithms with internal concurrency.Because of the high complexity of these systems, due to the enormous state-apace growth, the numerical solution methods quickly show their limits; the symbolic approach overcomes most of the problems and leads to an efficient method to define and solve the systems.Some major advantages introduced by using the package relate to the possibility of modeling and handling queueing systems whose apace state depends on task position in the system, A new methodology for an inductive-based solution is presented, Some system configurations have been effectually resolved.