Software engineering .2, Specification of systems and languages

=001  21656=003  OCoLC=005  20141108153124.1=008  060811s2006    gw a          001 0 eng=020  ##$a3540211500 (hbk.)=040  ##$aSLY $cSLY $dBAKER $dHUA=040  ##$aSLY $cSLY $dBAKER $dHUA $dOrLoB-B=041  0#$aeng=050  \4$aQA76.758 $b.B56 2006=082  04$a005.1 $222=092  ##$a005.1 $bB6 s=100  1#$aBjørner, D. $q(Dines), $d1937=245  #1$aSoftware engineering. $n2, $pSpecification of systems and languages / $cD. Bjørne=246  \\$aSpecification of systems and language=260  \\$aBerlin : $bSpringer, $c200=300  \\$axxiv, 777 p. : $bill. ; $c24 c=490  \\$aTexts in theoretical computer science . An EATCS serie=504  \\$aIncludes bibliographical references (p. [751]-777) and indexe=650  \\$aComputer programmin=650  \\$aSoftware engineerin=830  \\$aTexts in theoretical computer science . $pAn EATCS serie=970  \\$tPrefa=970  0#$l10.3 $tUML and RSL $p2=970  0#$l10.4 $tDiscussion $p2=970  0#$l10.4.1 $tModularity Issues $p2=970  0#$l10.4.2 $tPrinciples, Techniques and Tools $p2=970  0#$l11.3 $tFinite State Automata $p2=970  0#$l11.4.1 $tFinite State Machine Controllers $p3=970  0#$l11.4.2 $tFinite State Machine Parsers $p3=970  0#$l11.6 $tBibliographical Notes: Automata and Machines $p3=970  0#$l12.3 $tPlace Transition Nets (PTNs) $p3=970  0#$l13.1.9 $tSemantics of High-Level Message Sequence Charts $p4=970  0#$l13.3.2 $tSemantics of PA[subscript epsilon] $p4=970  0#$l13.3.4 $tSemantics for PAc[subscript epsilon] $p4=970  0#$l13.6.4 $tFormalisation of CTPs $p4=970  0#$l14 $tStatecharts $cChristian Krog Madsen $fMadsen, Christian Krog $p4=970  0#$l14.5.3 $tEquivalence for SPL Terms $p5=970  0#$l14.6 $tSemantics of Statecharts $p5=970  0#$l15.2 $tTemporal Logic $p5=970  0#$l15.2.1 $tThe Issues $p5=970  0#$l2.3.1 $tA Hierarchical, Narrative Presentation=970  0#$l2.3.2 $tA Hierarchical, Formal Presentation=970  0#$l3 $tDenotations and Computations=970  0#$l4 $tConfigurations: Contexts and States=970  0#$l4.3.4 $tDiscussion, I $p1=970  0#$l4.7 $tSecond Summary: Contexts and States $p1=970  0#$l7.11 $tExercises $p1=970  0#$l8 $tSyntax $p1=970  0#$l8.6 $tXML: Extensible Markup Language $p1=970  0#$l8.6.1 $tAn Example $p1=970  0#$l8.8 $tConverting RSL Types to BNF $p2=970  1#$l1.3.3 $tConcrete RSL Types=970  1#$l1.3.5 $tOther Applicative Expressions=970  1#$l10.3.1 $tOverview of UML Diagrams $p2=970  1#$l10.3.2 $tClass Diagrams $p2=970  1#$l10.5 $tBibliographical Notes $p2=970  1#$l11.3.1 $tRegular Expression Language Recognisers $p2=970  1#$l11.7 $tExercises $p3=970  1#$l12.5 $tCEN Example: Work Flow System $p3=970  1#$l12.8 $tBibliographical Notes $p3=970  1#$l13.1.8 $tSemantics of Basic Message Sequence Charts $p4=970  1#$l13.2 $tLive Sequence Charts: Informal Presentation $p4=970  1#$l13.5 $tRelating Message Charts to RSL $p4=970  1#$l13.5.1 $tTypes of Integration $p4=970  1#$l14.4 $tExamples $p4=970  1#$l15.2.2 $tA Philosophical Linguistics Background $p5=970  1#$l15.2.3 $tInterval Temporal Logic, ITL $p5=970  1#$l4.3.5 $tDiscussion, II $p1=970  1#$l4.8 $tInformation States and Behaviour States $p1=970  1#$l5.1 $tTime $p1=970  1#$l5.2.4 $tSpace - General Issues $p1=970  1#$l7.1 $tIntroduction $p1=970  1#$l7.2 $tConcrete Semantics $p1=970  1#$l7.7 $tOperational and Computational Semantics $p1=970  1#$l7.7.1 $tStack Semantics $p1=970  1#$l8.3.1 $tAnalytic Grammars: Observers and Selectors $p1=970  1#$l8.6.2 $tDiscussion $p1=970  1#$lPart VI $tConcurrency and Temporali=970  2#$l1.3.4 $t[lambda]-Calculus+Functions=970  2#$l10.2 $tRSL Classes, Objects and Schemes $p2=970  2#$l10.3.3 $tClass Diagrams $p2=970  2#$l10.6 $tExercises $p2=970  2#$l11 $tAutomata and Machines $p2=970  2#$l11.3.2 $tRegular Expressions $p2=970  2#$l12.5.1 $tProject Planning $p3=970  2#$l12.5.2 $tProject Activities $p3=970  2#$l12.7 $tDiscussion $p3=970  2#$l12.9 $tExercises $p3=970  2#$l13 $tMessage and Live Sequence Charts $cChristian Krog Madsen $fMadsen, Christian Krog $p3=970  2#$l13.2.1 $tLive Sequence Chart Syntax $p4=970  2#$l13.2.2 $tA Live Sequence Chart Example, I $p4=970  2#$l13.5.2 $tAn RSL Subset $p4=970  2#$l13.5.5 $tTool Support $p4=970  2#$l15.2.4 $tThe Classic Temporal Operators: [diamond], [square] $p5=970  2#$l15.3.4 $tThe Syntax $p5=970  2#$l2.3.3 $tA Compositional, Narrative Presentation=970  2#$l3.2.5 $tDiscussion of Denotational Semantics=970  2#$l3.3 $tComputational Semantics=970  2#$l4.4 $tFirst Summary: Contexts and States $p1=970  2#$l4.4.1 $tGeneral $p1=970  2#$l4.4.2 $tDevelopment Principles and Techniques $p1=970  2#$l4.8.1 $tProgram Flowcharts as State Machine Data $p1=970  2#$l4.8.2 $tFlowcharts [identical with] Machines $p1=970  2#$l5.1.1 $tTime - The Basics $p1=970  2#$l5.1.2 $tTime - General Issues $p1=970  2#$l5.3 $tSpace/Time $p1=970  2#$l7.3 $t"Abstract" Semantics $p1=970  2#$l7.4 $tPreliminary Semantics Concepts $p1=970  2#$l7.4.1 $tSyntactic and Semantic Types $p1=970  2#$l7.7.2 $tAttribute Grammar Semantics $p1=970  2#$l7.8 $tProof Rule Semantics $p1=970  2#$l8.3.2 $tSynthetic Grammars: Generators $p1=970  2#$l8.4 $tBNF Grammars [approximate] Concrete Syntax $p1=970  2#$l8.6.3 $tHistorical Background $p1=970  2#$l8.6.4 $tThe Current XML "Craze" $p1=970  2#$l8.8.1 $tThe Problem $p2=970  2#$l8.8.2 $tA Possible Solution $p2=970  2#$l8.9 $tDiscussion of Informal and Formal Syntax $p2=970  2#$l9.5.5 $tDiscussion of System Concepts $p2=970  2#$l9.5.6 $tSystems as Languages $p2=970  2#$lPart I $tOpeni=970  3#$l1.1 $tIntroduction=970  3#$l1.1.1 $tWhy This Volume?=970  3#$l1.1.2 $tWhy Master These Principles, Techniques and Tools?=970  3#$l10.1 $tIntroduction $p2=970  3#$l10.2.1 $tIntroducing the RSL "class" Concept $p2=970  3#$l10.2.2 $tThe RSL "class" Concept $p2=970  3#$l10.2.6 $tA "Large-Scale" Example $p2=970  3#$l10.3.4 $tExample: Railway Nets $p2=970  3#$l11.3.3 $tFormal Languages and Automata $p2=970  3#$l11.4.3 $tFinite State Machine Formalisation $p3=970  3#$l12.3.1 $tDescription $p3=970  3#$l12.3.2 $tSmall PTN Examples $p3=970  3#$l12.4.1 $tDescription $p3=970  3#$l12.4.2 $tA CPN Example $p3=970  3#$l12.6 $tCPN and RSL Examples: Superscalar Processor $p3=970  3#$l13.1.4 $tAn RSL Model of HMSC Syntax $p3=970  3#$l13.4 $tAlgebraic Semantics of Live Sequence Charts $p4=970  3#$l13.5.3 $tRelating Live Sequence Charts to RSL $p4=970  3#$l13.6 $tCommunicating Transaction Processes (CTP) $p4=970  3#$l13.6.1 $tIntuition $p4=970  3#$l13.6.2 $tNarration of CTPs $p4=970  3#$l13.7 $tDiscussion $p4=970  3#$l14.5 $tA Process Algebra for Statecharts $p4=970  3#$l14.6.1 $tAn SPL Semantics for Statecharts $p5=970  3#$l14.6.2 $tStatechart Example $p5=970  3#$l3.3.6 $tDiscussion=970  3#$l4.1 $tIntroduction=970  3#$l4.5 $tProgramming Language Configurations $p1=970  3#$l4.8.3 $tFlowchart Machines $p1=970  3#$l4.8.4 $tObservations $p1=970  3#$l7.4.2 $tContexts $p1=970  3#$l7.4.3 $tStates $p1=970  3#$l8.1 $tThe Issues $p1=970  3#$l8.4.1 $tBNF Grammars $p1=970  3#$l8.4.2 $tBNF[left and right arrow]RSL Parse Trees Relations $p1=970  3#$l8.6.5 $tXML Expressions $p1=970  3#$l8.6.6 $tXML Schemas $p1=970  3#$l8.9.1 $tGeneral $p2=970  3#$l8.9.2 $tPrinciples, Techniques and Tools $p2=970  3#$l9.1 $tSemiotics = Syntax [plus sign in circle] Semantics [plus sign in circle] Pragmatics $p2=970  3#$l9.2 $tSemiotics $p2=970  3#$l9.6 $tDiscussion $p2=970  3#$l9.6.1 $tGeneral $p2=970  3#$l9.6.2 $tPrinciples, Techniques and Tools $p2=970  4#$l1.1.3 $tWhat Does This Volume "Contain"?=970  4#$l1.1.4 $tHow Does This Volume "Deliver"?=970  4#$l1.3.6 $tImperative Constructs=970  4#$l10.1.1 $tSome Examples $p2=970  4#$l10.1.2 $tPreparatory Discussion $p2=970  4#$l11.3.4 $tAutomaton Completion $p2=970  4#$l11.4.4 $tFinite State Machine Realisation $p3=970  4#$l12.3.3 $tAn RSL Model of Place Transition Nets $p3=970  4#$l12.3.4 $tRailway Domain Petri Net Examples $p3=970  4#$l13.6.3 $tA Dining Philosophers Example $p4=970  4#$l14.4.1 $tRailway Line Automatic Blocking $p4=970  4#$l14.4.2 $tRailway Line Direction Agreement System $p4=970  4#$l14.7 $tRelating Statecharts to RSL $p5=970  4#$l3.3.1 $tThe Issues=970  4#$l3.3.2 $tTwo Examples=970  4#$l3.3.3 $tExpression Computations=970  4#$l3.3.4 $tComputational Semantics of GOTO Programs=970  4#$l4.2 $tThe Issues=970  4#$l4.6 $tConcurrent Process Configurations $p1=970  4#$l4.6.1 $tThe Example $p1=970  4#$l4.6.2 $tSummary $p1=970  4#$l4.8.5 $tConclusion $p1=970  4#$l4.9 $tFinal Summary: Contexts and States $p1=970  4#$l5.1.3 $t"A-Series" and "B-Series" Models of Time $p1=970  4#$l7.4.4 $tConfigurations $p1=970  4#$l7.4.5 $tInterpretation, Evaluation and Elaboration $p1=970  4#$l7.5 $tDenotational Semantics $p1=970  4#$l8.1.1 $tForm and Content: Syntax and Semantics $p1=970  4#$l8.1.2 $tStructure and Contents of This Chapter $p1=970  4#$l8.10 $tBibliographical Notes $p2=970  4#$l8.11 $tExercises $p2=970  4#$l8.5 $tStructure Generators and Recognisers $p1=970  4#$l9.3 $tLanguage Components $p2=970  4#$l9.7 $tCharles Sanders Peirce $p2=970  4#$l9.8 $tBibliographical Notes $p2=970  4#$l9.9 $tExercises $p2=970  5#$l1.2 $tFormal Techniques "Lite"=970  5#$l10.2.7 $tDefinitions: Class, Scheme and Object $p2=970  5#$l11.1 $tDiscrete State Automata $p2=970  5#$l11.3.5 $tNondeterministic Automata $p2=970  5#$l11.3.6 $tMinimal State Finite Automata $p2=970  5#$l11.4.5 $tFinite State Machines - A Summary $p3=970  5#$l12.1 $tThe Issues $p3=970  5#$l12.2 $tCondition Event Nets (CENs) $p3=970  5#$l13.1 $tMessage Sequence Charts $p3=970  5#$l13.1.5 $tMSCs Are HMSCs $p3=970  5#$l13.1.6 $tSyntactic Well-formedness of MSCs $p3=970  5#$l14.1 $tIntroduction $p4=970  5#$l14.2 $tA Narrative Description of Statecharts $p4=970  5#$l14.7.1 $tSyntactical Restrictions $p5=970  5#$l2.1 $tThe Issues=970  5#$l2.1.1 $tInformal Illustrations=970  5#$l2.3.4 $tA Compositional, Formal Presentation=970  5#$l3.1 $tIntroduction=970  5#$l3.1.1 $tComputations and Denotations=970  5#$l3.4 $tReview: Denotations and Computations=970  5#$l4.10 $tExercises $p1=970  5#$l5.1.4 $tA Continuum Theory of Time $p1=970  5#$l5.1.5 $tTemporal Events $p1=970  5#$l5.3.1 $tA Guiding Example $p1=970  5#$l5.3.2 $tRepresentation of Space/Time $p1=970  5#$l5.3.3 $tBlizard's Theory of Time-Space $p1=970  5#$l6.1 $tIntroduction $p1=970  5#$l6.2 $tEveryday Pragmatics $p1=970  5#$l7.5.1 $tSimple Case $p1=970  5#$l8.2 $tSentential Versus Semantical Structures $p1=970  5#$l8.2.1 $tGeneral $p1=970  5#$l8.2.2 $tExamples of Sentential Structures $p1=970  5#$l8.6.7 $tReferences $p1=970  5#$l9 $tSemiotics $p2=970  5#$l9.4 $tLinguistics $p2=970  5#$lPart V $tFurther Specification Techniqu=970  6#$l1.3 $tAn RSL Primer=970  6#$l1.3.7 $tProcess Constructs=970  6#$l10.3.5 $tComparison of UML and RSL OO Constructs $p2=970  6#$l11.1.1 $tIntuition $p2=970  6#$l11.3.7 $tFinite State Automata Formalisation, I $p2=970  6#$l11.5 $tPushdown Stack Devices $p3=970  6#$l12.2.1 $tDescription $p3=970  6#$l12.2.2 $tSmall CEN Examples $p3=970  6#$l12.4.3 $tAn RSL Model of Coloured Petri Nets $p3=970  6#$l12.4.4 $tTimed Coloured Petri Nets $p3=970  6#$l12.5.3 $tProject Generation $p3=970  6#$l12.6.1 $tDescription $p3=970  6#$l12.6.2 $tColoured Petri Net Model $p3=970  6#$l13.1.1 $tThe Issues $p3=970  6#$l13.1.2 $tBasic MSCs (BMSCs) $p3=970  6#$l13.1.3 $tHigh-Level MSCs (HMSCs) $p3=970  6#$l13.1.7 $tAn Example: IEEE 802.11 Wireless Network $p3=970  6#$l13.3.3 $tThe Process Algebra PAc[subscript epsilon] $p4=970  6#$l13.5.4 $tChecking Satisfaction $p4=970  6#$l14.3 $tAn RSL Model of the Syntax of Statecharts $p4=970  6#$l14.7.2 $tSatisfaction Relation $p5=970  6#$l14.7.3 $tChecking Satisfaction $p5=970  6#$l15.3.5 $tThe Informal Semantics $p5=970  6#$l2.1.2 $tFormal Illustrations=970  6#$l2.2 $tInitial Methodological Consequences=970  6#$l3.1.2 $tSyntax and Semantics=970  6#$l3.1.3 $tCharacterisations=970  6#$l3.2 $tDenotational Semantics=970  6#$l3.5 $tSome Pioneers of Semantics=970  6#$l3.5.1 $tJohn McCarthy=970  6#$l3.5.2 $tPeter Landin=970  6#$l5.1.6 $tTemporal Behaviour $p1=970  6#$l5.4 $tDiscussion $p1=970  6#$l6.3 $t"Formal" Pragmatics $p1=970  6#$l6.4 $tDiscussion $p1=970  6#$l7.5.2 $tComposite Case $p1=970  6#$l7.6 $tMacro-expansion Semantics $p1=970  6#$l7.9 $tDiscussion $p1=970  6#$l8.2.3 $tExamples of Semantical Structures $p1=970  6#$l8.5.1 $tContext-Free Grammars and Languages $p1=970  6#$l8.5.2 $tParse Trees $p1=970  6#$l9.5 $tLanguages and Systems $p2=970  6#$lPart III $tA Crucial Domain and Computing Fac=970  7#$l1.3.8 $tSimple RSL Specifications=970  7#$l10.2.3 $tThe RSL "object" Concept $p2=970  7#$l10.2.4 $tThe RSL "scheme" Concept $p2=970  7#$l10.2.5 $tRSL "scheme" Parameterisation $p2=970  7#$l11.1.2 $tMotivation $p2=970  7#$l11.3.8 $tFinite State Automata Realisation, I $p2=970  7#$l11.3.9 $tFinite State Automaton Formalisation, II $p2=970  7#$l11.5.1 $tPushdown Stack Automata and Machines $p3=970  7#$l11.5.2 $tFormalisation of Pushdown Stack Machines $p3=970  7#$l12.2.3 $tAn RSL Model of Condition Event Nets $p3=970  7#$l12.6.3 $tRSL Model: Superscalar Processor $p3=970  7#$l13.4.1 $tTextual Syntax of Live Sequence Charts $p4=970  7#$l13.4.2 $tSemantics of Live Sequence Charts $p4=970  7#$l13.7.1 $tGeneral $p4=970  7#$l13.7.2 $tPrinciples, Techniques and Tools $p4=970  7#$l14.7.4 $tTool Support $p5=970  7#$l15.1 $tThe Issues $p5=970  7#$l15.1.1 $tSoft Temporalities $p5=970  7#$l15.1.2 $tHard Temporalities $p5=970  7#$l15.3 $tThe Duration Calculus $p5=970  7#$l2.2.1 $tSome Definitions=970  7#$l2.2.2 $tPrinciples and Techniques=970  7#$l2.4 $tDiscussion=970  7#$l3.2.1 $tA Simple Example: Numerals=970  7#$l3.2.2 $tThe Denotational Principle=970  7#$l4.3 $t"Real-World" Contexts and States=970  7#$l5.1.7 $tRepresentation of Time $p1=970  7#$l5.1.8 $tOperations "on" Time $p1=970  7#$l5.5 $tBibliographical Notes $p1=970  7#$l5.6 $tExercises $p1=970  7#$l6.4.1 $tGeneral $p1=970  7#$l6.4.2 $tPrinciples and Techniques $p1=970  7#$l7.6.1 $tRewriting $p1=970  7#$l7.6.2 $tMacro-expansion $p1=970  7#$l8.7 $tAbstract Syntaxes $p1=970  7#$l8.7.1 $tAbstract Syntax of a Storage Model $p1=970  7#$l8.7.2 $tAbstract Syntaxes of Other Storage Models $p2=970  7#$l9.5.1 $tProfessional Languages $p2=970  7#$lPart IV $tLinguisti=970  8#$l1.3.1 $tTypes=970  8#$l1.3.2 $tThe RSL Predicate Calculus=970  8#$l10.3.6 $tReferences $p2=970  8#$l11.1.3 $tPragmatics $p2=970  8#$l11.2 $tDiscrete State Machines $p2=970  8#$l11.3.10 $tFinite State Automata Realisation, II $p2=970  8#$l12.4 $tColoured Petri Nets (CPNs) $p3=970  8#$l13.3 $tProcess Algebra $p4=970  8#$l13.4.3 $tThe Live Sequence Chart Example, II $p4=970  8#$l13.8 $tBibliographical Notes $p4=970  8#$l14.4.3 $tWireless Rain Gauge $p4=970  8#$l14.5.1 $tSPL: The Statechart Process Language $p4=970  8#$l14.8 $tDiscussion $p5=970  8#$l14.8.1 $tGeneral $p5=970  8#$l14.8.2 $tPrinciples, Techniques and Tools $p5=970  8#$l14.9 $tBibliographical Notes $p5=970  8#$l15.1.3 $tSoft and Hard Real-Time $p5=970  8#$l15.1.4 $tExamples - "Ye Olde Way"! $p5=970  8#$l15.1.5 $tStructure of This Chapter $p5=970  8#$l15.3.1 $tExamples, Part I $p5=970  8#$l15.3.2 $tSome Basic Notions $p5=970  8#$l15.3.6 $tExamples, Part III $p5=970  8#$l2.3 $tThe Main Example=970  8#$l3.2.3 $tExpression Denotations=970  8#$l3.2.4 $tGOTO Continuations=970  8#$l3.3.5 $tComputational Semantics of Coroutine Programs=970  8#$l3.6 $tExercises=970  8#$l4.3.1 $tA Physical System: Context and State=970  8#$l5.2 $tSpace $p1=970  8#$l6.5 $tBibliographical Note $p1=970  8#$l6.6 $tExercises $p1=970  8#$l7.6.3 $tInductive Rewritings $p1=970  8#$l7.6.4 $tFix Point Evaluation $p1=970  8#$l8.3 $tThe First Abstract Syntax, John McCarthy $p1=970  8#$l8.5.3 $tRegular Expressions and Languages $p1=970  8#$l9.5.2 $tMetalanguages $p2=970  9#$l1.4 $tBibliographical Notes=970  9#$l10.1.3 $tStructure of Chapter $p2=970  9#$l10.3.7 $tClass Diagram Limitations $p2=970  9#$l11.3.11 $tFinite State Automata - A Summary $p2=970  9#$l11.4 $tFinite State Machines $p3=970  9#$l11.5.3 $tPushdown Stack Device Summary $p3=970  9#$l13.3.1 $tThe Process Algebra PA[subscript epsilon] $p4=970  9#$l13.9 $tExercises $p4=970  9#$l14.10 $tExercises $p5=970  9#$l14.5.2 $tSemantics of SPL $p5=970  9#$l15 $tQuantitative Models of Time $p5=970  9#$l15.3.3 $tExamples, Part II $p5=970  9#$l15.3.7 $tTransitions and Events $p5=970  9#$l2.5 $tBibliographical Notes: Stanislaw Leshniewski=970  9#$l2.6 $tExercises=970  9#$l4.3.2 $tConfigurations of Contexts and States=970  9#$l4.3.3 $tNonphysical System: Context and State $p1=970  9#$l5.2.1 $tSpace - The Basics $p1=970  9#$l5.2.2 $tLocation-Varying Entities $p1=970  9#$l5.2.3 $tLocations and Dynamicity $p1=970  9#$l7 $tSemantics $p1=970  9#$l7.10 $tBibliographical Notes $p1=970  9#$l7.9.1 $tGeneral $p1=970  9#$l7.9.2 $tPrinciples, Techniques and Tools $p1=970  9#$l8.5.4 $tLanguage Recognisers $p1=970  9#$l9.5.3 $tSystems $p2=970  9#$l9.5.4 $tSystem Diagram Languages $p2=970  9#$lPart II $tSpecification Face=970  e#$tOvervi=970  g#$l1 $tIntroduction=970  L#$tAcknowledgmen=970  s#$l10 $tModularisation $p2=970  s#$l2 $tHierarchies and Compositions=970  s#$l6 $tPragmatics $p1=970  s#$tBrief Guide to Volume=970  s#$tThe RAISE Specification Language: R=970  t#$l5 $tTime, Space and Space/Time $p1=970  w#$t"UML"-ising Formal Techniqu=970  y#$l12 $tPetri Nets $cChristian Krog Madsen $fMadsen, Christian Krog $p3=LDR  20106nam a2204789Ia 4500