2025-12-18  Antonio Cau  <cau.researcher@gmail.com>

	* CDT_PITL_Deep.thy, Extended_Int.thy: fixes for Isabelle2025-1. 

2025-03-18  Antonio Cau  <cau.researcher@gmail.com>

	* Makefile: release of version 3.5.

2025-03-17  Antonio Cau  <cau.researcher@gmail.com>

	* Omega.thy, SChopTheorems.thy, QPITL_Deep.thy, Chopstar.thy:
	* TimeReversal.thy, Semantics.thy, First.thy, Projection.thy:
	* Pi.thy, ITA.thy, Theorems.thy: updated from the development
	version.

	* NL_ITL_Deep.thy: new file, deep embedding of ITL with
	neighbourhood operators, i.e., NL-ITL
	\cite{GuelevMoszkowski2022}. Note, we have both infinite past and
	infinite future, therefore we need the theory of extended
	integers.

	* Extended_Int.thy: new file, integers with -\infty and infty,
	needed for NL_ITL_Deep.

	* CDT_PITL_Deep.thy: new file, deep embedding of PITL (without
	chopstar and chop-omega, with locality) with Y. Venema's
	\cite{Venema91} CDT operators. Syntax, semantics and axiom
	system. This is an example of an expanding logic whereas
	traditional ITL is introspective.

2024-05-26  Antonio Cau  <cau.researcher@gmail.com>

	* Makefile: release of version 3.4.

2024-05-14  Antonio Cau  <cau.researcher@gmail.com>

	* Makefile: changed VERSION to 3.4. Added TimeReversal.thy,
	PITL_Deep.thy, QPITL_Deep.thy, PITL_Deep_GNF.thy and
	QPITL_Deep_GNF.thy.

	* document/root.tex: changed article to report.

	* document/root.bib: added GuelevMoszkowski2022 and
	bowman03:_decis_proced_compl_axiom_finit.

	* ROOT: added TimeReversal, PITL_Deep, PITL_Deep_GNF, QPITL_Deep
	and QPITL_Deep_GNF.

	* QPITL_Deep_GNF.thy: new file, proves that all QPITL formulae can
	be written in Guarded Normal Form (GNF).

	* QPITL_Deep.thy: new file, a deep embedding of QPITL providing
	syntax and semantics.

	* PITL_Deep_GNF.thy: new file, proves that all PITL formulae can
	be written in Guarded Normal Form (GNF).

	* PITL_Deep.thy: new file, a deep embedding of PITL providing
	syntax and semantics.

	* TimeReversal.thy: new file, ported from finite ITL (v2). Note
	only finkite intervals can be reversed.

	* Theorems.thy: changed section title to 'Weak chop operator'.

	* SChopTheorems.thy: changed section title to 'Strong chop
	operator'.

	* FOTheorems.thy: changed section title to 'Quantifiers'.

	* NELList_Extras.thy: changed section title to 'Extra operations
	on non-empty conductive lists'. Added definition and lemms for the
	nrev operator. Added nzip_nfuse, nkfilter_def1 and nmap_fst_nzip
	lemmas.

	* NELList.thy: changed section title to 'Non-empty coinductive
	lists'.

	* LList_Extras.thy: added chapter with title 'Model: Intervals',
	changed section title to 'Extra operations on coinductive
	lists. Added definition and lemms for the lrev operator.

	* First.thy: changed section title to 'First occurrence operator',
	removed subsection 'First and time reversal', moved BsEqvRule to
	subsubsection 'Strict initial intervals', moved FstEqvRule to
	subsubsection 'First occurence'.

	* Pi.thy: changed section title to 'Pi operator'.

	* Until.thy: changed section title to 'Until operator'.

	* ITA.thy: changed section title to 'Interval Temporal Algebra'.

	* Chopstar.thy: changed section title to 'Chopstar and variants'.

	* ITL.thy: changed section title to 'Axioms and Rules'.

	* Semantics.thy: added chapter with title 'Shallow embedding of
	Finite and Infinite ITL', changed section title to 'Semantics'.

2023-09-13  Antonio Cau  <cau.researcher@gmail.com>

	* Makefile: release of version 3.3.

2023-08-11  Antonio Cau  <cau.researcher@gmail.com>

	* Nellist_Extras.thy, LList_Extras.thy: fixed for Isabelle 2023.

	* First.thy, Monitor.thy, MonitorExample.thy: from finite ITL (v2)
	ported to infinite ITL.

2022-10-26  Antonio Cau  <cau.researcher@gmail.com>

	* Makefile: release of version 3.2.

2022-10-14  Antonio Cau  <cau.researcher@gmail.com>

	* Projection.thy: new file. Ported the projection operator
	definitions and lemmas from ITLv2.x series (finite ITL) to
	infinite ITL. Added infinite projection operator and lemmas.

	* Pi.thy: added remaining lemmas for chopstar and Pi from
	\cite{moszkowski17}. Added lemma for omega and Pi.

	* Omega.thy: added womega (Omega operation from Omega Algebra)
	definition and lemmas, these are ported from
	\cite{Georg:Klealg}. Added corresponding lemmas for omega
	(omega from ITL) definition. Added aomega (semantic version)
	definition and equivalence with omega definition.

	* Chopstar.thy: added wpowerstar (Kleene star operation from
	Kleene Algebra) definition and lemmas, these are ported from
	\cite{Georg:Klealg}. Added corresponding lemmas for schopstar
	(strong schopstar from ITL) definition. Added achopstar (semantic
	version) definition and equivalence with schopstar
	definition. Added inductive definition istar and various lemmas
	related them to schopstar and wpowerstar.

	* SChopTheorems.thy, Omega.thy: moved omega related lemmas from
	SChopTheorems.thy to Omega.thy.

	* SChopTheorems.thy, Chopstar.thy: moved chopstar related lemmas
	from SChopTheorems.thy to Chopstar.thy.

	* Theorems.thy, Omega.thy: moved omega related lemmas from
	Theorems.thy to Omega.thy.

	* Theorems.thy, Chopstar.thy: moved chopstar related lemmas from
	Theorems.thy to Chopstar.thy.

	* Omega.thy: new file. Added omega definitions and lemmas from
	Semantics.thy.

	* Chopstar.thy: new file. Added chopstar definitions and lemmas
	from Semantics.thy.

	* Semantics.thy: moved chopstar and omega related definitions and
	lemmas to respectively Chopstar.thy and Omega.thy.

	* NELList_Extras.thy: added nfuse, nbutlast, nsubn, nfuse, nridx,
	nlastnfirst, nfusecat definitions and their lemmas.

	* NELListKFilter.thy: renamed to NELList_Extras.thy.

	* NELList.thy: moved nfuse and nsubn definitions and lemmas to
	NELList_Extras.thy. Added nconcat definition and lemmas.

	* LList_Extras.thy: added ridx, lfirst, lfuse, lsub, lsubc,
	llastlfirst, lltl, llbutlast, is_lfirst and lfusecat definitions
	and their lemmas.

	* LListKFilter.thy: renamed to LList_Extras.thy.

2021-12-14  Antonio Cau  <cau.researcher@gmail.com>

	* Makefile: release of version 3.1.

	* NELList.thy, NELListKFilter.thy, Semantics.thy, ITA.thy,
	Theorems.thy, Until.thy, Pi.thy, SChopTheorems.thy,
	LListKFilter.thy: incorporate changes for Isabelle2021-1.

2021-04-09  Antonio Cau  <cau.researcher@gmail.com>

	* Makefile, ROOT: release of version 3.0

2021-04-03  Antonio Cau  <cau.researcher@gmail.com>

	* NELList.thy: added nzip and niterates operators and lemmas.

2021-03-02  Antonio Cau  <cau.researcher@gmail.com>

	* UntilSince.thy, Pi.thy: renamed UntilSince.thy to Until.thy as
	only the until operator is defined.

2021-02-07  Antonio Cau  <cau.researcher@gmail.com>

	* NELListUntilSince.thy, NELListPi.thy, NELListITA.thy,
	NELListFOTheorems.thy, NELListSChopTheorems.thy,
	NELListTheorems.thy, NELListITL.thy, NELListSemantics.thy: renamed
	to UntilSince.thy, Pi.thy, ITA.thy, FOTheorems.thy,
	SChopTheorems.thy, Theorems.thy, ITL.thy, Semantics.thy

2021-01-31  Antonio Cau  <cau.researcher@gmail.com>

	* Example.thy, FOTheorems.thy, First.thy, Fuse.thy, ITA.thy,
	ITL.thy, Interval.thy, IntervalFilter.thy, Monitor.thy,
	MonitorExample.thy, PI.thy, Projection.thy, Semantics.thy,
	Theorems.thy, TimeReversal.thy, UntilSince.thy: dropped these will
	part of version V2.

	* NELListPi.thy: new file, pi operator for finite and infinite
	ITL.

	* NELListUntilSince.thy: new file, until and since for finite and
	infinite intervals.

	* NELListITA.thy: new file, interval temporal algebra for finite
	and infinite intervals.

	* InfiniteFOTheorems.thy, NELListFOTheorems.thy: replaced
	InfiniteFOTheorems.thy by NELListFOTheorems.thy.

	* InfiniteSChopTheorems.thy, NELListSChopTheorems.thy: replaced
	InfiniteSChopTheorems.thy by NELListSChopTheorems.thy.

	* InfiniteTheorems.thy, NELListTheorems.thy: replaced
	InfiniteTheorems.thy by NELListTheorems.thy.

	* InfiniteITL.thy, NELListITL.thy: replaced InfiniteITL.thy by
	NELListITL.thy.

	* NELListKFilter.thy: new file, kfilter for non-empty coinductive
	lists.

	* InfiniteSemantics.thy, NELListSemantics.thy: replaced
	InfiniteSemantics.thy by NELListSemantics.thy that uses
	NELList.thy.

	* LListKFilter.thy: new file with extra definitions needed for
	PI.thy.

	* Interval.thy, NELList.thy: replaced Interval.thy by
	NELList.thy. NELList.thy uses a uniform model for infinite and
	finite intervals based on Coinductive Lists.

	* Makefile, ROOT: start of version 3.

2020-08-12  Antonio Cau  <cau.researcher@gmail.com>

	* InfiniteSemantics.thy: omega_d is now introduced using a
	coinductive definition in new subsection Omega. Introduced lemma
	FMoreSem needed for a simple coinductive definition.

	The proof of OmegaUnrollSem is simplified substantially. Deleted
	lemmas omega_unroll_chain_a, omega_unroll_chain_b,
	omega_unroll_chain, omega_unroll_sem.

	For the proof of OmegaInduct, the following lemmas are deleted:
	OmegaInductSem_help, OmegaInductSem_help_infinite, definitions
	cpoint, lemmas cpoint_order_0a, cpoint_expand_0, cpoint_expand_1,
	cpoint_expand_n, cpoint_0, cpoint_1, cpoint_2, cpoint_3a,
	cpoint_3, OmegaInductSem.  Introduced lemmas OmegaIntros,
	OmegaCases, OmegaCoinductSem, OmegaCoinduct, OmegaWeakCoinductSem,
	OmegacoWeakCoinduct, OmegaInducthelp.

2020-05-16  Antonio Cau  <cau.researcher@gmail.com>

	* IntervalFilter.thy: added lemmas filter_intapp2 and
	filter_intrev.

	* Pi.thy: added subsection 'Time reversal'. Added 'rpi' operator
	which filters on prefixes of an interval. Added lemmas
	pifilt_rev_exists, PiRevsem and PiRev.

2020-05-10  Antonio Cau  <cau.researcher@gmail.com>

	* UntilSince.thy: define 'strong until' in terms of 'next' and
	'until', the 'strong since' in terms of 'prev' and 'since'. The
	axioms are in subsection 'Axioms' while the theorems are in
	subsection 'Theorems'. Removed lemma UntilSUntil, SinceSSince and
	UntilUnrol. The proof of the two until induction axioms uses
	LFPUntil (least fix point for until). All the theorems are now
	proven deductively.

2020-04-16  Antonio Cau  <cau.researcher@gmail.com>

	* TODO: added projection and Pi operator for infinite ITL.

2020-04-07  Antonio Cau  <cau.researcher@gmail.com>

	* UntilSince.thy: defines the Until and Since operators and
	theorems.

	* Theorems.thy: added Chopstardef,
	AndEmptyChopAndEmptyEqvAndEmpty, ChopInductL, ChopInductMoreL,
	ChopInductR, ChopExistPower, ExistChopPower, PowerStarCommute,
	PowerSucAndEmptyEqvAndEmpty, PowerOr, PowerEmptyOrMore,
	PSEqvEmptyOrChopPS, PowerChopCommute, ChopExist, ExistChop,
	PowerstarInductL, PowerstarInductMoreL, ChopstarInductL,
	ChopstarInductMoreL, PowerstarInductR, ChopstarInductR,
	ChopstarInductMoreR, PSAndMoreImpPS, PSImpAndMorePS,
	FPSAndMoreEqvFPS, ChopstarImpPowerstar, PowerstarImpChopstar,
	ChopstarEqvPowerstar, PowerchopAndMore, ExistPowerAndMoreExpand,
	ChopplusCommuteImpA, ChopplusCommuteImpB, ChopplusCommute,
	CSEqvOrChopCSB, PowerChopPower, CSChopCS, ChopstarImp, CSImpCSCS,
	CSCSEqvCS.

	* Semantics.thy: added stable_defs_helpa, stable_defs_helpb,
	ChopAssocSemHelpa, ChopAssocSemHelpb. Removed linalw.

	* Pi.thy: new file, defines the Pi operator and theorems.

	* IntervalFilter.thy: new file, defines the filter operator on
	intervals.

	* InfiniteTheorems.thy: added FiniteRightChopEqvChop,
	PowerchopAndMore.

	* InfiniteSemantics.thy: removed linalw_finite. Added
	ChopAssocSemHelpa, ChopAssocSemHelpb.

	* infiniteInterval.thy: added lemma conc_iprefix_isuffix_help.

	* ITA.thy: new file, Interval Temporal Algebra, adapted from
	v1 version to work with v2.

	* Interval.thy: changed definition of sub, now without if then
	else. Changed definition of shiftm, now without if then
	else. interval_intlen_cons_1 strengthen to equality. Added lemma
	map_is_state_conv, state_is_map_conv, map_eq_cons_conv,
	cons_eq_map_conv, ex_map_conv, interval_nth_last_stutter,
	interval_nth_cons_a. Changed interval_prefix_length to
	interval_prefix_length_code. Added interval_prefix_length but now
	in terms of min. Removed simp qualifier from
	interval_prefix_length_bad. removed assumption from
	interval_pref_intlen_bound. Changed interval_suffix_length to
	interval_suffix_length_code. Added interval_suffix_length but now
	interms of -. Removed simp qualifier from
	interval_suffix_length_bad. Added lemma
	interval_suffix_intlen_bound. Simplified assumption of lemma
	interval_nth_prefix and interval_nth_suffix. Added lemma
	interval_hd_tail. Changed interval_prefix_suffix_intlen to
	interval_prefix_suffix_intlen_code. Lemma
	interval_prefix_suffix_intlen is now in terms of min and
	-. Removed simp qualifier from
	interval_prefix_suffix_intlen_bad_0,
	interval_prefix_suffix_intlen_bad_1. Added lemma
	interval_intfirst_suffix, interval_sub_sub, interval_sub_sub_1,
	interval_idx_mono, interval_idx_less_last,
	interval_idx_less_last_1, interval_idx_greater_first,
	interval_idx_cons, interval_idx_shift_mono,
	interval_idx_shift_idx, interval_idx_intlen_leq,
	interval_intlen_snoc_1, interval_intapp_not_state,
	interval_intapp_eq_intapp_conv, interval_intapp_eq_intapp_conv2,
	interval_suffix1_intapp, interval_cons_eq_intapp_conv,
	interval_intapp_eq_cons_conv, interval_cons_eq_intappI,
	interval_intapp_eq_intappI, intlen_intapp_gr_zero,
	interval_intapp_prefix_suffix. Added subsubsection Set with lemmas
	interval_set_intapp, interval_finite_set, interval_hd_in_set,
	interval_set_subset_Cons, interval_set_ConsD:,
	interval_set_nonempty, interval_set_intrev, interval_set_map,
	interval_split_interval, interval_in_set_conv_decomp,
	interval_split_interval_first, in_set_conv_decomp_first,
	interval_split_interval_last, interval_in_set_conv_decomp_last,
	interval_list_prop, interval_split_interval_propE,
	interval_split_interval_first_prop,
	interval_split_interval_first_propE,
	interval_split_first_prop_iff, interval_split_interval_last_prop,
	interval_split_interval_last_propE,
	interval_split_interval_last_prop_iff, interval_nth_and_set,
	interval_card_intlen, intfirst_map, intlast_map, map_tail,
	map_eq_imp_intlen_eq, interval_length_induct, interval_induct_12,
	interval_induct2, map_inj_on, inj_on_map_eq_map, inj_on_mapI,
	set_nth, prefix_set, suffix_set, suffix_set_a, sub_interval_set,
	sub_interval_set_a, nth_set, map_prefix, map_suffix.

2020-01-27  Antonio Cau  <cau.researcher@gmail.com>

	* FOTheorems.thy: added TassignEqvExFin,
	MoreImpNextassignEqvExNext, MoreImpPrevassignEqvExPrevFin.

2019-11-13  Antonio Cau  <cau.researcher@gmail.com>

	* Projection.thy: added lemma LeftBoxStateImportProj, changed
	BoxStateImportProj to RightBoxStateImportProj.

	* Interval.thy: changed intfirst and intlast to definitions in
	terms of nth. Added lemma interval_intlast_suffix.

2019-11-12  Antonio Cau  <cau.researcher@gmail.com>

	* Projection.thy: added lemma BpEmptyEqvEmpty, BpMoreEqvMore,
	NextDpImpDpNext, BoxStateImportProj, ProjIntro, ProjNext,
	ProjWnext, BoxStateImportBp, BoxStateEqvBpBoxState.

2019-11-11  Antonio Cau  <cau.researcher@gmail.com>

	* Projection.thy: added lemma NotDpEqvBpNot, NotBpEqvDpNot,
	NowImpDp, BpElim, BpImpDpImpDp, BpContraPosImpDist, BpImpDist,
	DpImpDpRule, BpImpBpRule, DpEqvDpRule, BpEqvBpRule, DpState,
	StateEqvBp, DpDpEqvDp, BpBpEqvBp, ProjOrDist, DpOrEqv, BpAndEqv,
	DpAndA, BpOrA, BpOrB, BpOrImpOr, DpAndB, DpAndImpAnd,
	DpSkipEqvMore, DpMoreEqvMore, DpEmptyEqvEmpty, ProjAndImp,
	StateImportProj, ProjStateAndNextEqvStateAndMoreChopProj.

	* Fuse.thy, Interval.thy: move interval_sub_sub_fuse
	interval_sub_sub_fuse_1 to Interval.thy and renamed to
	interval_sub_sub, interval_sub_sub_1.

2019-11-10  Antonio Cau  <cau.researcher@gmail.com>

	* Projection.thy: added subsection "Time reversal", added lemma
	filt_intapp, filt_rev, ProjectionRevsema, ProjectionRevsemb,
	ProjectionRev.

	* Interval.thy: renamed interval_shift to
	interval_shift_index_to_zero_b, added
	interval_shift_index_to_zero_a, put them in subsubsection
	"Shifting indexes to zero".

2019-11-09  Antonio Cau  <cau.researcher@gmail.com>

	* Fuse.thy: added lemma lfuse_split.

	* Interval.thy: added lemma interval_shift, interval_sub_shift,
	interval_nth_shift.

2019-11-08  Antonio Cau  <cau.researcher@gmail.com>

	* Projection.thy: powerinterval_fuse, PowerProjLen, ProjLenExist,
	PowerProjLenExist, RightProjEqvProj, LeftProjEqvProj,
	RightProjImpProj, LeftProjImpProj, ProjTrueEqvChopstar,
	ProjChopstarEqvChopstarProj.

	* Interval.thy: added lemma interval_idx_shiftm_c,
	interval_idx_intlen_leq_intlast_intfirst,
	interval_idx_shiftm_sub_nth.

2019-11-07  Antonio Cau  <cau.researcher@gmail.com>

	* Interval.thy: moved idx after the section of prefix, suffix,
	sub. Added lemma interval_idx_shiftm_a,
	interval_idx_shiftm_b. Changed interval_idx_shiftm. Removed
	interval_map_shift_zero, interval_intfirst_cons_st,
	interval_intfirst_cons, interval_intfirst_st_st.

2019-11-03  Antonio Cau  <cau.researcher@gmail.com>

	* Projection.thy: simplified proof of PJ4sem, added PJ4semchaina
	and PJ4semchainb and deleted PJ4semchain.

2019-11-02  Antonio Cau  <cau.researcher@gmail.com>

	* ROOT, Makefile: added Fuse and Projection.

	* Interval.thy: added lemmas interval_intlast_prefix,
	interval_intlast_sub, interval_intlast_intfirst,
	interval_intfirst_sub, interval_intlen_sub, interval_nth_sub,
	interval_idx_less_equal, interval_idx_less_than, interval_idx_sub,
	interval_idx_split, interval_idx_suffixa, interval_idx_greater,
	interval_idx_suffixb, interval_idx_suffix, interval_idx_intfirst,
	interval_intfirst_st_st, interval_intfirst_cons,
	interval_intfirst_cons_st, interval_idx_expand1,
	interval_map_shift_zero, interval_idx_intlen_leq,
	interval_idx_shiftm_suffix_nth, interval_suffix_gr,
	(from Projection.thy).

	* Fuse.thy: new file, containing the fuse operator definition and
	lemmas (from Projection.thy).

	* Projection.thy: new file, semantics and axioms/rules for the
	projection operator. File is too big so will need to be split.

2019-09-03  Antonio Cau  <cau.researcher@gmail.com>

	* Interval.thy, InfiniteInterval.thy: moved the definition of upt
	and subsubsection 'upt' from InfiniteInterval to Interval.

2019-07-21  Antonio Cau  <cau.researcher@gmail.com>

	* AltChopstarSem.thy, Interval.thy, First.thy, Semantics.thy,
	InfiniteInterval.thy, InfiniteSemantics.thy, TimeReversal.thy,
	InfiniteSChopTheorems.thy, InfiniteTheorems.thy, Theorems.thy:
	minor clean up.

2019-07-20  Antonio Cau  <cau.researcher@gmail.com>

	* InfiniteSemantics.thy: put OmegaUnrollSem in separate
	subsubsection.

	* InfiniteSChopTheorems.thy: adding omega lemmas, add box-a strong
	chop import lemmas.

2019-07-18  Antonio Cau  <cau.researcher@gmail.com>

	* InfiniteTheorems.thy: add subsection 'Omega properties" with
	lemmas for the omega operator.

2019-07-17  Antonio Cau  <cau.researcher@gmail.com>

	* ROOT, Makefile: added AltChopstarSem.thy and
	InfiniteFOTheorems.thy.

	* InfiniteFOTheorems.thy: new file, first order theorems for
	infinite ITL.

	* AltChopstarSem.thy: new file, old definition of chopstar with
	lemma that shows that new definition is the same as the old
	one. Added lemmas chopstar_help_1, chopstar_help_2,
	chop_power_chain, chop_power_eqv_sem,
	chopstar_eqv_power_chop_help, chopstar_eqv_power_chop,
	OldChopstarEqvSem, OldChopstarEqvChopstar.

2019-07-16  Antonio Cau  <cau.researcher@gmail.com>

	* TODO: removed 'adding infinite intervals', this is has now been
	done.

	* Semantics.thy: introduced powerstar which is the existential
	quantification of of power operator.  Chopstar is defined in terms
	of powerstar. Len is defined in terms of power. Added lemmas
	ChopExist, ExistChop, powersem1, powersem, PowerstarEqvSem. Proof
	of ChopstarEqvSem is now trivial. Removed chopstar_help_1,
	chopstar_help_2, chop_power_chain, chop_power_eqv_sem,
	chopstar_eqv_power_chop_help, chopstar_eqv_power_chop.

	* ROOT, Makefile: added InfiniteITL.thy,
	InfiniteSChopTheorems.thy, InfiniteTheorems.thy,
	InfiniteSemantics.thy and InfiniteInterval.thy.

	* InfiniteITL.thy: new file, has lemmas (axioms) and proof rules
	for infinite ITL.

	* InfiniteSChopTheorems.thy: new file, same as
	InfiniteTheorems.thy but now in terms of strong chop (and
	chopstar) . InfiniteTheorems.thy uses weak chop and weak chopstar.

	* InfiniteTheorems.thy: new file, the same lemmas as Theorems.thy
	but adapted for infinite and finite intervals. Additional
	subsection with lemmas with finite and inf constructs.

	* InfiniteSemantics.thy: new file, defines the semantics of ITL
	using both infinite and finite intervals depends on Semantics.thy
	(finite semantics).

	* InfiniteInterval.thy: new file, defining infinite intervals plus
	plenty of lemmas.

2019-06-18  Antonio Cau  <cau.researcher@gmail.com>

	* ROOT, Makefile: added TimeReversal.

	* Theorems.thy, TimeReversal.thy: moved section 'Properties of
	Time Reversal' from Theorems.thy to TimeReversal.thy.

	* ITL.thy, TimeReversal.thy: moved section 'Time reversal
	properties' from ITL.thy to TimeReversal.thy and renamed 'Time
	reversal Rules.

	* Semantics.thy, TimeReversal.thy: moved reverse_d from
	Semantics.thy to TimeReversal.thy.

	* TimeReversal.thy: new file.

2019-06-17  Antonio Cau  <cau.researcher@gmail.com>

	* Interval.thy: new subsubsection 'intapp'. Moved
	interval_suffix_intapp, interval_suffix_intapp2,
	interval_intapp_assoc, interval_intapp_nth, interval_rev_intapp
	from subsubsection 'Reverse' to subsubsection 'intapp'. Moved
	interval_intlen_intapp, interval_intrev_intlen from subsubsection
	'Reverse' to subsubsection 'intapp'. Added interval_prefix_intapp,
	interval_prefix_intapp2, interval_intlast_intapp,
	interval_intlast_intapp2, interval_intfirst_intapp,
	interval_intfirst_intapp2 to subsubsection 'intapp'. Removed
	interval_intlen_st (same as intlen.simps(1)). Removed
	interval_intrev_sub1, interval_intrev_sub2, interval_intrev_sub3,
	interval_intrev_sub4, the proof of interval_intrev_sub uses those
	lemmas as steps. Removed interval_intrev_idx_2,
	interval_intrev_idx_3, interval_intrev_idx_4,
	interval_intrev_idx_5, interval_intrev_idx_6,
	interval_intrev_idx_7, interval_intrev_idx_8,
	interval_intrev_idx_9, interval_intrev_idx_11,
	interval_intrev_idx_12.

2019-06-16  Antonio Cau  <cau.researcher@gmail.com>

	* Interval.thy: added subsubsection 'Map' in section 'Lemmas' with
	map_ext, map_ident, map_intapp, map_map, map_comp_map, intrev_map,
	map_eq_conv, map_cong, map_injective, inj_map_eq_map, inj_mapI,
	inj_mapD, inj_map, map_idI lemmas. Added interval_same_intapp_eq,
	interval_intapp_eq_conv, interval_intapp_same_eq,
	interval_rev_singleton_conv, interval_single_rev_conv,
	interval_rev_is_rev_conv, interval_rev_induct,
	interval_rev_exhaust, interval_rev_eq_cons_iff, to subsubsection
	'Reverse'.

2019-06-15  Antonio Cau  <cau.researcher@gmail.com>

	* Interval.thy: added set: to type 'a in datatype interval.

2019-06-13  Antonio Cau  <cau.researcher@gmail.com>

	* Example.thy: reworked the proofs that use 'unlift rule'.

	* FOTheorems.thy: have lemma EExI_unl as standalone lemma not
	using 'unlift rule'.

	* Semantics.thy, ITL.thy: remove ML code (from
	\cite{Merz98,GrovMerz}) from Semantics.thy. Move lemmas
	int_eq_true, int_eq, int_iffI, int_iffD1, int_iffD2,
	lift_imp_trans, lift_imp_neg, lift_and_com from Semantics.thy to
	ITL.thy (in new subsection 'Additional Lemmas'.

2019-05-04  Antonio Cau  <cau.researcher@gmail.com>

	* Interval.thy, Semantics.thy, Syntax.thy, ITL.thy, Theorems.thy,
	FOTheorems.thy, First.thy, Monitor.thy: replace legacy notation of
	text with cartouches.

2019-03-16  Antonio Cau  <cau.researcher@gmail.com>

	* Example.thy: structered the examples into subsections. Now each
	example in its own subsection.

2019-02-27  Antonio Cau  <cau.researcher@gmail.com>

	* Example.thy: added Testrev locale. Added testrev1 and testrev2
	lemmas.

2019-02-25  Antonio Cau  <cau.researcher@gmail.com>

	* Theorems.thy: added RAndEmptyEqvAndEmpty. Changed RInitEqvFin,
	RFinEqvInit, RWhile and removed RRInitEqvFin, RRFinEqvInit.

2019-02-24  Antonio Cau  <cau.researcher@gmail.com>

	* Semantics.thy, Example.thy, Theorems.thy: Changed assign_d to
	next_assign_d.

	* Theorems.thy: added RHaltEqvInitonly, RRHaltEqvInitonly,
	RInitonlyEqvHalt, RRInitonlyEqvHalt, RKeepEqvKeep, RRKeepEqvKeep,
	RassignEqvTAssign, RTAssignEqvAssign, RNextAssignEqvPrevAssign,
	RPrevAssignEqvNextAssign, RGetsEqvBaSkipImp, RIfThenElse, RWhile.

	* Semantics.thy: added initalt_defs, halt_defs. Added initonly_d
	definition (reverse of halt_d). Added initonly_defs.

2019-02-17  Antonio Cau  <cau.researcher@gmail.com>

	* ITL.thy: added subsection "Basic temporal variables
	properties". Added empty_imp_fin_eqv_curr, skip_imp_fin_eqv_next,
	skip_imp_penult_eqv_curr.

2019-02-16  Antonio Cau  <cau.researcher@gmail.com>

	* Example.thy: revnextcurrentfinpenult removed "more implies" and
	simplified proof.

	* ITL.thy: rev_current, rev_next, "more implies" is not
	needed. Added all_rev_eq.

2019-01-20  Antonio Cau  <cau.researcher@gmail.com>

	* First.thy: moved SkipTrueEqvTrueSkip, ChopEmptyAndEmpty,
	ChopSkipImpMore, MoreEqvMoreChopTrue, LFixedAndDistrB1,
	NotChopNotSkip to subsubsection "Fixed length intervals".

2019-01-19  Antonio Cau  <cau.researcher@gmail.com>

	* First.thy: created new subsubsection "Additional ITL theorems"
	under theorems. Moved BiOrBiImpBiOr, MoreAndBiImpBiChopSkip,
	BiBiOrImpBi, BiImpBiBiOr, BiImpBiBiOrB, BiBiOrEqvBi,
	DiEqvOrDiChopSkipA, SkipTrueEqvTrueSkip, DiEqvOrDiChopSkipB,
	BiEqvAndEmptyOrBiChopSkip, DiDiAndEqvDi, BiInduct, PrevLoop,
	PrevImpNotPrevNot, BiEqvAndWprevBi, DiIntroLoop, DiEqvOrChopMore,
	DiAndDiEqvDiAndDiOrDiAndDi, BoxStateEqvBiFinState,
	DiamondStateEqvDiFinState, OrDiEqvDi, AndDiEqv, ChopEmptyAndEmpty,
	ChopSkipImpMore, MoreEqvMoreChopTrue, BiEmptyEqvEmpty,
	EmptyChopSkipInduct, MoreImpImpChopSkipEqv, MoreImpImpPrevEqv,
	LFixedAndDistrB1, NotChopNotSkip, BiBoxNotEqvNotTrueChopChopTrue,
	DiAndEmptyEqvAndEmpty into this subsubsection.

2019-01-18  Antonio Cau  <cau.researcher@gmail.com>

	* Monitor.thy, First.thy: move BoxStateEqvBiFinState,
	DiamondStateEqvDiFinState, FstAndFstStarEqvFst, OrDiEqvDi,
	AndDiEqv, HaltStateEqvFstHaltState,
	DiHaltAndDiHaltAndEqvDiHaltAndAnd, counter_ex_lhs, counter_ex_rhs
	from Monitor.thy to First.thy.

2019-01-14  Antonio Cau  <cau.researcher@gmail.com>

	* Monitor.thy: incorporated changes from David: changed definition
	of REPEAT_d, added MWithFalse, MWithTrue, MThruUptoRDistrib,
	MUptoThruRDistrib. Added counter example for
	FstAndFstChopEqvFstChopAndFstChop: counter_ex_lhs, and
	counter_ex_rhs.

2018-12-30  Antonio Cau  <cau.researcher@gmail.com>

	* Makefile, ROOT: remove Intensional.thy because we will use the one
	from the Isabelle distribution.

	* Semantics.thy, ITL.thy, Theorems.thy, First.thy, Monitor.thy,
	FOTheorems.thy, MonitorExample.thy: In Semantics.thy use
	"HOL-TLA.Intensional" as import insted of Intensional.thy of
	\cite{GrovMerz}. This requires adding of brackets around negation
	of formula and some modification of the proofs. Added int_eq,
	int_iffI, int_iffD1, int_iffD2, lift_imp_trans, lift_imp_neg,
	lift_and_com lemmas from \cite{GrovMerz} to Semantics.thy.

	* Makefile, ROOT: make doc now generates html plus document.pdf.

2018-12-22  Antonio Cau  <cau.researcher@gmail.com>

	* Monitor.thy: added MThenAndDistrib, MThenUptoDistrib and
	MThenThruDistrib lemmas.

2018-12-21  Antonio Cau  <cau.researcher@gmail.com>

	* Monitor.thy: define equivalence relation (eq_d) on monitors, use
	them in the lemmas. Added MonEqRefl, MonEqSym, MonEqTrans, MonEq,
	MonEqSubstWith, MonEqSubstThen, MonEqSubstUpto, MonEqSubstThru
	lemmas.

2018-12-08  Antonio Cau  <cau.researcher@gmail.com>

	* TODO: add infinite intervals.

2018-11-28  Antonio Cau  <cau.researcher@gmail.com>

	* all: put files under svn.

2018-11-27  Antonio Cau  <cau.researcher@gmail.com>

	* FOTheorems.thy: added EExChopRightNoDep, EExChopLeftNoDep,
	ExChopRightNoDep, ExChopLeftNoDep, EExEExChopEqvEExChopEExA,
	EExEExChopEqvEExChopEExB, EExEExChopEqvEExChopEExC,
	EExEExChopEqvEExEExChop lemmas.

2018-11-26  Antonio Cau  <cau.researcher@gmail.com>

	* bumped version to 2.1.

	* Semantics.thy, ITL.thy: moved EExI, EExE, AAxDef, EExRev, and EExVal
	from Semantics.thy to ITL.thy subsection Quantification. Move
	subsection "Lemmas about @{text current_val}", "Lemmas about
	@{text next_val}", "Lemmas about @{text fin_val}", "Lemmas about
	@{text penult_val}", "Time reversal properties" from Semantics.thy
	to ITL.thy.

2018-11-25  Antonio Cau  <cau.researcher@gmail.com>

	* Monitor.thy: replaced axioms with recursive fun, proofs of
	monitor lemmas now simpler.

	* Example.thy, Semantics.thy: replaced axioms for quantifications
	by definitions. The axioms EExI, EExE, AAxDef, EExRev are now
	derived lemmas. Added EExVal lemma. Added Test1 locale and
	test_E_F5_1, test_E_F5_2, test_E_F5_3, test_E_F5_4, test_E_F5
	lemmas.

2018-11-21  Antonio Cau  <cau.researcher@gmail.com>

	* Theorems.thy, FOTheorems.thy, First.thy, Monitor.thy,
	Example.thy: reduce prop01-prop45 to Prop01-Prop12 and
	IfThenElseImp. Redone proofs.

2018-11-20  Antonio Cau  <cau.researcher@gmail.com>

	* version 2.0.

	* First.thy: added LenCommute, PowerCommute, PowerRev,
	PowerSkipEqvLen lemmas. Changed proof of RLenEqvLen.

2018-11-19  Antonio Cau  <cau.researcher@gmail.com>

	* MonitorExample.thy: added Mon6 with lemmas test5, test5_1,
	test5_2, test5_3, test5_4, test5_5, test5_6, test5_7, test5_8,
	test5_9, test5_10, test5_11, test5_12.

2018-11-17  Antonio Cau  <cau.researcher@gmail.com>

	* Semantics.thy: added unit assignment, prev unit assignment,
	always equal, temporal assignment, gets, stable, padded and padded
	temporal assignment. Added assign_defs, prev_assign_defs,
	always_eqv_defs, temporal_assign_defs, gets_defs,
	stable_defs_help, stable_defs, padded_defs,
	padded_temporal_assign_defs lemmas.

	* Semantics.thy, Theorems.thy, First.thy: changed type of time
	reversal from 'a formula to ('a,'b) formfun to handle time
	reversal of state (temporal) variables too.

2018-11-16  Antonio Cau  <cau.researcher@gmail.com>

	* Semantics.thy, Theorems.thy, First.thy, FOTheorems.thy: cleaned
	up time reversal.

	* Theorems.thy, FIRST.thy, Monitor.thy: removed itl_prop lemma,
	added prop41, prop42, prop43, prop44, prop45. Redo proofs.

	* MonitorExample.thy, ROOT, Makefile: new file containing sample
	monitors and lemmas.

2018-11-14  Antonio Cau  <cau.researcher@gmail.com>

	* Monitor.thy, ROOT, Makefile: copied First.thy from ITL
	v1. Changed to shallow encoding and managed to keep the ability to
	do structural induction over monitors, this required some thinking
	to get it right. Added Monitor.thy to ROOT and Makefile.

2018-11-11  Antonio Cau  <cau.researcher@gmail.com>

	* First.thy, ROOT, Makefile: copied First.thy from ITL v1. Changed
	to shallow encoding. Had to tweak most of the proofs. Added
	First.thy to ROOT and Makefile.

2018-11-10  Antonio Cau  <cau.researcher@gmail.com>

	* Semantics.thy: added rev_const, rev_fun1, rev_fun2, rev_fun3,
	rev_fun4, rev_forall, rev_exists, rev_exists1, rev_current,
	rev_next, rev_penult, rev_fin.

	* Semantics.thy, FOTheorems.thy: removed EExChopRight and
	EExChopLeft axioms from Semantics.thy as they can be
	derived. Added EExChopRight and EExChopLeft to
	FOTheorems.thy. Added EExRev to Semantics.thy and AAxRev to
	FOTheorems.thy.

	* Semantics.thy, ITL.thy: move EqvReverseReverse and ReverseEqv
	from Semantics.thy to ITL.thy. Added finalt_defs definition to
	Semantics.thy.

	* Semantics.thy: added penult_val_d (v!) to denote the value of a
	variable v in the pre-ultimate state of an interval. Use notation
	!v to denote the value of a variable in the final state of an
	interval. Added penultval_defs lemma.

2018-11-09  Antonio Cau  <cau.researcher@gmail.com>

	* Theorems.thy: added time reversal lemmas from ITL v1.

	* Semantics.thy: added time reversal operator. Added RevSkip,
	RevChop, RevAnd, RevOr, RevNot, RevTrue, EqvReverseReverse,
	ReverseEqv, ExEqvRule, RevEqvRule, RevExist, PowerChopCommute,
	RevPowerChop, RevChopstar lemmas.

	* FOTheorems.thy: Added AAxAndImport, AAxOrImport, CSPowerChop
	lemmas.

	* FOTheorems.thy, Semantics.thy: removed EExOrDist from
	Semantics.thy as it can be derived. Added EExOrDist_1,
	EExOrDist_2, EExOrDist_3, EExOrDist_4, EExOrDist to
	FOTheorems.thy. Removed EExOrImport from Semantics.thy as it can
	be derived. Added EExOrImport_1, EExOrImport_2, EExOrImport_3,
	EExOrImport_4 to FOTheorems.thy. Removed EExAndImport from
	Semantics.thy as it can be derived. Added EExAndImport_1,
	EExAndImport_2, EExAndImport to FOTheorems.thy.

	* Theorems.thy: removed itl_valid as it interferes too much,
	alas most lemmas need to be reworked.

2018-11-08  Antonio Cau  <cau.researcher@gmail.com>

	* FOTheorems.thy: added EExEqvRule, EExImpNoDepDist, EExAndDist,
	EExAndNoDepDist, AAxEqvRule, AAxAndDist, ExLen lemmas.

	* Semantics.thy: added EExOrDist, EExOrImport, EExAndImport as
	axioms.

2018-11-07  Antonio Cau  <cau.researcher@gmail.com>

	* FOTheorems.thy, ROOT: new file. Added EExNoDep, AAxNoDep,
	EExImpRule, EExImpRuleDist, Spec, AAxE, AAxI, AAxImpEEx,
	EExImpChopRule, lemmas. Added FOTheorems to ROOT.

	* Semantics.thy: renamed eexI, eexE, all_def, eexchopright,
	eexchopleft to EExI, EExE, AAxDef, EExChopRight, EExChopLeft.

2018-11-06  Antonio Cau  <cau.researcher@gmail.com>

	* Semantics.thy: remove basevars since we have no
	enabledness. Changed eexE, i.e., removed basevars.

2018-11-03  Antonio Cau  <cau.researcher@gmail.com>

	* Semantics.thy: added eexchopright and eexchopleft to
	axiomatization of quantification over state (flexible) variables.

	* Makefile, TODO: new files.

	* document/root.tex, document/root.bib: new files.

	* Example.thy: new file contains examples of using quantifiers.

	* Theorems.thy: copied from ITL v1 (deep) encoding of ITL but now
	uses the shallow syntax.

	* ITL.thy: copied from ITL v1 (deep) encoding of ITL but now uses
	the shallow syntax.

	* Interval.thy: copied from the ITL v1 (deep) encoding of ITL.

	* Semantics.thy: shallow semantical encoding of ITL based on
	Semantics.thy, State.thy of the TLA shallow
	encoding\cite{GrovMerz} and Semantics.thy of the ITL v1 (deep)
	encoding of ITL\cite{ITLHOLv1}.

	* Intensional.thy: copied from TLA shallow encoding \cite{GrovMerz}.

	* Changelog: start to document changes after a week of trying out
	things from \cite{GrovMerz}.

