The Resource CONCUR 2011concurrency theory : 22nd international conference, CONCUR 2011, Aachen, Germany, September 69, 2011 : proceedings, JoostPieter Katoen, Barbara König (eds.)
CONCUR 2011concurrency theory : 22nd international conference, CONCUR 2011, Aachen, Germany, September 69, 2011 : proceedings, JoostPieter Katoen, Barbara König (eds.)
Resource Information
The item CONCUR 2011concurrency theory : 22nd international conference, CONCUR 2011, Aachen, Germany, September 69, 2011 : proceedings, JoostPieter Katoen, Barbara König (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 2 library branches.
Resource Information
The item CONCUR 2011concurrency theory : 22nd international conference, CONCUR 2011, Aachen, Germany, September 69, 2011 : proceedings, JoostPieter Katoen, Barbara König (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 2 library branches.
 Summary
 Annotation This book constitutes the refereed proceedings of the 22nd International Conference on Concurrency Theory, CONCUR 2011, held in Aachen, Germany, September 510, 2011. The 32 revised full papers were carefully reviewed and selected from 94 submissions. The papers are organized in topics such as realtime systems, probabilistic systems, automata, separation logic, calculus, Petri nets, process algebra and modeling, verification, games, and bisimulation
 Language
 eng
 Extent
 1 online resource (xiv, 560 pages)
 Contents

 Intro; Title; Preface; Organization; Table of Contents; Invited Talks; Carrying Probabilities to the Infinite World; Introduction; Transition Systems; Petri Nets; Model; Safety Properties; Algorithm; Finite Span; VASS; Markov Chains; Decisive Markov Chains; Sufficient Condition I; Sufficient Condition II; Probabilistic Petri Nets; Communicating Processes; Qualitative Analysis; Reachability; Repeated Reachability; Quantitative Analysis; References; Generalized Universality; Introduction; State Machine Replication: The Classics; Model; Protocol; Correctness
 Generalized State Machine ReplicationProperties; Kset Consensus; From 1 to k; Vectors of AdoptCommit Objects; Protocol; Correctness; Concluding Remarks; References; Causal Nets: A Modeling Language Tailored towards Process Discovery; Motivation; Causal Nets; Definition; Valid Sequences; Soundness; Relating Cnets and Petri Nets; Petri Nets and WFnets; Mapping WFnets onto Cnets; Mapping Cnets onto WFnets; Application of Cnets in ProM; Model Management and Conversion; ModelBased Verification; Process Discovery; Conformance Checking and Performance Analysis; Conclusion; References
 On Causal Semantics of Petri Nets (Extended Abstract)Introduction; Place Transition Systems; Processes of Place/Transition Systems; Conflicts in Place/Transition Systems; A ConflictFree Net Has Exactly One Maximal Run; BDProcesses Fit Structural Conflict Nets; References; RealTime Systems; On Expressive Powers of Timed Logics: Comparing Boundedness, Nonpunctuality, and Deterministic Freezing; Introduction; Timed Temporal Logics: Syntax and Semantics; Preliminaries; Metric Temporal Logics; Freeze Logics; EF Games for IvMTL[UI, SI]; Separating Sub Logics of MTL[UI, SI]; TPTL and MTL
 Comparing TTL[X, Y] with MTL[UI, SI] FragmentsEmbedding TTL[X, Y] into MITL[FI, PI]:; On Limited Expressive Power of TTL[X, Y]; References; Timed Automata Can Always Be Made Implementable; Introduction; Timed Models and Specifications; Timed Transition Systems and Behavioural Relations; Timed Automata; Quantitative Extension of Computation Tree Logic; Implementability; Robustness; Samplability; Main Result of the Paper; Making Timed Automata Robust and Samplable; Proof of Correctness; Properties of Regions; Proof of Robustness; Proof of Samplability
 Proof of Safety Preservation (Ready Simulation)Conclusion; References; Coarse Abstractions Make Zeno Behaviours Difficult to Detect; Introduction; ZenoRelated Problems for Timed Automata; Timed Automata; Symbolic Semantics, Zenoness and Nonzenoness Problems; Nonzenoness is NPcomplete for ExtraLU; Finding Nonzeno Runs; Reduced Guessing Zone Graph rGZGa(A); Polynomial Algorithms for NZPa; The Zenoness Problem; Reducing 3SAT to ZPa with Abstraction ExtraLU; Finding Zeno Paths; Weakening the U Bounds; Conclusion; References; Probabilistic Systems
 Isbn
 9783642232176
 Label
 CONCUR 2011concurrency theory : 22nd international conference, CONCUR 2011, Aachen, Germany, September 69, 2011 : proceedings
 Title
 CONCUR 2011concurrency theory
 Title remainder
 22nd international conference, CONCUR 2011, Aachen, Germany, September 69, 2011 : proceedings
 Statement of responsibility
 JoostPieter Katoen, Barbara König (eds.)
 Subject

 Computer Communication Networks
 Computer Science
 Computer multitasking
 Computer multitasking
 Computer multitasking  Congresses
 Conference papers and proceedings
 Conference papers and proceedings
 Engineering & Applied Sciences
 Information Systems Applications (incl. Internet)
 Informatique
 Logics and Meanings of Programs
 Parallel processing (Electronic computers)
 Parallel processing (Electronic computers)
 Parallel processing (Electronic computers)  Congresses
 Programming Languages, Compilers, Interpreters
 Software Engineering
 Artificial Intelligence (incl. Robotics)
 Language
 eng
 Summary
 Annotation This book constitutes the refereed proceedings of the 22nd International Conference on Concurrency Theory, CONCUR 2011, held in Aachen, Germany, September 510, 2011. The 32 revised full papers were carefully reviewed and selected from 94 submissions. The papers are organized in topics such as realtime systems, probabilistic systems, automata, separation logic, calculus, Petri nets, process algebra and modeling, verification, games, and bisimulation
 Cataloging source
 CUS
 Dewey number
 004/.35
 Illustrations
 illustrations
 Index
 index present
 LC call number
 QA76.58
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2011
 http://bibfra.me/vocab/lite/meetingName
 International Conference on Concurrency Theory
 Nature of contents

 dictionaries
 bibliography
 http://library.link/vocab/relatedWorkOrContributorName

 Katoen, JoostPieter
 König, Barbara
 Series statement

 Lecture notes in computer science,
 Advanced research in computing and software science
 LNCS sublibrary. SL 1, Theoretical computer science and general issues
 Series volume
 6901.
 http://library.link/vocab/subjectName

 Parallel processing (Electronic computers)
 Computer multitasking
 Informatique
 Computer multitasking
 Parallel processing (Electronic computers)
 Engineering & Applied Sciences
 Computer Science
 Computer Science
 Software Engineering
 Logics and Meanings of Programs
 Computer Communication Networks
 Programming Languages, Compilers, Interpreters
 Information Systems Applications (incl. Internet)
 Artificial Intelligence (incl. Robotics)
 Label
 CONCUR 2011concurrency theory : 22nd international conference, CONCUR 2011, Aachen, Germany, September 69, 2011 : proceedings, JoostPieter Katoen, Barbara König (eds.)
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents

 Intro; Title; Preface; Organization; Table of Contents; Invited Talks; Carrying Probabilities to the Infinite World; Introduction; Transition Systems; Petri Nets; Model; Safety Properties; Algorithm; Finite Span; VASS; Markov Chains; Decisive Markov Chains; Sufficient Condition I; Sufficient Condition II; Probabilistic Petri Nets; Communicating Processes; Qualitative Analysis; Reachability; Repeated Reachability; Quantitative Analysis; References; Generalized Universality; Introduction; State Machine Replication: The Classics; Model; Protocol; Correctness
 Generalized State Machine ReplicationProperties; Kset Consensus; From 1 to k; Vectors of AdoptCommit Objects; Protocol; Correctness; Concluding Remarks; References; Causal Nets: A Modeling Language Tailored towards Process Discovery; Motivation; Causal Nets; Definition; Valid Sequences; Soundness; Relating Cnets and Petri Nets; Petri Nets and WFnets; Mapping WFnets onto Cnets; Mapping Cnets onto WFnets; Application of Cnets in ProM; Model Management and Conversion; ModelBased Verification; Process Discovery; Conformance Checking and Performance Analysis; Conclusion; References
 On Causal Semantics of Petri Nets (Extended Abstract)Introduction; Place Transition Systems; Processes of Place/Transition Systems; Conflicts in Place/Transition Systems; A ConflictFree Net Has Exactly One Maximal Run; BDProcesses Fit Structural Conflict Nets; References; RealTime Systems; On Expressive Powers of Timed Logics: Comparing Boundedness, Nonpunctuality, and Deterministic Freezing; Introduction; Timed Temporal Logics: Syntax and Semantics; Preliminaries; Metric Temporal Logics; Freeze Logics; EF Games for IvMTL[UI, SI]; Separating Sub Logics of MTL[UI, SI]; TPTL and MTL
 Comparing TTL[X, Y] with MTL[UI, SI] FragmentsEmbedding TTL[X, Y] into MITL[FI, PI]:; On Limited Expressive Power of TTL[X, Y]; References; Timed Automata Can Always Be Made Implementable; Introduction; Timed Models and Specifications; Timed Transition Systems and Behavioural Relations; Timed Automata; Quantitative Extension of Computation Tree Logic; Implementability; Robustness; Samplability; Main Result of the Paper; Making Timed Automata Robust and Samplable; Proof of Correctness; Properties of Regions; Proof of Robustness; Proof of Samplability
 Proof of Safety Preservation (Ready Simulation)Conclusion; References; Coarse Abstractions Make Zeno Behaviours Difficult to Detect; Introduction; ZenoRelated Problems for Timed Automata; Timed Automata; Symbolic Semantics, Zenoness and Nonzenoness Problems; Nonzenoness is NPcomplete for ExtraLU; Finding Nonzeno Runs; Reduced Guessing Zone Graph rGZGa(A); Polynomial Algorithms for NZPa; The Zenoness Problem; Reducing 3SAT to ZPa with Abstraction ExtraLU; Finding Zeno Paths; Weakening the U Bounds; Conclusion; References; Probabilistic Systems
 Control code
 748410079
 Extent
 1 online resource (xiv, 560 pages)
 Form of item
 online
 Isbn
 9783642232176
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783642232176
 Other physical details
 illustrations.
 http://library.link/vocab/ext/overdrive/overdriveId
 9783642232169
 Specific material designation
 remote
 System control number
 (OCoLC)748410079
 Label
 CONCUR 2011concurrency theory : 22nd international conference, CONCUR 2011, Aachen, Germany, September 69, 2011 : proceedings, JoostPieter Katoen, Barbara König (eds.)
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents

 Intro; Title; Preface; Organization; Table of Contents; Invited Talks; Carrying Probabilities to the Infinite World; Introduction; Transition Systems; Petri Nets; Model; Safety Properties; Algorithm; Finite Span; VASS; Markov Chains; Decisive Markov Chains; Sufficient Condition I; Sufficient Condition II; Probabilistic Petri Nets; Communicating Processes; Qualitative Analysis; Reachability; Repeated Reachability; Quantitative Analysis; References; Generalized Universality; Introduction; State Machine Replication: The Classics; Model; Protocol; Correctness
 Generalized State Machine ReplicationProperties; Kset Consensus; From 1 to k; Vectors of AdoptCommit Objects; Protocol; Correctness; Concluding Remarks; References; Causal Nets: A Modeling Language Tailored towards Process Discovery; Motivation; Causal Nets; Definition; Valid Sequences; Soundness; Relating Cnets and Petri Nets; Petri Nets and WFnets; Mapping WFnets onto Cnets; Mapping Cnets onto WFnets; Application of Cnets in ProM; Model Management and Conversion; ModelBased Verification; Process Discovery; Conformance Checking and Performance Analysis; Conclusion; References
 On Causal Semantics of Petri Nets (Extended Abstract)Introduction; Place Transition Systems; Processes of Place/Transition Systems; Conflicts in Place/Transition Systems; A ConflictFree Net Has Exactly One Maximal Run; BDProcesses Fit Structural Conflict Nets; References; RealTime Systems; On Expressive Powers of Timed Logics: Comparing Boundedness, Nonpunctuality, and Deterministic Freezing; Introduction; Timed Temporal Logics: Syntax and Semantics; Preliminaries; Metric Temporal Logics; Freeze Logics; EF Games for IvMTL[UI, SI]; Separating Sub Logics of MTL[UI, SI]; TPTL and MTL
 Comparing TTL[X, Y] with MTL[UI, SI] FragmentsEmbedding TTL[X, Y] into MITL[FI, PI]:; On Limited Expressive Power of TTL[X, Y]; References; Timed Automata Can Always Be Made Implementable; Introduction; Timed Models and Specifications; Timed Transition Systems and Behavioural Relations; Timed Automata; Quantitative Extension of Computation Tree Logic; Implementability; Robustness; Samplability; Main Result of the Paper; Making Timed Automata Robust and Samplable; Proof of Correctness; Properties of Regions; Proof of Robustness; Proof of Samplability
 Proof of Safety Preservation (Ready Simulation)Conclusion; References; Coarse Abstractions Make Zeno Behaviours Difficult to Detect; Introduction; ZenoRelated Problems for Timed Automata; Timed Automata; Symbolic Semantics, Zenoness and Nonzenoness Problems; Nonzenoness is NPcomplete for ExtraLU; Finding Nonzeno Runs; Reduced Guessing Zone Graph rGZGa(A); Polynomial Algorithms for NZPa; The Zenoness Problem; Reducing 3SAT to ZPa with Abstraction ExtraLU; Finding Zeno Paths; Weakening the U Bounds; Conclusion; References; Probabilistic Systems
 Control code
 748410079
 Extent
 1 online resource (xiv, 560 pages)
 Form of item
 online
 Isbn
 9783642232176
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783642232176
 Other physical details
 illustrations.
 http://library.link/vocab/ext/overdrive/overdriveId
 9783642232169
 Specific material designation
 remote
 System control number
 (OCoLC)748410079
Subject
 Computer Communication Networks
 Computer Science
 Computer multitasking
 Computer multitasking
 Computer multitasking  Congresses
 Conference papers and proceedings
 Conference papers and proceedings
 Engineering & Applied Sciences
 Information Systems Applications (incl. Internet)
 Informatique
 Logics and Meanings of Programs
 Parallel processing (Electronic computers)
 Parallel processing (Electronic computers)
 Parallel processing (Electronic computers)  Congresses
 Programming Languages, Compilers, Interpreters
 Software Engineering
 Artificial Intelligence (incl. Robotics)
Genre
Member of
 Lecture notes in computer science, Advanced research in computing and software science
 LNCS sublibrary, SL 1, Theoretical computer science and general issues
 Lecture notes in computer science, 6901
 Lecture notes in computer science, 6901.
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/CONCUR2011concurrencytheory22nd/FizxIpGH3F0/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/CONCUR2011concurrencytheory22nd/FizxIpGH3F0/">CONCUR 2011concurrency theory : 22nd international conference, CONCUR 2011, Aachen, Germany, September 69, 2011 : proceedings, JoostPieter Katoen, Barbara König (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item CONCUR 2011concurrency theory : 22nd international conference, CONCUR 2011, Aachen, Germany, September 69, 2011 : proceedings, JoostPieter Katoen, Barbara König (eds.)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/CONCUR2011concurrencytheory22nd/FizxIpGH3F0/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/CONCUR2011concurrencytheory22nd/FizxIpGH3F0/">CONCUR 2011concurrency theory : 22nd international conference, CONCUR 2011, Aachen, Germany, September 69, 2011 : proceedings, JoostPieter Katoen, Barbara König (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>