Browse Source

Import of AFP for Isabelle 2021.

main
Achim D. Brucker 1 month ago
parent
commit
1f29340b1b
5 changed files with 7 additions and 12 deletions
  1. +3
    -5
      Extended_Finite_State_Machine_Inference/Code_Generation.thy
  2. +0
    -0
      Extended_Finite_State_Machine_Inference/document/root.bib
  3. +1
    -3
      Extended_Finite_State_Machine_Inference/document/root.tex
  4. +2
    -3
      Extended_Finite_State_Machine_Inference/examples/Drinks_Subsumption.thy
  5. +1
    -1
      Extended_Finite_State_Machine_Inference/heuristics/Least_Upper_Bound.thy

+ 3
- 5
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 (case_tac "s v")
apply (case_tac "s v'")
apply simp
apply (case_tac "s v'")
apply simp
apply simp
apply simp
apply (case_tac "s v")
apply (case_tac "s v")
apply (case_tac "s v'")
by auto



+ 0
- 0
Extended_Finite_State_Machine_Inference/document/root.bib View File


+ 1
- 3
Extended_Finite_State_Machine_Inference/document/root.tex View File

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



+ 2
- 3
Extended_Finite_State_Machine_Inference/examples/Drinks_Subsumption.thy View File

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


+ 1
- 1
Extended_Finite_State_Machine_Inference/heuristics/Least_Upper_Bound.thy View File

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


Loading…
Cancel
Save