Del i serien Lecture Notes in Computer Science

CONCUR '91

2nd International Conference on Concurrency Theory, Amsterdam, The Netherlands, August 26-29, 1991. Proceedings

Häftad, Engelska, 1991

739 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

CONCUR'91 is the second international conference onconcurrency theory, organized in association with the NFIproject Transfer. It is a sequel to the CONCUR'90conference. Its basic aim is to communicate ongoing work inconcurrency theory. This proceedings volume contains 30papers selected for presentation at the conference (from 71submitted) together with four invited papers and abstractsof the other invited papers. The papers are organized intosections on process algebras, logics and model checking,applications and specification languages, models and nettheory, design and real-time, tools and probabilities, andprogramming languages. The proceedings of CONCUR'90 areavailable asVolume 458 of Lecture Notes in ComputerScience.

Produktinformation

Utgivningsdatum1991-08-14
Mått155 x 233 x 30 mm
Vikt838 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor549
Upplaga1991
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540544302

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it

Formal techniques for parallel object-oriented languages.- Causal models for rational algebraic processes.- Action and state-based logics for process algebras.- A tool set for deciding behavioral equivalences.- Causality based models for the design of concurrent systems.- Modal logics for mobile processes.- Towards a design calculus for communicating programs.- A theory of testing for ACP.- Real space process algebra.- The failure of failures in a paradigm for asynchronous communication.- Embedding as a tool for language comparison: On the CSP hierarchy.- A conditional operator for CCS.- Algebraic formulations of trace theory.- Compositional synthesis of live and bounded free choice Petri nets.- The observation algebra of spatial pomsets.- Synchrony loosening transformations for interacting processes.- A compositional model for layered distributed systems.- Process algebra with guards.- Model checking and modular verification.- Geometric logic, causality and event structures.- Extended Horn clauses: the framework and some semantics.- Action systems and action refinement in the development of parallel systems.- Invariant semantics of nets with inhibitor arcs.- Abstract timed observation and process algebra.- Simulations between specifications of distributed systems.- Using truth-preserving reductions to improve the clarity of kripke-models.- Completeness in real time process algebra.- Distributed CCS.- Time-constrained automata.- Relating processes with respect to speed.- Testing, betting and timed true concurrency.- Fairness in models with true concurrency.- Efficient verification of determinate processes.- Experiments on processes with backtracking.- Some finite-graph models for process algebra.- A method for the development of totally correct shared-state parallel programs.- Reduced labelled transition systems save verification effort.

Mer från samma författare

CONCUR'99. Concurrency Theory

Jos C.M. Baeten, Sjouke Mauw

Häftad, 1999

1 429 kr

Theoretical Computer Science

Jos C.M. Baeten, Tom Ball, Frank S. de Boer

Häftad, 2012

719 kr

Mer från samma serie

Del 16477

Passive and Active Measurement

Simone Ferlin-Reiter, Romain Fontugne, Johanna Ullrich

Häftad, 2026

1 409 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

739 kr

Del 15427

Internet of Things – ICIOT 2024

Shunli Zhang, Liang-Jie Zhang

Häftad, 2024

819 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

719 kr

Compiler Construction

Albert Cohen

Häftad, 2014

709 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

719 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

739 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

739 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

739 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 209 kr

Du kanske också är intresserad av

Semantics of Specification Languages (SoSL)

Derek J. Andrews, Jan F. Groote, C.A. Middelburg

Häftad, 1994

739 kr

Typed Lambda Calculi and Applications

Marc Bezem, Jan F. Groote

Häftad, 1993

719 kr

Feminist Research Methods

Constance Miller

Inbunden, 1991

1 019 kr

Del 106

Determination of the Geoid

Richard H. Rapp, Fernando Sansò

Häftad, 1991

1 429 kr

Theoretical Computer Science

Jos C.M. Baeten, Tom Ball, Frank S. de Boer

Häftad, 2012

719 kr

Programming Language Implementation and Logic Programming

Jan Maluszynski, Martin Wirsing

Häftad, 1991

719 kr

Jerzy Kosinski

Gloria L. Cronin, Blaine H. Hall

Inbunden, 1991

729 kr

CONCUR'99. Concurrency Theory

Jos C.M. Baeten, Sjouke Mauw

Häftad, 1999

1 429 kr

Sample Size Choice

Robert E. Odeh, Martin Fox

Inbunden, 1991

4 009 kr

Combat Diary

A. B. Feuer

Inbunden, 1991

1 189 kr

Del i serien Lecture Notes in Computer Science

CONCUR '91

2nd International Conference on Concurrency Theory, Amsterdam, The Netherlands, August 26-29, 1991. Proceedings

Häftad, Engelska, 1991

AvJos C.M. Baeten,Jan F. Groote

739 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum1991-08-14
Mått155 x 233 x 30 mm
Vikt838 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor549
Upplaga1991
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540544302

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it

Formal techniques for parallel object-oriented languages.- Causal models for rational algebraic processes.- Action and state-based logics for process algebras.- A tool set for deciding behavioral equivalences.- Causality based models for the design of concurrent systems.- Modal logics for mobile processes.- Towards a design calculus for communicating programs.- A theory of testing for ACP.- Real space process algebra.- The failure of failures in a paradigm for asynchronous communication.- Embedding as a tool for language comparison: On the CSP hierarchy.- A conditional operator for CCS.- Algebraic formulations of trace theory.- Compositional synthesis of live and bounded free choice Petri nets.- The observation algebra of spatial pomsets.- Synchrony loosening transformations for interacting processes.- A compositional model for layered distributed systems.- Process algebra with guards.- Model checking and modular verification.- Geometric logic, causality and event structures.- Extended Horn clauses: the framework and some semantics.- Action systems and action refinement in the development of parallel systems.- Invariant semantics of nets with inhibitor arcs.- Abstract timed observation and process algebra.- Simulations between specifications of distributed systems.- Using truth-preserving reductions to improve the clarity of kripke-models.- Completeness in real time process algebra.- Distributed CCS.- Time-constrained automata.- Relating processes with respect to speed.- Testing, betting and timed true concurrency.- Fairness in models with true concurrency.- Efficient verification of determinate processes.- Experiments on processes with backtracking.- Some finite-graph models for process algebra.- A method for the development of totally correct shared-state parallel programs.- Reduced labelled transition systems save verification effort.