Computer science
•
Operating system technology
•
Areas of computer science
Concurrency (computer science)
In computer science, concurrency is a property of systems in which several computations are executing simultaneously, and potentially interacting with each other. The computations may be executing on ...
Concurrency (computer science) - Wikipedia
Actor model
•
Concurrency control
•
Concurrent computing
•
Denotational semantics
•
Petri net
•
Process calculus
•
Temporal logic
Concurrency (computer science) - Wikipedia
Actor model
The actor model in computer science is a mathematical model of concurrent computation that treats "actors" as the universal primitives of concurrent computation: in response to a message that it recei...
Concurrency control
In information technology and computer science, especially in the fields of computer programming, operating systems, multiprocessors, and databases, concurrency control ensures that correct results f...
Concurrent computing
Concurrent computing is a form of computing in which several computations are executing during overlapping time periods – concurrently – instead of sequentially (one completing before the next starts)...
Denotational semantics
In computer science, denotational semantics (initially known as mathematical semantics or Scott–Strachey semantics) is an approach of formalizing the meanings of programming languages by constructing ...
Petri net
A Petri net (also known as a place/transition net or P/T net) is one of several mathematical modeling languages for the description of distributed systems. A Petri net is a directed bipartite graph, ...
Petri net - Wikipedia
Process calculus
In computer science, the process calculi (or process algebras) are a diverse family of related approaches for formally modelling concurrent systems. Process calculi provide a tool for the high-level d...
Temporal logic
In logic, temporal logic is any system of rules and symbolism for representing, and reasoning about, propositions qualified in terms of time. In a temporal logic we can then express statements like "I...
CPN-AMI
CPN-AMI is a computer-aided software engineering environment based on Petri Net specifications. It allows to specify the behavior of a distributed system and the to evaluate properties on it such as i...
Operational transformation
Operational transformation (OT) is a technology for supporting a range of collaboration functionalities in advanced collaborative software systems. OT was originally invented for consistency mainten...
Operational transformation - Wikipedia
Non-blocking algorithm
In computer science, an algorithm is called non-blocking if failure or suspension of any thread cannot cause failure or suspension of another thread; for some operations, these algorithms provide a u...
Scientific community metaphor
In computer science, the Scientific Community Metaphor is a metaphor used to aid understanding scientific communities. The first publications on the Scientific Community Metaphor in 1981 and 1982 inv...
Maria (reachability analyzer)
Maria: The Modular Reachability Analyzer is a reachability analyzer for concurrent systems that uses Algebraic System Nets (a high-level variant of Petri nets) as its modelling formalism.
ExSpecT
Squatting attack
Squatting attack, in computer science, is a kind of DoS attack where a program interferes with another program through the use of shared synchronization objects in an unwanted or unexpected way.That a...
Racetrack problem
A racetrack problem is a specific instance of a type of race condition. A racetrack problem is a flaw in a system or process whereby the output and/or result of the process is unexpectedly and critica...
Actor model and process calculi history
The Actor model and process calculi share an interesting history and co-evolution.
The Actor model, first published in 1973, is a mathematical model of concurrent computation. The Actor model trea...
Unbounded nondeterminism
In computer science, unbounded nondeterminism or unbounded indeterminacy is a property of concurrency by which the amount of delay in servicing a request can become unbounded as a result of arbitratio...
Deadlock
In concurrent programming, a deadlock is a situation in which two or more competing actions are each waiting for the other to finish, and thus neither ever does.In a transactional database, a deadlock...
Deadlock - Wikipedia
Stochastic Petri net
Stochastic Petri nets are a form of Petri net where the transitions fire after a probabilistic delay determined by a random variable.
A stochastic Petri net is a five-tuple SPN = (P, T, F, M0, Λ) ...
Actor model theory
In theoretical computer science, Actor model theory concerns theoretical issues for the Actor model.Actors are the primitives that form the basis of the Actor model of concurrent digital computation. ...
Resource starvation
In computer science, starvation is a problem encountered in multitasking where a process is perpetually denied necessary resources. Without those resources, the program can never finish its task. Star...
Computer cluster
A computer cluster consists of a set of loosely or tightly connected computers that work together so that, in many respects, they can be viewed as a single system. Unlike grid computers, computer clus...
Computer cluster - Wikipedia
Divergence (computer science)
In computer science, a computation is said to diverge if it does not terminate or terminates in an (unobservable) exceptional state. Otherwise it is said to converge. In domains where computations are...
Communicating finite-state machine
In computer science, a communicating finite-state machine is a finite state machine labeled with "receive" and "send" operations over some alphabet of channels. They were introduced by Brand and Zafir...
Petri Net Markup Language
Petri Net Markup Language (PNML) is an interchange format aimed at enabling Petri net tools to exchange Petri net models. PNML is an XML-based syntax for high-level Petri nets, which is being designed...
Marked graph
A marked graph is a Petri net in which every place has exactly one incoming arc, and exactly one outgoing arc. This means, that there can not be conflict, but there can be concurrency. Mathematically:...
Marked graph - Wikipedia
Dining philosophers problem
In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them.It was origi...
Dining philosophers problem - Wikipedia
Distributed computing
Distributed computing is a field of computer science that studies distributed systems. A distributed system is a software system in which components located on networked computers communicate and coor...
History monoid
In mathematics and computer science, a history monoid is a way of representing the histories of concurrently running computer processes as a collection of strings, each string representing the individ...