Elvio Gilberto Amparore

Learn More
Generalized and Deterministic Stochastic Petri Nets (GSPN and DSPN) and their relative solvers have been around for a while. In the last years research on GSPN solution has mainly concentrated on efficient data structure for state space representation, while little has been published on DSPN. Strangely enough although, the DSPN solvers available do still(More)
CSLTA is a stochastic temporal logic for continuous-time Markov chains (CTMC), that can verify the probability of following paths specified by a Deterministic Timed Automaton (DTA). A DTA expresses both logic and time constraints over a CTMC path, yielding to a very flexible way of describing performance and dependability properties. This paper explores a(More)
CSLTA is a stochastic temporal logic for continuous-time Markov chains (CTMC), that can verify the probability of following paths specified by a Deterministic Timed Automaton (DTA). A DTA expresses both logic and time constraints over a CTMC path, yielding to a very flexible way of describing performance and dependability properties. This paper explores a(More)
Passage time distribution has drawn increasing attention over the past years as an important measure to define and verify service level agreements. The definition of passage time requires the specification of a condition to start/stop the computation, and possibly of a restriction on the system behavior to be considered between start and stop. Different(More)
This demo presents MC4 CSLTA, an efficient Markov chain Model Checker for (four) the stochastic logic CSLTA. In CSLTA formulas are either steady state queries or path formulas, where accepting paths are specified through a Deterministic Timed Automata (DTA). MC4CSLTA takes as input a labeled CTMC, a query, one or more DTA involved in the query (possibly(More)