Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the c...
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
Saurabh K. Tiwary, Anubhav Gupta, Joel R. Phillips...
Abstract. ComputationalsystemsareoftenrepresentedbymeansofKripkestructures, and related using simulations. We propose rewriting logic as a flexible and executable framework in whi...
Previous research has developed a formal methods-based (cognitive-level) model of the Interacting Cognitive Subsystems central engine, with which we have simulated attentional cap...
We present a rigorous formal - but transparent - specification of the semantics of a generic simulation-based 3D animation framework. Our system combines a SystemC simulation kern...