Formal Specifications CSI 5342
Popular in Course
verified elite notetaker
Popular in ComputerScienence
This 2 page Class Notes was uploaded by Melvin Bednar on Saturday October 3, 2015. The Class Notes belongs to CSI 5342 at Baylor University taught by Paul Grabow in Fall. Since its upload, it has received 35 views. For similar materials see /class/217933/csi-5342-baylor-university in ComputerScienence at Baylor University.
Reviews for Formal Specifications
Report this Material
What is Karma?
Karma is the currency of StudySoup.
You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!
Date Created: 10/03/15
CSI 5342 Objectives Automata 632008 Reference Berard chapter 1 Know how to 59 H F P gt1 HHH oo 4 U3 Nt O39 39 UI ON D ID I OOI Calculate the number of state transitions in a nite automaton based on the number of its states Describe the execution of a nite automaton as an execution tree Describe how properties can be associated with an automaton Distinguish between an automaton s elementary properties ie atomic propositions from its properties Formally de ne an automata De ne the following with respect to automaton a4 a Path in a4 b Length ofa path in A c The ith state of a path in a4 d A partial execution ofaf e A complete execution of a4 f A reachable state in a4 g A maximal execution of a4 h Guards Explain why variables may or may not be desirable in a nite automaton Don t just simply copy a statement from the text Convert a nite automaton from its setbased de nition to its graphical representation and vice versa Draw an execution tree for a given nite automaton Describe how an automaton interacts with variables Unfold the behavior of an automaton with variables In an unfolded automaton explain why a Transitions are not guarded b There are no variable assignments listed on the transitions Explain what constitutes the control state for a global state in an unfolded automaton Describe the difference between automata that are synchronized with those that are not synchronized Describe to formally represent a The Cartesian product of automata b The synchronization of components within a Cartesian product of automata Given several automata in graphical form formally represent their Cartesian product Describe the concept of a reachable state Describe how a system is typically veri ed based on its representation as an automaton 19 Explain why a nite automaton with state variables may result in a global automaton that is ini nite 20 Interpret the notation used to represent a synchronized collection of automata using message passing 21 Interpret a collection of automata that are synchronized using shared variables Understand The examples used in class and in the handouts
Are you sure you want to buy this material for
You're already Subscribed!
Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'