Models for concurrency: Towards a classification

DOI10.1016/S0304-3975(96)80710-9zbMATH Open0874.68120OpenAlexW4210671891MaRDI QIDQ672053FDOQ672053

Authors: Vladimiro Sassone, Mogens Nielsen, Glynn Winskel 

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)80710-9

Recommendations

• scientific article; zbMATH DE number 3905836
• scientific article; zbMATH DE number 176124
• scientific article; zbMATH DE number 4064457
• scientific article; zbMATH DE number 1241703
• scientific article; zbMATH DE number 1302049

zbMATH Keywords

categorybehaviour/systemclassification of models for concurrencyinterleaving/noninterleavinglinear/branching time

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• Petri nets, event structures and domains. I
• Synchronization trees
• A structural approach to operational semantics
• Concurrent Machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Formal verification of parallel programs
• Title not available (Why is that?)
• CONCURRENT AUTOMATA AND DOMAINS
• Concurrent transition systems
• Mathematical foundations of computer science 1993. 18th international symposium, MFCS '93, Gdańsk, Poland, August/September 1993. Proceedings
• On relating some models for concurrency

Cited In (57)

• The correctness of concurrencies in (reversible) concurrent calculi
• The mays and musts of concurrent strategies
• Processes, systems \& tests: defining contextual equivalences
• An axiomatic theory for reversible computation
• Causal reversibility implies time reversibility
• Model-checking games for fixpoint logics with partial order models
• Concurrencies in reversible concurrent calculi
• Building a Modal Interface Theory for Concurrency and Data
• An axiomatic approach to reversible computation
• Semantic domains of timed event structures
• Models for name-passing processes: Interleaving and causal
• Cameo: an alternative model of concurrency for Eiffel
• Representation of computations in concurrent automata by dependence orders
• Configuration- and residual-based transition systems for event structures with asymmetric conflict
• Clustering for Petri nets
• EMSO-logic and automata related to homogeneous flow event structures
• Synchronization expressions with extended join operation
• Domain theory for concurrency
• Reversibility and models for concurrency
• Configuration structures, event structures and Petri nets
• Rule-based and object-based event structures for membrane systems
• Simplicial Models for Concurrency
• Title not available (Why is that?)
• Synchronization languages and rewriting systems
• True concurrency of deep inference proofs
• Refinement preserving approximations for the design and verification of heterogeneous systems
• Modelling Concurrency with Quotient Monoids
• Approximating Behaviors in Embedded System Design
• Title not available (Why is that?)
• The 4C Spectrum of Fundamental Behavioral Relations for Concurrent Systems
• Title not available (Why is that?)
• On the origin of events: branching cells as stubborn sets
• Title not available (Why is that?)
• Contracts for BIP: Hierarchical Interaction Models for Compositional Verification
• Timing and causality in process algebra
• Models of central capacity and concurrency
• Concurrent semantics for fusions: weak prime domains and connected event structures
• Untanglings: a novel approach to analyzing concurrent systems
• Languages of higher-dimensional automata
• Studying Operational Models of Relaxed Concurrency
• On linear logic planning and concurrency
• Title not available (Why is that?)
• Directed homotopy in non-positively curved spaces
• Models, Languages, and Tools for Concurrent and Distributed Programming
• From domains to automata with concurrency
• Constructing weak simulations from linear implications for processes with private names
• Title not available (Why is that?)
• Title not available (Why is that?)
• Branching time controllers for discrete event systems
• Title not available (Why is that?)
• Partial-order Boolean games: informational independence in a logic-based model of strategic interaction
• The true concurrency of differential interaction nets
• Cathoristic logic. A logic for capturing inferences between atomic sentences
• Modelling concurrency with comtraces and generalized comtraces
• Processes against tests: on defining contextual equivalences
• Independence abstractions and models of concurrency
• Validating timed models of deployment components with parametric concurrency

This page was built for publication: Models for concurrency: Towards a classification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672053)