Rules and Strategies: A Framework for Model-Checking Timed Automata: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 02:5202:52, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,728 bytes +1,728‎ Created page with "Title: Rules and Strategies: A Framework for Model-Checking Timed Automata Research Question: Can the ELAN system, based on rewriting calculus, be used to prototype model-checking algorithms for timed automata, and what are the advantages of using such a formal tool compared to conventional programming languages? Methodology: The researchers used the ELAN system, which is a powerful language and environment for specifying and prototyping deduction systems in a language..."
Retrieved from "https://simplesci.org/wiki/Rules_and_Strategies:_A_Framework_for_Model-Checking_Timed_Automata"