Borrow it
Coverart for item
The Resource CONCUR 2011--concurrency theory : 22nd international conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011 : proceedings, Joost-Pieter Katoen, Barbara König (eds.)

CONCUR 2011--concurrency theory : 22nd international conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011 : proceedings, Joost-Pieter Katoen, Barbara König (eds.)

Creator
Contributor
Summary
Annotation This book constitutes the refereed proceedings of the 22nd International Conference on Concurrency Theory, CONCUR 2011, held in Aachen, Germany, September 5-10, 2011. The 32 revised full papers were carefully reviewed and selected from 94 submissions. The papers are organized in topics such as real-time systems, probabilistic systems, automata, separation logic, -calculus, Petri nets, process algebra and modeling, verification, games, and bisimulation
Language
eng
Work
Publication
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; K-set Consensus; From 1 to k; Vectors of Adopt-Commit Objects; Protocol; Correctness; Concluding Remarks; References; Causal Nets: A Modeling Language Tailored towards Process Discovery; Motivation; Causal Nets; Definition; Valid Sequences; Soundness; Relating C-nets and Petri Nets; Petri Nets and WF-nets; Mapping WF-nets onto C-nets; Mapping C-nets onto WF-nets; Application of C-nets in ProM; Model Management and Conversion; Model-Based 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 Conflict-Free Net Has Exactly One Maximal Run; BD-Processes Fit Structural Conflict Nets; References; Real-Time Systems; On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, 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; Zeno-Related Problems for Timed Automata; Timed Automata; Symbolic Semantics, Zenoness and Non-zenoness Problems; Non-zenoness is NP-complete for ExtraLU; Finding Non-zeno 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
Instance
Label
CONCUR 2011--concurrency theory : 22nd international conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011 : proceedings
Title
CONCUR 2011--concurrency theory
Title remainder
22nd international conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011 : proceedings
Statement of responsibility
Joost-Pieter Katoen, Barbara König (eds.)
Creator
Contributor
Subject
Genre
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 5-10, 2011. The 32 revised full papers were carefully reviewed and selected from 94 submissions. The papers are organized in topics such as real-time systems, probabilistic systems, automata, separation logic, -calculus, Petri nets, process algebra and modeling, verification, games, and bisimulation
Member of
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, Joost-Pieter
  • 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 2011--concurrency theory : 22nd international conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011 : proceedings, Joost-Pieter Katoen, Barbara König (eds.)
Instantiates
Publication
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; K-set Consensus; From 1 to k; Vectors of Adopt-Commit Objects; Protocol; Correctness; Concluding Remarks; References; Causal Nets: A Modeling Language Tailored towards Process Discovery; Motivation; Causal Nets; Definition; Valid Sequences; Soundness; Relating C-nets and Petri Nets; Petri Nets and WF-nets; Mapping WF-nets onto C-nets; Mapping C-nets onto WF-nets; Application of C-nets in ProM; Model Management and Conversion; Model-Based 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 Conflict-Free Net Has Exactly One Maximal Run; BD-Processes Fit Structural Conflict Nets; References; Real-Time Systems; On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, 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; Zeno-Related Problems for Timed Automata; Timed Automata; Symbolic Semantics, Zenoness and Non-zenoness Problems; Non-zenoness is NP-complete for ExtraLU; Finding Non-zeno 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/978-3-642-23217-6
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-642-23216-9
Specific material designation
remote
System control number
(OCoLC)748410079
Label
CONCUR 2011--concurrency theory : 22nd international conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011 : proceedings, Joost-Pieter Katoen, Barbara König (eds.)
Publication
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; K-set Consensus; From 1 to k; Vectors of Adopt-Commit Objects; Protocol; Correctness; Concluding Remarks; References; Causal Nets: A Modeling Language Tailored towards Process Discovery; Motivation; Causal Nets; Definition; Valid Sequences; Soundness; Relating C-nets and Petri Nets; Petri Nets and WF-nets; Mapping WF-nets onto C-nets; Mapping C-nets onto WF-nets; Application of C-nets in ProM; Model Management and Conversion; Model-Based 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 Conflict-Free Net Has Exactly One Maximal Run; BD-Processes Fit Structural Conflict Nets; References; Real-Time Systems; On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, 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; Zeno-Related Problems for Timed Automata; Timed Automata; Symbolic Semantics, Zenoness and Non-zenoness Problems; Non-zenoness is NP-complete for ExtraLU; Finding Non-zeno 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/978-3-642-23217-6
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-642-23216-9
Specific material designation
remote
System control number
(OCoLC)748410079

Subject

Genre

Member of

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125

Library Links

Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by University of Missouri Libraries. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...