Borrow it
Coverart for item
The Resource CONCUR '96 : concurrency theory : 7th International Conference, Pisa, Italy, August 26-29, 1996 : proceedings, Ugo Montanari, Vladimiro Sassone, eds

CONCUR '96 : concurrency theory : 7th International Conference, Pisa, Italy, August 26-29, 1996 : proceedings, Ugo Montanari, Vladimiro Sassone, eds

Creator
Contributor
Summary
This book constitutes the refereed proceedings of the 7th International Conference on Concurrency Theory, CONCUR '96, held in Pisa, Italy, in August 1996. The volume presents 37 revised full papers selected from a total of 133 submissions; also included are seven invited papers. The contributions are grouped into topical sections on process algebras, categorical approaches, the pi-calculus, decidability and complexity, probability, functional and constraint programming, Petri nets, verification, automata and causality, practical models, and shared-memory systems
Language
eng
Work
Publication
Extent
1 online resource (xii, 750 pages)
Contents
  • Retracing some paths in process algebra -- Process calculus based upon evaluation to committed form -- A process algebra with distributed priorities -- Symbolic transition graph with assignment -- Models for concurrent constraint programming -- Comparing transition systems with independence and asynchronous transition systems -- A presheaf semantics of value-passing processes -- Elementary control structures -- On transformations of concurrent object programs -- On bisimulations for the asynchronous ?-calculus -- On the expressiveness of internal mobility in name-passing calculi -- Decoding choice encodings -- Infinite results -- Decidability of bisimulation equivalence for normed pushdown processes -- The modal mu-calculus alternation hierarchy is strict -- Bisimulation collapse and the process taxonomy -- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic -- A Facile tutorial -- Testing probabilistic automata -- ̂
  • Extended Markovian Process Algebra -- Rewriting logic as a semantic framework for concurrency: a progress report -- Truly concurrent constraint programming -- Constraints as processes -- A calculus of mobile agents -- Algebraic interpretation of lambda calculus with resources -- Concurrent graph and term graph rewriting -- Petri boxes and finite precedence -- Constrained properties, semilinear systems, and Petri nets -- Linear constraint systems as high-level nets -- A space-efficient on-the-fly algorithm for real-time model checking -- State equivalences for rectangular hybrid automata -- Verifying abstractions of timed systems -- Towards automatic temporal logic verification of value passing process algebra using abstract interpretation -- Modelling and verification of Distributed Algorithms -- An algorithmic approach for checking closure properties of ?-regular languages -- Towards automata for branching time and partial order -- ̂
  • Asynchronous cellular automata for pomsets without auto-concurrency -- Action refinement and property inheritance in systems of sequential agents -- A calculus for concurrent objects -- Refinement in Interworkings -- Equivalences of Statecharts -- Modular verification for shared-variable concurrent programs -- The impact of hardware models on shared memory consistency conditions -- Synchronous development of asynchronous systems
Isbn
9783540706250
Instance
Label
CONCUR '96 : concurrency theory : 7th International Conference, Pisa, Italy, August 26-29, 1996 : proceedings
Title
CONCUR '96
Title remainder
concurrency theory : 7th International Conference, Pisa, Italy, August 26-29, 1996 : proceedings
Statement of responsibility
Ugo Montanari, Vladimiro Sassone, eds
Title variation
Concurrency theory
Creator
Contributor
Subject
Genre
Language
eng
Summary
This book constitutes the refereed proceedings of the 7th International Conference on Concurrency Theory, CONCUR '96, held in Pisa, Italy, in August 1996. The volume presents 37 revised full papers selected from a total of 133 submissions; also included are seven invited papers. The contributions are grouped into topical sections on process algebras, categorical approaches, the pi-calculus, decidability and complexity, probability, functional and constraint programming, Petri nets, verification, automata and causality, practical models, and shared-memory systems
Member of
Cataloging source
SCPER
Dewey number
004.35
Illustrations
illustrations
Index
index present
LC call number
QA76.58
LC item number
.I53 1996
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
1996
http://bibfra.me/vocab/lite/meetingName
International Conference on Concurrency Theory
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
  • Montanari, U.
  • Sassone, Vladimiro
Series statement
Lecture notes in computer science
Series volume
1119
http://library.link/vocab/subjectName
  • Parallel processing (Electronic computers)
  • Parallel processing (Electronic computers)
  • Concurrente programmering
Label
CONCUR '96 : concurrency theory : 7th International Conference, Pisa, Italy, August 26-29, 1996 : proceedings, Ugo Montanari, Vladimiro Sassone, 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
  • Retracing some paths in process algebra -- Process calculus based upon evaluation to committed form -- A process algebra with distributed priorities -- Symbolic transition graph with assignment -- Models for concurrent constraint programming -- Comparing transition systems with independence and asynchronous transition systems -- A presheaf semantics of value-passing processes -- Elementary control structures -- On transformations of concurrent object programs -- On bisimulations for the asynchronous ?-calculus -- On the expressiveness of internal mobility in name-passing calculi -- Decoding choice encodings -- Infinite results -- Decidability of bisimulation equivalence for normed pushdown processes -- The modal mu-calculus alternation hierarchy is strict -- Bisimulation collapse and the process taxonomy -- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic -- A Facile tutorial -- Testing probabilistic automata -- ̂
  • Extended Markovian Process Algebra -- Rewriting logic as a semantic framework for concurrency: a progress report -- Truly concurrent constraint programming -- Constraints as processes -- A calculus of mobile agents -- Algebraic interpretation of lambda calculus with resources -- Concurrent graph and term graph rewriting -- Petri boxes and finite precedence -- Constrained properties, semilinear systems, and Petri nets -- Linear constraint systems as high-level nets -- A space-efficient on-the-fly algorithm for real-time model checking -- State equivalences for rectangular hybrid automata -- Verifying abstractions of timed systems -- Towards automatic temporal logic verification of value passing process algebra using abstract interpretation -- Modelling and verification of Distributed Algorithms -- An algorithmic approach for checking closure properties of ?-regular languages -- Towards automata for branching time and partial order -- ̂
  • Asynchronous cellular automata for pomsets without auto-concurrency -- Action refinement and property inheritance in systems of sequential agents -- A calculus for concurrent objects -- Refinement in Interworkings -- Equivalences of Statecharts -- Modular verification for shared-variable concurrent programs -- The impact of hardware models on shared memory consistency conditions -- Synchronous development of asynchronous systems
Control code
326688247
Dimensions
unknown
Extent
1 online resource (xii, 750 pages)
Form of item
online
Isbn
9783540706250
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/3-540-61604-7.
Other physical details
illustrations.
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)326688247
Label
CONCUR '96 : concurrency theory : 7th International Conference, Pisa, Italy, August 26-29, 1996 : proceedings, Ugo Montanari, Vladimiro Sassone, 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
  • Retracing some paths in process algebra -- Process calculus based upon evaluation to committed form -- A process algebra with distributed priorities -- Symbolic transition graph with assignment -- Models for concurrent constraint programming -- Comparing transition systems with independence and asynchronous transition systems -- A presheaf semantics of value-passing processes -- Elementary control structures -- On transformations of concurrent object programs -- On bisimulations for the asynchronous ?-calculus -- On the expressiveness of internal mobility in name-passing calculi -- Decoding choice encodings -- Infinite results -- Decidability of bisimulation equivalence for normed pushdown processes -- The modal mu-calculus alternation hierarchy is strict -- Bisimulation collapse and the process taxonomy -- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic -- A Facile tutorial -- Testing probabilistic automata -- ̂
  • Extended Markovian Process Algebra -- Rewriting logic as a semantic framework for concurrency: a progress report -- Truly concurrent constraint programming -- Constraints as processes -- A calculus of mobile agents -- Algebraic interpretation of lambda calculus with resources -- Concurrent graph and term graph rewriting -- Petri boxes and finite precedence -- Constrained properties, semilinear systems, and Petri nets -- Linear constraint systems as high-level nets -- A space-efficient on-the-fly algorithm for real-time model checking -- State equivalences for rectangular hybrid automata -- Verifying abstractions of timed systems -- Towards automatic temporal logic verification of value passing process algebra using abstract interpretation -- Modelling and verification of Distributed Algorithms -- An algorithmic approach for checking closure properties of ?-regular languages -- Towards automata for branching time and partial order -- ̂
  • Asynchronous cellular automata for pomsets without auto-concurrency -- Action refinement and property inheritance in systems of sequential agents -- A calculus for concurrent objects -- Refinement in Interworkings -- Equivalences of Statecharts -- Modular verification for shared-variable concurrent programs -- The impact of hardware models on shared memory consistency conditions -- Synchronous development of asynchronous systems
Control code
326688247
Dimensions
unknown
Extent
1 online resource (xii, 750 pages)
Form of item
online
Isbn
9783540706250
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/3-540-61604-7.
Other physical details
illustrations.
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)326688247

Subject

Genre

Member of

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012

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 ...