afp-mirror
/
Extended_Finite_State_Machine_Inference
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Import of AFP for Isabelle 2021.

This commit is contained in:
Achim D. Brucker 2021-02-27 16:34:10 +00:00
parent 2863b3552a
commit 1f29340b1b
5 changed files with 7 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
Extended_Finite_State_Machine_Inference/Code_Generation.thy
View File

@ -68,12 +68,10 @@ lemma mutex_not_gval:
apply simp apply simp
apply simp apply simp
apply simp apply simp
apply (case_tac "s v") apply (case_tac "s v'")
apply (case_tac "s v'") apply simp
apply simp
apply simp apply simp
apply simp apply (case_tac "s v")
apply (case_tac "s v")
apply (case_tac "s v'") apply (case_tac "s v'")
by auto by auto

0
Extended_Finite_State_Machine_Inference/document/root.bib Executable file → Normal file
View File

4
Extended_Finite_State_Machine_Inference/document/root.tex Executable file → Normal file
View File

@ -1,5 +1,5 @@
\documentclass[10pt,DIV16,a4paper,abstract=true,twoside=semi,openright]{scrreprt} \documentclass[10pt,DIV16,a4paper,abstract=true,twoside=semi,openright]{scrreprt}
\usepackage[USenglish]{babel} \usepackage[english]{babel}
\usepackage[numbers, sort&compress]{natbib} \usepackage[numbers, sort&compress]{natbib}
\usepackage{isabelle,isabellesym} \usepackage{isabelle,isabellesym}
\usepackage{booktabs} \usepackage{booktabs}
@ -22,8 +22,6 @@
\begingroup% \begingroup%
\def\isacharunderscore{\textunderscore}% \def\isacharunderscore{\textunderscore}%
\section{#1 (\thy)}% \section{#1 (\thy)}%
\def\isacharunderscore{-}%
\expandafter\label{sec:\isabellecontext}%
\endgroup% \endgroup%
} }

5
Extended_Finite_State_Machine_Inference/examples/Drinks_Subsumption.thy
View File

@ -1,5 +1,5 @@
subsection{*Example*} subsection\<open>Example\<close>
text{*This theory shows how contexts can be used to prove transition subsumption.*} text\<open>This theory shows how contexts can be used to prove transition subsumption.\<close>
theory Drinks_Subsumption theory Drinks_Subsumption
imports "Extended_Finite_State_Machine_Inference.Subsumption" "Extended_Finite_State_Machines.Drinks_Machine_2" imports "Extended_Finite_State_Machine_Inference.Subsumption" "Extended_Finite_State_Machines.Drinks_Machine_2"
begin begin
@ -74,7 +74,6 @@ next
apply clarify apply clarify
apply (simp add: in_possible_steps[symmetric]) apply (simp add: in_possible_steps[symmetric])
apply (simp add: drinks2_def) apply (simp add: drinks2_def)
apply clarsimp
apply (simp add: drinks2_def[symmetric]) apply (simp add: drinks2_def[symmetric])
apply (simp add: select_def can_take apply_updates_def) apply (simp add: select_def can_take apply_updates_def)
using no_change_1_1 by fastforce using no_change_1_1 by fastforce

2
Extended_Finite_State_Machine_Inference/heuristics/Least_Upper_Bound.thy
View File

@ -704,7 +704,7 @@ next
apply (induct a) apply (induct a)
apply simp apply simp
apply simp apply simp
subgoal for _ x2 i ia subgoal for x2 i ia
apply (case_tac x2) apply (case_tac x2)
apply (rule_tac x="list_update i ia x1" in exI) apply (rule_tac x="list_update i ia x1" in exI)
apply (simp add: apply_guards_cons unconstrained_input filter_empty_conv) apply (simp add: apply_guards_cons unconstrained_input filter_empty_conv)