Skip to search formSkip to main contentSkip to account menu

Actor model and process calculi

In computer science, the Actor model and process calculi are two closely related approaches to the modelling of concurrent digital computation. See… 
Wikipedia (opens in a new tab)

Related topics

Related topics

19 relations
Actor modelActor model implementationActor model middle historyActor model theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Fixed-time cluster synchronization for complex networks via pinning control
In this paper, the fixed-time cluster synchronization problem for complex networks via pinning control is discussed. Fixed-time… 
2013
2013
Negative premises in applied process calculi
Psi-calculi is a parametric framework for process calculi similar to popular pi-calculus extensions such as the explicit fusion… 
Review
2010
Review
2010
Analysis of Communicating Automata
This extended abstract is a survey of some of the recent developments in the area of automated verification dedicated to the… 
2006
2006
Toward sophisticated detection with distributed triggers
Recent research has proposed efficient protocols for distributed triggers, which can be used in monitoring infrastructures to… 
Highly Cited
2005
Highly Cited
2005
A New Approach for Boundary Recognition in Geometric Sensor Networks
We describe a new approach for dealing with the following central problem in the self-organization of a geometric sensor network… 
2004
2004
Unbounded system verification using decision procedure and predicate abstraction
Modeling and analysis of systems with large, infinite or parameterized state spaces has received much attention in the last… 
2003
2003
How Stop and Wait Protocols Can Fail over the Internet
The correct operation of computer protocols is essential to the smooth operation of the distributed systems that facilitate our… 
1997
1997
Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract)
We consider the analysis of infinite half-duplex systems which consists of finite state machines that communicate over unbounded… 
1996
1996
Bandwidth Regulation of Real-Time Traffic Classes in Internetworks
1985
1985
Priority Networks of Communicating Finite State Machines
Consider a network of two communicating finite state machines which exchange messages over two one-directional, unbounded… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)