Ana Cristina Vieira de Melo

Ana Cristina Vieira de Melo

Auto-generated profile, based on publicly available information

Ana Cristina Vieira de Melo

Universidade de São Paulo

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 March 2002 in Knowledge-Based Systems
Verified
Journal Article
Closed access
FSFlavio S. Correa da Silva
Flavio S. Correa da Silva
WVWamberto W. Vasconcelos
Wamberto W. Vasconcelos
DRDavid S. Robertson
David S. Robertson
VBVirginia Brilhante
Virginia Brilhante
AMAna C.V. de Melo
Ana C.V. de Melo
JAJaume Agustı́
Jaume Agustı́

5 December 2009 in Science of Computer Programming
Verified
Journal Article
Closed access
DPDavid P. Pereira
David P. Pereira
AMAna C.V. de Melo
Ana C.V. de Melo

30 July 2013 in SIMULATION
Verified
Journal Article
Closed access
PSPaulo Salem da Silva
Paulo Salem da Silva
AMAna C V de Melo
Ana C V de Melo
Discrete event simulations can be used to analyze natural and artificial phenomena. To this end, one provides models whose behaviors are characterized by discrete events in a discrete timeline. By running such a simulation, one can then observe its properties. This suggests the possibility of applying on-the-fly verification procedures during simulations. In this work we propose a method by which this can be accomplished. It consists of modeling the simulation as a transition system (implicitly), and the property to be verified as another transition system (explicitly). The latter we call a simulation purpose and it is used both to verify the success of the property and to guide the simulation. Algorithmically, this corresponds to building a synchronous product of these two transitions systems on-the-fly and using it to operate a simulator. By the end of such an algorithm, it may deliver either a conclusive or inconclusive verdict. If conclusive, it becomes known whether the simulation model satisfies the simulation purpose. If inconclusive, it is possible to adjust certain parameters and try again. The precise nature of simulation purposes, as well as the corresponding satisfiability relations and verification algorithms, are largely determined by methodological considerations important for the analysis of simulations, whose computational characteristics we compare with empirical scientific procedures. We provide a number of ways in which such a satisfiability relation can be defined formally, the related algorithms, and mathematical proofs of soundness, completeness and complexities. Two application examples are given to illustrate the approach.


12 April 2015
Verified
Book Chapter
Closed access
PDF file
JJJandisson Soares de Jesus
Jandisson Soares de Jesus
AMAna Cristina Vieira de Melo
Ana Cristina Vieira de Melo

22 September 2016
Verified
Book Chapter
Closed access
PDF file
AMAna C. V. de Melo
Ana C. V. de Melo
CPCorina S. Păsăreanu
Corina S. Păsăreanu
SHSimone Hanazumi
Simone Hanazumi