Concur '94: Concurrency Theory: 5th International Conference, Uppsala, Sweden, August 22 - 25, 1994. Proceedings (Lecture Notes in Artificial Intelligence)
معرفی کتاب «Concur '94: Concurrency Theory: 5th International Conference, Uppsala, Sweden, August 22 - 25, 1994. Proceedings (Lecture Notes in Artificial Intelligence)» نوشتهٔ Jean-Yves Girard (auth.), Bengt Jonsson, Joachim Parrow (eds.)، منتشرشده توسط نشر Springer Berlin Heidelberg : Imprint : Springer در سال 1994. این کتاب در فرمت pdf، زبان انگلیسی ارائه شده است.
This Volume Constitutes The Proceedings Of The Fifth International Conference On Concurrency Theory, Concur '94, Held At Uppsala, Sweden In August 1994. In Total, 29 Refereed Research Papers Selected From 108 Submissions For The Conference Are Presented Together With Full Papers Or Abstracts Of The 5 Invited Talks By Prominent Speakers. The Book Contains Recent Results On All Relevant Aspects Of Concurrency Research And Thus Competently Documents The Progress Of The Field Since The Predecessor Conference Concur '93, The Proceedings Of Which Are Published As Lncs 715--publisher's Website. Geometry Of Interaction / J.-y. Girard -- A Compositional Semantics For Statecharts Using Labeled Transition Systems / A.c. Uselton And S.a. Smolka -- On The Decidability Of Non-interleaving Process Equivalences / A. Kiehn And M. Hennessy -- Regularity Of Bpa-systems Is Decidable / S. Mauw And H. Mulder -- A Fast Algorithm For Deciding Bisimilarity Of Normed Context-free Processes / Y. Hirshfeld And F. Moller -- Model-based Verification Methods And Tools / J.c. Fernandez, J. Sifakis And R. De Simone -- New Results On The Analysis Of Concurrent Systems With An Indefinite Number Of Processes / M. Girkar And R. Moll -- Verification Of Nonregular Temporal Properties For Context-free Processes / A. Bouajjani, R. Echahed And R. Robbana -- Pushdown Processes: Parallel Composition And Model Checking / O. Burkart And B. Steffen -- Local Model Checking For Parallel Compositions Of Context-free Processes / H. Hungar -- The Logical Structure Of Concurrent Constraint Programming Languages / P. Panangaden. Countable Non-determinism And Uncountable Limits / P. Di Gianantonio, F. Honsell, S. Liani And G.d. Plotkin -- Sproc Categorically / J.r.b. Cockett And D.a. Spooner -- From Timed Graphs To Hybrid Automata / C. Courcoubetis -- Hierarchical Models Of Synchronous Circuits / D. Dill -- The Observational Power Of Clocks / R. Alur, C. Courcoubetis And T.a. Henzinger -- A Dynamic Approach To Timed Behaviour / J. Gunawardena -- Algebras Of Processes Of Timed Petri Nets / J. Winkowski -- Operational Semantics For The Petri Box Calculus / M. Koutny, J. Esparza And E. Best -- Weak Sequential Composition In Process Algebras / A. Rensink And H. Wehrheim -- Efficient Parallelism Vs Reliable Distribution: A Trade-off For Concurrent Computations / P.c. Kanellakis, D. Michailidis And A.a. Shvartsman -- On Unifying Assumption Commitment Style Proof Rules For Concurrency / Q. Xu, A. Can And P. Collette -- Liveness And Fairness In Duration Calculus / J.u. Skakkebaek. A Symbolic Semantics For The [pi]-calculus / M. Boreale And R. De Nicola -- On Bisimulation In The [pi]-calculus / D. Walker -- Characterizing Bisimulation Congruence In The [pi]-calculus / X. Liu -- The Limit View Of Infinite Computations / V. Klarlund -- Trace Relinement Of Action Systems / R.j.r. Back And J. Von Wright -- Bisimulation For Models In Concurrency / M. Nielsen And C. Clausen -- Invariants In Process Algebra With Data / M. Bezem And J.f. Groote -- Testing-based Abstractions For Value-passing Systems / R. Cleaveland And J. Riely -- A Congruence Theorem For Structured Operational Semantics With Predicates And Negative Premises / C. Verhoef -- Deriving Complete Inference Systems For A Class Of Gsos Languages Generating Regular Behaviours / L. Aceto -- Process Algebra With Partial Choice / J.c.m. Baeten And J.a. Bergstra -- Probabilistic Simulations For Probabilistic Processes / R. Segala And N. Lynch. Fully Abstract Characterizations Of Testing Preorders For Probabilistic Processes / S. Yuen, R. Cleaveland, Z. Dayar And S.a. Smolka -- Composition And Behaviors Of Probabilistic I/o Automata / S.-h. Wu, S.a. Smolka And E.w. Stark. Bengt Jonsson, Joachim Parrow, Eds. Includes Bibliographical References And Index. Content: Front Matter....Pages - Geometry of interaction (abstract)....Pages 1-1 A compositional semantics for statecharts using labeled transition systems....Pages 2-17 On the decidability of non-interleaving process equivalences....Pages 18-33 Regularity of BPA-systems is decidable....Pages 34-47 A fast algorithm for deciding bisimilarity of normed context-free processes....Pages 48-63 Model-based verification methods and tools (abstract)....Pages 64-64 New results on the analysis of concurrent systems with an indefinite number of processes....Pages 65-80 Verification of nonregular temporal properties for context-free processes....Pages 81-97 Pushdown processes: Parallel composition and model checking....Pages 98-113 Local model checking for parallel compositions of context-free processes....Pages 114-128 The logical structure of concurrent constraint programming languages....Pages 129-129 Countable non-determinism and uncountable limits....Pages 130-145 SProc categorically....Pages 146-159 Prom timed graphs to hybrid automata....Pages 160-160 Hierarchical models of synchronous circuits....Pages 161-161 The observational power of clocks....Pages 162-177 A dynamic approach to timed behaviour....Pages 178-193 Algebras of processes of timed Petri nets....Pages 194-209 Operational semantics for the Petri Box Calculus....Pages 210-225 Weak sequential composition in process algebras....Pages 226-241 Efficient parallelism vs reliable distribution: A trade-off for concurrent computations....Pages 242-266 On unifying Assumption-Commitment style proof rules for concurrency....Pages 267-282 Liveness and fairness in Duration Calculus....Pages 283-298 A symbolic semantics for the π-calculus — Extended abstract....Pages 299-314 On Bisimulation in the π-calculus....Pages 315-330 Characterizing bisimulation congruence in the π-Calculus....Pages 331-350 The limit view of infinite computations....Pages 351-366 Trace refinement of action systems....Pages 367-384 Bisimulation for models in concurrency mogens nielsen and christian clausen....Pages 385-400 Invariants in process algebra with data....Pages 401-416 Testing-based abstractions for value-passing systems....Pages 417-432 A congruence theorem for structured operational semantics with predicates and negative premises....Pages 433-448 Deriving complete inference systems for a class of GSOS languages generating regular behaviours....Pages 449-464 Process algebra with partial choice....Pages 465-480 Probabilistic simulations for probabilistic processes....Pages 481-496 Fully abstract characterizations of testing preorders for probabilistic processes....Pages 497-512 Composition and behaviors of probabilistic I/O automata....Pages 513-528 Back Matter....Pages - Annotation This volume constitutes the proceedings of the Fifth International Conference on Concurrency Theory, CONCUR '94, held at Uppsala, Sweden in August 1994. In total, 29 refereed research papers selected from 108 submissions for the conference are presented together with full papers or abstracts of the 5 invited talks by prominent speakers. The book contains recent results on all relevant aspects of concurrency research and thus competently documents the progress of the field since the predecessor conference CONCUR '93, the proceedings of which are published as LNCS 715 Statecharts [Har87] is a highly structured and economical description language for complex, reactive systems [Pnu86, HP85], such as communication protocols and digital control units.
دانلود کتاب Concur '94: Concurrency Theory: 5th International Conference, Uppsala, Sweden, August 22 - 25, 1994. Proceedings (Lecture Notes in Artificial Intelligence)