Simulation of Timed Abstract State Machines with Predicate Logic Model-Checking

@article{Slissenko2008SimulationOT,
  title={Simulation of Timed Abstract State Machines with Predicate Logic Model-Checking},
  author={Anatol Slissenko and Pavel Vasilyev},
  journal={J. UCS},
  year={2008},
  volume={14},
  pages={1984-2006}
}
We describe a prototype of a simulator for reactive timed abstract state machines (ASM) that checks whether the generated runs verify a requirements specification represented as a formula of a First Order Timed Logic (FOTL). The simulator deals with ASM with continuous or discrete time. The time constraints are linear inequalities. It can treat two semantics, one with instantaneous actions and another one with delayed actions, the delays being bounded and non-deterministic. 
9 Citations
22 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Implementation of sturdy realtime abstract state machines by machines with delays. Technical Report TR-LACL2008–02, University Paris 12, Laboratory for Algorithmics, Complexity and Logic (LACL)

  • Cohen et al, J. 2008 Cohen, A. Slissenko
  • 2008

Time in abstract state machines

  • Graf et al, S. 2007 Graf, A. Prinz
  • 2007

Simulation of Timed Abstract State Machines

  • A. 2006 Slissenko, P. Vasilyev
  • 2006

Similar Papers

Loading similar papers…