Concurrency and atomicity
type: Item
instance of: scholarly article
title: Concurrency and atomicity
zbMATH Open document ID: 0678.68078
DOI: 10.1016/0304-3975(88)90096-5
published in: Theoretical Computer Science
publication date: 1988-01-01T00:00:00Z
full work available at URL: RR-0748.pdf
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 4112051
zbMATH Keywords: Petri nets
zbMATH Keywords: ``true'' concurrency
zbMATH Keywords: nondeterminism
zbMATH Keywords: event structures
zbMATH Keywords: operational semantics
author: Gérard Boudol
author: Ilaria Castellani
describes a project that uses: Esterel
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W1989279866
cites work: Q3030238
cites work: Algèbre de processus et synchronisation
cites work: Minimal and Optimal Computations of Recursive Programs
cites work: Q3735065
cites work: Q3700824
cites work: Q3735084
cites work: Q3321470
cites work: A Theory of Communicating Sequential Processes
cites work: Combinatorial problems of commutation and rearrangements
cites work: Q3657423
cites work: Distributed bisimulations
cites work: Bisimulations and abstraction homomorphisms
cites work: Q3667927
cites work: Q3681915
cites work: Q3677155
cites work: A partial ordering semantics for CCS
cites work: Extensional equivalences for transition systems
cites work: Topology of series-parallel networks
cites work: Q3771632
cites work: The non-sequential behaviour of Petri nets
cites work: Q3922196
cites work: Maximal chains and antichains
cites work: N-free posets as generalizations of series-parallel posets
cites work: Algebraic laws for nondeterminism and concurrency
cites work: Testing equivalences for processes
cites work: Q4845486
cites work: An implementation of mutual inclusion
cites work: Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
cites work: The Recognition of Series Parallel Digraphs
cites work: Q3922646
cites work: Guardians and Actions: Linguistic Support for Robust, Distributed Programs
cites work: Q3698316
cites work: Q3878737
cites work: Q4198049
cites work: A calculus of communicating systems
cites work: Calculi for synchrony and asynchrony
cites work: Q3750113
cites work: Q3026331
cites work: Petri nets, event structures and domains. I
cites work: Q3776645
cites work: Q3907077
cites work: A structural approach to operational semantics
cites work: Q3657409
cites work: Q3698323
cites work: Q3694687
cites work: Modeling concurrency with partial orders
cites work: Q3740251
cites work: Concurrent Machines
cites work: Higher-level synchronising devices in Meije-SCCS
cites work: Q3753474
cites work: Q4294630
cites work: Q4160368
cites work: Behaviours of concurrent systems
cites work: Q3667958
cites work: Q3030239
Recommended article: Q3817586
Recommended article: Q4341030
Recommended article: Q3975177
Recommended article: Concurrency in synchronous systems

Concurrency and atomicity (Recommended article)
Recommended article: Monitoring Atomicity in Concurrent Programs
Similarity Score: 0.88712835
Recommender Run: Recommender Run 3

Concurrency and atomicity (Recommended article)
Recommended article: Concurrency and Reversibility
Similarity Score: 0.8862119
Recommender Run: Recommender Run 3

Concurrency and atomicity (Recommended article)
Recommended article: Concurrent Programming
Similarity Score: 0.8786895
Recommender Run: Recommender Run 3

Concurrency and atomicity (Recommended article)
Recommended article: Q3992668
Similarity Score: 0.8786895
Recommender Run: Recommender Run 3

Concurrency and atomicity (Recommended article)
Recommended article: Nebenläufige Programme
Similarity Score: 0.8786895
Recommender Run: Recommender Run 3