Commit ce01dfe1 authored by Björn Brandenburg's avatar Björn Brandenburg

address spell-checker complaints in behavior module

parent 085ea530
...@@ -25,7 +25,7 @@ Class JobReady (Job : JobType) (PState : Type) ...@@ -25,7 +25,7 @@ Class JobReady (Job : JobType) (PState : Type)
(** Based on the general notion of readiness, we define what it means to be (** Based on the general notion of readiness, we define what it means to be
backlogged, i.e., ready to run but not executing. *) backlogged, i.e., ready to run but not executing. *)
Section Backlogged. Section Backlogged.
(** Conside any kinds of jobs and any kind of processor state. *) (** Consider any kinds of jobs and any kind of processor state. *)
Context {Job : JobType} {PState : Type}. Context {Job : JobType} {PState : Type}.
Context `{ProcessorState Job PState}. Context `{ProcessorState Job PState}.
...@@ -79,7 +79,7 @@ Section ValidSchedule. ...@@ -79,7 +79,7 @@ Section ValidSchedule.
jobs_must_be_ready_to_execute. jobs_must_be_ready_to_execute.
(** Note that we do not explicitly require that a valid schedule satisfies (** Note that we do not explicitly require that a valid schedule satisfies
jobs_must_arrive_to_execute or completed_jobs_dont_execute because these [jobs_must_arrive_to_execute] or [completed_jobs_dont_execute] because these
properties are implied by jobs_must_be_ready_to_execute. *) properties are implied by jobs_must_be_ready_to_execute. *)
End ValidSchedule. End ValidSchedule.
...@@ -6,7 +6,7 @@ Require Export rt.restructuring.behavior.arrival_sequence. ...@@ -6,7 +6,7 @@ Require Export rt.restructuring.behavior.arrival_sequence.
(** Rather than choosing a specific schedule representation up front, we define (** Rather than choosing a specific schedule representation up front, we define
the notion of a generic processor state, which allows us to state general the notion of a generic processor state, which allows us to state general
definitions of core concepts (such as "how much service has a job definitions of core concepts (such as "how much service has a job
received") that work across many possble scenarios (e.g., ideal received") that work across many possible scenarios (e.g., ideal
uniprocessor schedules, schedules with overheads, variable-speed uniprocessor schedules, schedules with overheads, variable-speed
processors, multiprocessors, etc.). processors, multiprocessors, etc.).
......
(** * Model of Time *) (** * Model of Time *)
(** Prosa is based on a discrete model of time. Thus, time is simply defined by (** Prosa is based on a discrete model of time. Thus, time is simply defined by
the natural numbers. To aid readability, we distinguish between time values the natural numbers. To aid readability, we distinguish between values of time
that represent durations and time values that represent specific that represent a duration and values of time that represent a specific
instants. *) instant. *)
Definition duration := nat. Definition duration := nat.
Definition instant := nat. Definition instant := nat.
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment