Documents Found!
As seen in
Less Work, Better Grades
Join
Course Hero
Access
best resources
Ace
your classes
Ace your courses with Course Hero!

Submit your homework question or assignment here:
352 Tutors are online
 
We are so confident that you will love our service, we will answer your first homework question for FREE!
*  Attach Assignment (optional):
 
Study Smarter, Score Higher
 
Document Content (unformatted)
Course Hero has millions of student submitted documents similar to the one below including study guides, homework solutions, papers, exam answer keys and textbook solutions.
Discrete-State CS780 Models Instructor: Peter Kemper R 006, phone 221-3462, email:kemper@cs.wm.edu Office hours: Mon,Wed 3-5 pm Today: Milner s Calculus of Communicating Systems Strong & Weak Bisimulation Observational Congruence Quick Reference: Robin Milner, A Calculus of Communicating Systems, Springer, LNCS 92, 1980. Robin Miner, Communication and Concurrency, Prentice Hall, 1989. 1 Outline Origin of Process Algebras: Calculus of Communicating Systems (CCS) Trace Equivalence Bisimulation Strong Weak Observational Congruence Credits: Slides from Noll, Katoen, RWTH Aachen, Germany, 2007/08 2 3 4 Meaning of CCS Operators 5 Notational Conventions 6 Labelled Transition System 7 Semantics of CCS 8 Semantics of CCS 9 Semantics of CCS 10 Semantics of CCS 11 Recursion 12 Equivalence 13 Equivalence of CCS Processes 14 Desired Properties of Equivalence 15 Congruence 16 Trace Equivalence 17 Trace Equivalence 18 Congruence 19 Trace Equivalence 20 Trace Equivalence 21 Deadlock 22 Deadlock 23 Desired Properties of Equivalence 24 Strong Bisimulation 25 Strong Bisimulation 26 Strong Bisimulation 27 Strong Bisimulation How to prove this? 28 Strong Bisimulation How to prove this? 29 Properties of Strong Bisimulation 30 Strong Bisimulation => Trace Equivalence 31 Congruence Property Makes use of following Lemma 32 Congruence 33 Deadlock 34 Summary 35 Traces and Deadlocks 36 Computing Equivalences Basic Algorithm: Paige, Tarjan: Three partition refinement algoriths, SIAM Computing, J. 16, 1987. P. Buchholz. Exact and ordinary lumpability in finite Markov chains. Journal of Applied Probability, 31:59 75, 1994. S. Derisavi, H. Hermanns, and W. H. Sanders. Optimal State-Space Lumping in Markov Chains, Information Proc. Letters, 87, 6, 2003 Multiple variants and refinements, in particular wrt stochastic models 37 Partition Refinement Algorithm 38 Strong Simulation 39 Strong Simulation and Bisimulation 40 Strong Bisimulation is not an ideal solution! 41 Weak Bisimulation 42 Weak Bisimulation 43 Weak Bisimulation 44 Weak Bisimulation 45 Weak Bisimulation 46 Weak Bisimulation 47 Weak Bisimulation 48 Properties of Weak Bisimulation 49 Properties of Weak Bisimulation 50 Observation Congruence 51 Observation Congruence 52 Observation Congruence 53 Observation Congruence 54 Observation Congruence 55 Observation Congruence 56 Observation Congruence 57 Observation Congruence 58 Summary Origin of Process Algebras: Calculus of Communicating Systems (CCS) Trace Equivalence Insensitive to deadlocks! Strong Bisimulation: too restrictive to be used for an equivalence between an abstract specification and a detailed implementation model, we need to abstract from internal operations Weak Bisimulation: no congruence wrt to choice, problem is an initial Tau step Compromise between strong and week bisimulation Yields congruence wrt CCS operations Bisimulation Observational Congruence Equivalence classes can be determined with algorithms based on partition refinement 59
Find millions of documents here - Study Guides, Homework Solutions, Papers, Exam Answer Keys and more. Course Hero has millions of course related materials that will enable you to learn better, faster and get an A in all your courses.
Below is a small sample set of documents:

Wisconsin Milwaukee >> CS >> 616 (Fall, 2009)
CS616 Stochastic Models in Computer Science Instructor: Peter Kemper R 006, phone 221-3462, email:kemper@cs.wm.edu Office hours: Mon,Wed 3-5 pm Grader: Yunlian Jiang, R 101B, email: jiang@cs.wm.edu Office hours: Tue,Thu 2-3 pm Today: Moment Genera...
Wisconsin Milwaukee >> CS >> 616 (Fall, 2009)
CS616 Stochastic Models in Computer Science Instructor: Peter Kemper R 006, phone 221-3462, email:kemper@cs.wm.edu Office hours: Mon,Wed 3-5 pm Yunlian Jiang R 101B, email: jiang@cs.wm.edu Grader: Today: More Distributions Quick Reference: Ross, C...
Wisconsin Milwaukee >> CS >> 616 (Fall, 2009)
Computer Science 616 - Stochastic Models in Computer Science Fall 2007, Homework 6, due Nov 28 at noon 1. Let the transition probability matrix of a two-state Markov chain be given by P = with 0 < p < 1. Prove that p 1p 1p p , P (n) = 1 2 ...
Wisconsin Milwaukee >> CS >> 616 (Fall, 2009)
CS616 Stochastic Models in Computer Science Instructor: Peter Kemper R 006, phone 221-3462, email:kemper@cs.wm.edu Office hours: Mon,Wed 3-5 pm Yunlian Jiang R 101B, email: jiang@cs.wm.edu Grader: Today: Random Variables Quick Reference: Ross, Ch....
Wisconsin Milwaukee >> CS >> 616 (Fall, 2009)
CS626 Stochastic Models in Computer Science Instructor: Peter Kemper R 006, phone 221-3462, email:kemper@cs.wm.edu Office hours: Mon,Wed 3-5 pm Yunlian Jiang R 101B, email: jiang@cs.wm.edu Grader: Today: Overview & Introduction Quick Reference: Ros...
Wisconsin Milwaukee >> CS >> 616 (Fall, 2009)
CS616 Stochastic Models in Computer Science Instructor: Peter Kemper R 006, phone 221-3462, email:kemper@cs.wm.edu Office hours: Mon,Wed 3-5 pm Grader: Yunlian Jiang, R 101B, email: jiang@cs.wm.edu Office hours: Tue,Thu 2-3 pm Today: Markov Chains...
Wisconsin Milwaukee >> CS >> 616 (Fall, 2009)
CS616 Stochastic Models in Computer Science Instructor: Peter Kemper R 006, phone 221-3462, email:kemper@cs.wm.edu Office hours: Mon,Wed 3-5 pm Grader: Yunlian Jiang, R 101B, email: jiang@cs.wm.edu Office hours: Tue,Thu 2-3 pm Today: Conditional P...
Wisconsin Milwaukee >> CS >> 616 (Fall, 2009)
CS616 Stochastic Models in Computer Science Instructor: Peter Kemper R 006, phone 221-3462, email:kemper@cs.wm.edu Office hours: Mon,Wed 3-5 pm Grader: Yunlian Jiang, R 101B, email: jiang@cs.wm.edu Office hours: Tue,Thu 2-3 pm Today: Markov Chains...
Wisconsin Milwaukee >> CS >> 616 (Fall, 2009)
CS616 Stochastic Models in Computer Science Instructor: Peter Kemper R 006, phone 221-3462, email:kemper@cs.wm.edu Office hours: Mon,Wed 3-5 pm Grader: Yunlian Jiang, R 101B, email: jiang@cs.wm.edu Office hours: Tue,Thu 2-3 pm Today: Conditional P...
Wisconsin Milwaukee >> CS >> 616 (Fall, 2009)
CS616 Stochastic Models in Computer Science Instructor: Peter Kemper R 006, phone 221-3462, email:kemper@cs.wm.edu Office hours: Mon,Wed 3-5 pm Grader: Yunlian Jiang, R 101B, email: jiang@cs.wm.edu Office hours: Tue,Thu 2-3 pm Today: Limit Theorem...
Wisconsin Milwaukee >> CS >> 301 (Fall, 2009)
CS301 Peter Kemper, R 104A, phone 221-3462, email:kemper@cs.wm.edu Grader: Fengyuan Xu, R 101A, email: fxu@cs.wm.edu Today: Notes on JavaDoc Quick Reference: http:/java.sun.com/j2se/javadoc/writingdoccomments/index.html http:/java.sun.com/javase/6/d...
Wisconsin Milwaukee >> CS >> 301 (Fall, 2009)
CS301 Peter Kemper, R 104A, phone 221-3462, email:kemper@cs.wm.edu Grader: Fengyuan Xu, R 11A, email: fxu@cs.wm.edu Today: Static code analysis TPTP, PMD, findbugs 1 This weeks topic what is it good for Static code analyzer are helpful to detect ...
Wisconsin Milwaukee >> CS >> 616 (Fall, 2009)
CS616 Stochastic Models in Computer Science Instructor: Peter Kemper R 006, phone 221-3462, email:kemper@cs.wm.edu Office hours: Mon,Wed 3-5 pm Yunlian Jiang R 101B, email: jiang@cs.wm.edu Grader: Office hours: Tue,Thu 2-3 pm Today: Jointly Distrib...
Wisconsin Milwaukee >> CS >> 616 (Fall, 2009)
Computer Science 616 - Stochastic Models in Computer Science Fall 2007, Homework 1, due Sept 7 at noon 1. We know that the denition of independence for n events E = {E1 , E2 , . . . , En }, F, F E, F = {F1 , F2 , . . . , Fm }, P (F1 F2 . . . Fm ...
Wisconsin Milwaukee >> CS >> 616 (Fall, 2009)
Computer Science 616 - Stochastic Models in Computer Science Fall 2007, Homework 3, due Sept 24 at noon 1. Chapter 2, Exercises 17, 18, 19, 20. 17. Suppose that an experiment can result in one of r possible outcomes, the ith outcome having probabili...
Wisconsin Milwaukee >> CS >> 616 (Fall, 2009)
CS616 Stochastic Models in Computer Science Instructor: Peter Kemper R 006, phone 221-3462, email:kemper@cs.wm.edu Office hours: Mon,Wed 3-5 pm Grader: Yunlian Jiang, R 101B, email: jiang@cs.wm.edu Office hours: Tue,Thu 2-3 pm Today: Conditional P...
Wisconsin Milwaukee >> CS >> 616 (Fall, 2009)
Computer Science 616 - Stochastic Models in Computer Science Fall 2007, Homework 4, due Oct 3 at noon 1. This homework is to prepare you for stochastic modeling and analysis with Mobius. (a) Download Mobius from http:/www.mobius.uiuc.edu/download.ht...
Wisconsin Milwaukee >> CS >> 616 (Fall, 2009)
Computer Science 616 - Stochastic Models in Computer Science Fall 2007, Homework 2, due Sept 17 at noon 1. (Section 2, Exercise 12) On an exam with ve multiple-choice questions, each with three possible answers, what is the probability of getting fo...
Wisconsin Milwaukee >> CS >> 654 (Fall, 2009)
Dependability Dependability is the ability of a system to deliver a specified service. System service is classified as proper if it is delivered as specified; otherwise it is improper. System failure is a transition from proper to improper servic...
Wisconsin Milwaukee >> CS >> 616 (Fall, 2009)
CS616 Stochastic Models in Computer Science Instructor: Peter Kemper R 006, phone 221-3462, email:kemper@cs.wm.edu Office hours: Mon,Wed 3-5 pm Grader: Yunlian Jiang, R 101B, email: jiang@cs.wm.edu Office hours: Tue,Thu 2-3 pm Today: Applications ...
Wisconsin Milwaukee >> CSC >> 652 (Fall, 2009)
Topics of This Class ! ! ! Related issues on local value numbering Scope of optimization Value numbering over extended basic blocks CSC652 Scope of Optimization Xipeng Shen 1/25/2007 1 Review: Local Value Numbering An example Original Code a!x+y ...
Wisconsin Milwaukee >> CSC >> 442 (Fall, 2009)
Introduction ! Translate program into 3-address intermediate representation A preparation for some code optimization and backend code generation Major problems to address: \" Translation of Statements (I) Xipeng Shen 10/29/2007 ! ! How to transla...
Wisconsin Milwaukee >> CSC >> 652 (Fall, 2009)
Goal ! A tool to automatically explore optimization space \" \" (Front-end) Accept cuda programs with annotations (Middle-end) Produce transformed cuda programs # Source-to-source CSC652 GPU Optimizor Project Xipeng Shen 04/02/08 optimizor \" (Fee...
Wisconsin Milwaukee >> CSC >> 420 (Fall, 2009)
CSCI420/520 Introduction to Statistical Learning Xipeng Shen 9/3/2006 Outline Review of last class Learning concept Designing a learner to play checkers Classification examples 2 Review of last class What is Artificial Intelligence? A st...
Wisconsin Milwaukee >> CSC >> 420 (Fall, 2009)
CSCI420/520 Review on Matrix and Probability Theory Xipeng Shen 9/6/06 Outline Quiz on matrix differentiation assignment Review of last class with answers to the quiz Matrix operations Probability theory 1 Design Choices Determine Type of Tra...
Wisconsin Milwaukee >> CSC >> 420 (Fall, 2009)
CSCI420/520 Expectation-Maximization (EM) Algorithm Xipeng Shen 10/20/06 Equivalence between ML and least squares hML 2 = arg max P(D | h) arg min (yi yi ) hH hH i =1 N Assumptions Additive Gaussian noise y = f (x) + Mutually independent ...
Wisconsin Milwaukee >> CS >> 526 (Fall, 2009)
Discrete-Data Histograms Discrete-Event Simulation: A First Course Section 4.2: Discrete-Data Histograms Section 4.2: Discrete-Data Histograms Discrete-Event Simulation c 2006 Pearson Ed., Inc. 0-13-142917-5 Discrete-Data Histograms Section 4....
Wisconsin Milwaukee >> CS >> 526 (Fall, 2009)
Continuous Random Variables Discrete-Event Simulation: A First Course Section 7.1: Continuous Random Variables Section 7.1: Continuous Random Variables Discrete-Event Simulation c 2006 Pearson Ed., Inc. 0-13-142917-5 Continuous Random Variables...
Wisconsin Milwaukee >> CS >> 424 (Fall, 2009)
CSci424/524 Homework 3 Due: 02/26/2008 You are asked to add the datapath parts and control signals needed to implement the addiu instruction in the multi-cycle datapath and control. Instruction addiu adds an immediate unsigned value. For example:...
Wisconsin Milwaukee >> CS >> 526 (Fall, 2009)
Generating Continuous Random Variates Discrete-Event Simulation: A First Course Section 7.2: Generating Continuous Random Variates Section 7.2: Generating Continuous Random Variates Discrete-Event Simulation c 2006 Pearson Ed., Inc. 0-13-142917-...
Wisconsin Milwaukee >> CS >> 526 (Fall, 2009)
CSci 426/526 Simulation Fall 2004 Examples To help you get a sense of my expectations, enclosed are (partial) solutions to three typical exercises. These three exercises illustrate the range of solution types you will be expected to produce. exerc...
Wisconsin Milwaukee >> CS >> 526 (Fall, 2009)
Interval Estimation Discrete-Event Simulation: A First Course Section 8.1: Interval Estimation Section 8.1: Interval Estimation Discrete-Event Simulation c 2006 Pearson Ed., Inc. 0-13-142917-5 Interval Estimation Section 8.1: Interval Estimati...
Wisconsin Milwaukee >> CSCI >> 780 (Fall, 2009)
Outline The Structure and Value of Modularity in Software Design Kevin J. Sullivan, William G. Griswold 1 Introduction Background Model Approach Extension Analysis Conclusion 2 Introduction The Goals of Software Design: Increase product qua...
Wisconsin Milwaukee >> CSCI >> 780 (Fall, 2009)
CSci 780 Advanced Software Engineering The Structure and Value of Modularity in Software Design Outline Problem Proposed Solution Background Analysis Conclusion Questions Sullivan, Griswold, Ben Hallen Baldwin and Clark Kevin J. Sullivan William G...
Wisconsin Milwaukee >> CSCI >> 780 (Fall, 2009)
Outline Static Detection of Dynamic Memory Errors Problem Example (simple) Solution LCLint Solution to Example Analysis Case Studies Conclusion Discussion Static Detection of Dynamic Memory Errors 2 David Evans 10/17/2003 The Problem Man...
Wisconsin Milwaukee >> CSCI >> 243 (Fall, 2009)
1 Algorithm Correctness Problems Problem 1. AL1(M) P = 1 I = 1 while (I < 2*M) P = P * I I = I + 2 return P 1. 2. 3. 4. 5. 6. Let pn and in be the values of P and I at line 3 after the nth iteration. Question 1. Write the recursive relation for in...
Wisconsin Milwaukee >> CS >> 131 (Fall, 2009)
CS 131 Fall 2004 Final Exam Review Name: 1. Construct the corresponding truth table for the logical expression: R (P Q) (P R) 2. Construct a logic circuit for the expression: Q (P R Q) 1 3. Derive the corresponding logical expression for t...
Wisconsin Milwaukee >> ISSRE >> 2003 (Fall, 2009)
Formal Semantics for Reliability Modeling Languages: A Case Study on BDMPs Robert R. Painter Dept. of Computer Science The College of William and Mary Williamsburg, VA 23185 Abstract The informal development of high-level modeling languages results i...
Wisconsin Milwaukee >> CS >> 131 (Fall, 2009)
2x\'4D$)Q7Q$)XWP`QP2CHQ$24wr2G@tfV )IQ$24Q0Q$IUG5 s V V 41 V $ G E 0r 0 (1G 4 0 $ (1 0 sj 0 B @\'fwwt470)u1X@21IGVtsQ7W$2VD02BwIq7Q0@bXWP}h)XuP\'s\'424\'0)WF)\'f)XtPrt)u1F@%\'fppl2(0o\'r`bI\'Gp@\'f$ 0 (1G $ 7G j s & 4 C x 0 4 ...
Wisconsin Milwaukee >> CS >> 131 (Fall, 2009)
Computer Science 131 Spring 2006 Concepts in Computer Science Class Schedule 01/18 01/23 01/25 01/30 02/01 02/06 02/08 02/13 02/15 02/20 02/22 02/27 03/01 03/06 03/08 03/13 03/15 03/20 03/22 03/27 03/29 04/03 04/05 04/10 04/12 04/17 04/19 04/24 04/2...
Wisconsin Milwaukee >> CS >> 131 (Fall, 2009)
Computer Science 131 Spring 2006 Concepts in Computer Science Robert Painter rrpain@cs.wm.edu 102 McGlothlinStreet Hall http:/www.cs.wm.edu/rrpain/teaching/cs131/ Class Time: MW 2:00 - 2:50 Oce Hours: MW 10:00 - 11:00, T 10:00 - 12:00 or by appointm...
Wisconsin Milwaukee >> CS >> 131 (Fall, 2009)
Final Review 1. Know the following terms and their denitions: computer science, algorithm, boolean algerbra, boolean operators, boolean variables, logical expressions, truth tables, circuits, tautology, contradiction, ip-op, memory, bit, byte, kiloby...
Wisconsin Milwaukee >> CSCI >> 243 (Fall, 2009)
CSci 243 Discrete Structures Lecture 5 Logic 1 9/6/2002 1 Outline Introduction, Propositions Compound Propositions Truth Tables Tautologies and Contradictions Predicates and Quantification 9/6/2002 2 Introduction to Logic Statements are ei...
Wisconsin Milwaukee >> CSCI >> 780 (Fall, 2009)
Outline CSci 780 Advanced Software Engineering Background: Model Checking Event-Driven Systems SCR CTL Model Checking SCR Specifications Case Studies Evaluation and Conclusion Discussion State-Based Model Checking of Event-Driven System Requ...
Wisconsin Milwaukee >> M >> 111 (Fall, 2009)
Fall 2008 Math 111 Lab 6 Linear Approximation In an earlier lab, we used the divided dierence, f (x) f (a) xa (with x a = 0) to estimate the value of the derivative, f (a) = lim f (x) f (a) , xa xa f (x) f (a) , xa (1) In other words, we are e...
Wisconsin Milwaukee >> MATH >> 490 (Fall, 2009)
VOLUME 87, NUMBER 19 PHYSICAL REVIEW LETTERS 5 NOVEMBER 2001 Diversity of Vegetation Patterns and Desertication J. von Hardenberg,1,4 E. Meron,1,3 M. Shachak,2 and Y. Zarmi1,3 1 Department of Solar Energy and Environmental Physics, BIDR, Ben Guri...
Wisconsin Milwaukee >> MATH >> 490 (Fall, 2009)
A review of stability and dynamical behaviors of dierential equations: u = f (u, v), t system of ODEs: vt = g(u, v), scalar ODE: ut = f (u), reaction-diusion equation: ut = Du + f (u), x , with boundary condition reaction-diusion system: u = D u...
Wisconsin Milwaukee >> MATH >> 410 (Fall, 2009)
Problem Set 6 Discussion: Nov. 6 Discussion Problems 1. (a) Prove that for a, b, c > 0 satisfying (1 + a)(1 + b)(1 + c) = 8, then abc 1. (b) Prove that for a, b, c > 0, then (a2 b + b2 c + c2 a)(a2 c + b2 a + c2 b) 9a2 b2 c2 . (Carolyn) 2. Given th...
Wisconsin Milwaukee >> MATH >> 410 (Fall, 2009)
Problem Set 5 Discussion Problems 1. (VT 1983) Let f (x) = 1/x and g(x) = 1 x for x (0, 1). List all distinct functions that can be written in the form f g f g f g f where represents composition. Write each function in the form (ax + b)/...
Wisconsin Milwaukee >> MATH >> 410 (Fall, 2009)
Pigeonhole Principle The pigeonhole principle states that if n pigeons are put into m pigeonholes, and if n > m, then at least one pigeonhole must contain more than one pigeon. Another way of stating this would be that m holes can hold at most m obje...
Wisconsin Milwaukee >> MATH >> 490 (Fall, 2009)
Turing patterns in a single-step autocatalytic reaction Dezso Horvath and Agota Toth Department of Physical Chemistry, Jozsef Attila University, P.O. Box 105, Szeged, H-6701, Hungary Stable Turing patterns are presented in the simplest reaction...
Wisconsin Milwaukee >> M >> 111 (Fall, 2009)
Fall 2008 Math 111 Lab 4 Exploring the Derivative The derivative of a function is one of the most powerful tools in mathematics. It is often invaluable for investigations in both the physical, biological, and, to a lesser extent, the social science...
Wisconsin Milwaukee >> M >> 111 (Fall, 2009)
Fall 2008 Math 111 Lab 9 Newtons Method In almost every application of mathematics, it is necessary to solve equations. When there is only one independent variable, the equation may be expressed in the form f (x) = 0, where f (x) is usually a dieren...
N.E. Illinois >> AY >> 12122006 (Fall, 2009)
English Language Arts with Teacher Certification reflecting changes to the English Major English Language Arts Option for Teacher Certification The English Language Arts Certification Option is for students who would like to major in English and gain...
N.E. Illinois >> AY >> 20062007 (Fall, 2009)
English Language Arts with Teacher Certification reflecting changes to the English Major English Language Arts Option for Teacher Certification The English Language Arts Certification Option is for students who would like to major in English and gain...
N.E. Illinois >> MAR >> 2004 (Fall, 2009)
MEMORANDUM TO: FROM: DATE: RE: Vice President Lord Charles A. Rohn, Dean College of Education and Professional Studies March 3, 2004 Executive Action Item I concur with Dr. Shanks recommendation to revise the catalog regarding the requirement for ...
Wisconsin Milwaukee >> JAN >> 05 (Fall, 2009)
Volume LXII, Number 1 William and Mary Quarterly Reviews of Books The Great Meadow: Farmers and the Land in Colonial Concord. By BRIAN DONAHUE. New Haven, Conn.: Yale University Press, 2004. 344 pages. $35.00 (cloth). Reviewed by Steven Stoll, Yal...
Wisconsin Milwaukee >> OCT >> 06 (Fall, 2009)
Volume LXIII, Number 4 William and Mary Quarterly Reviews of Books American Curiosity: Cultures of Natural History in the Colonial British Atlantic World. By SUSAN SCOTT PARRISH. Chapel Hill: University of North Carolina Press, 2006. Published for...
Wisconsin Milwaukee >> JAN >> 06 (Fall, 2009)
Volume LXIII, Number 1 William and Mary Quarterly Reviews of Books Slave Country: American Expansion and the Origins of the Deep South. By ADAM ROTHMAN. Cambridge, Mass.: Harvard University Press, 2005. 312 pages. $35.00 (cloth). Reviewed by T. St...
Wisconsin Milwaukee >> OCT >> 05 (Fall, 2009)
Volume LXII, Number 4 William and Mary Quarterly Reviews of Books From Tavern to Courthouse: Architecture and Ritual in American Law, 16581860. By MARTHA J. MCNAMARA. Creating the North American Landscape. Baltimore: Johns Hopkins University Press...
Wisconsin Milwaukee >> OCT >> 06 (Fall, 2009)
Volume LXIII, Number 4 William and Mary Quarterly Reviews of Books Eighteenth-Century Criminal Transportation: The Formation of the Criminal Atlantic. By GWENDA MORGAN and PETER RUSHTON. New York: Palgrave Macmillan, 2004. 250 pages. $69.95 (cloth...
Wisconsin Milwaukee >> APR >> 04 (Fall, 2009)
Volume LXI, Number 2 William and Mary Quarterly Reviews of Books Africans in Colonial Mexico: Absolutism, Christianity, and Afro-Creole Consciousness, 15701640. By HERMAN L. BENNETT. (Bloomington and Indianapolis: Indiana University Press, 2003. P...
Wisconsin Milwaukee >> JAN >> 06 (Fall, 2009)
Volume LXIII, Number 1 William and Mary Quarterly Reviews of Books Avengers of the New World: The Story of the Haitian Revolution. By LAURENT DUBOIS. Cambridge, Mass.: Harvard University Press, 2004. 384 pages. $29.95 (cloth), $17.95 (paper). A Co...
Wisconsin Milwaukee >> JAN >> 04 (Fall, 2009)
Volume LX1, Number 1 William and Mary Quarterly Tales from the Ships David Eltis, Emory University Reviews of Books A Slaving Voyage to Africa and Jamaica: The Log of the Sandown, 17931794. Edited by BRUCE L. MOUSER. (Bloomington: Indiana Universi...
Wisconsin Milwaukee >> APR >> 06 (Fall, 2009)
Volume LXIII, Number 2 William and Mary Quarterly They Were All Atlanticists Then Reviews of Books Gloria L. Main, University of Colorado, Boulder The Early Modern Atlantic Economy. Edited by JOHN J. MCCUSKER and KENNETH MORGAN. Cambridge: Cambrid...
Wisconsin Milwaukee >> OCT >> 04 (Fall, 2009)
Volume LXI, Number 4 William and Mary Quarterly Reviews of Books Atlantic Virginia: Intercolonial Relations in the Seventeenth Century. By APRIL LEE HATFIELD. (Philadelphia: University of Pennsylvania Press, 2004. Pp. 312. $39.95.) Reviewed by Pat...
Wisconsin Milwaukee >> APR >> 05 (Fall, 2009)
Volume LXII, Number 2 William and Mary Quarterly Reviews of Books Captors and Captives: The 1704 French and Indian Raid on Deerfield. By EVAN HAEFELI and KEVIN SWEENEY. Amherst: University of Massachusetts Press, 2003. 408 pages. $29.95 (cloth). R...
Wisconsin Milwaukee >> JAN >> 04 (Fall, 2009)
Volume LX1, Number 1 William and Mary Quarterly Reviews of Books Humanism and America: An Intellectual History of English Colonisation, 15001625. By ANDREW FITZMAURICE. Ideas in Context. (Cambridge: Cambridge University Press, 2003. Pp. x, 216, $5...
Wisconsin Milwaukee >> APR >> 05 (Fall, 2009)
Volume LXII, Number 2 William and Mary Quarterly Reviews of Books Manufacturing Revolution: The Intellectual Origins of Early American Industry. By LAWRENCE A. PESKIN. Studies in Early American Economy and Society from the Library Company of Phila...
Wisconsin Milwaukee >> APR >> 05 (Fall, 2009)
Volume LXII, Number 2 William and Mary Quarterly Reviews of Books Villains of All Nations: Atlantic Pirates in the Golden Age. By MARCUS REDIKER. Boston: Beacon Press, 2004. 256 pages. $24.00 (cloth), $16.00 (paper). Reviewed by Simon P. Newman, U...
What are you waiting for?