Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,992,858 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
Actor model
Actor model implementation
Actor model middle history
Actor model theory
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Compatibility Control of Asynchronous Communicating Systems with Unbounded Buffers
D. Dahmani
,
M. C. Boukala
,
H. Mountassir
,
Samir Chouali
PNSE @ Petri Nets
2017
Corpus ID: 19930559
. The composition of heterogeneous software components is required in many domains to build complex systems. However, such…
Expand
2013
2013
Negative premises in applied process calculi
Johannes Åman Pohjola
,
J. Borgström
,
J. Parrow
,
Palle Raabjerg
,
Ioana Rodhe
2013
Corpus ID: 12551677
Psi-calculi is a parametric framework for process calculi similar to popular pi-calculus extensions such as the explicit fusion…
Expand
2009
2009
Recursive Parametric Automata and epsilon-Removal
Lin Liu
,
J. Billington
FMOODS/FORTE
2009
Corpus ID: 19000295
This work is motivated by and arose from the parametric verification of communication protocols over unbounded channels, where…
Expand
2008
2008
[Entrevista a Yves Montand, actor y cantante]
Radio París
,
Yves Montand
,
J. Hernando
2008
Corpus ID: 193985443
2007
2007
Deadlock detection by fair reachability analysis : multi-cyclic protocols and beyond
A. V. der
,
Choot
2007
Corpus ID: 16008430
Fair reachability analysis is generalized to multi-cyclic protocols defined in the communicating finite state machine model as…
Expand
2003
2003
Selforganization in Communication Networks and Beyond
Wolfram Krause
,
I. Glauche
,
R. Sollacher
,
Martin Greiner
2003
Corpus ID: 13646350
It is not only biology, chemistry and physics, which are addressing selfor- ganization as the key design principle of nature, but…
Expand
Review
2001
Review
2001
Channel Representations in Protocol Verification (Preliminary Version)
P. Abdulla
,
B. Jonsson
2001
Corpus ID: 63113872
Inautomated verificationof protocols, on e source of com- plications is that channels may have unbounded capacity, in which case…
Expand
2001
2001
Routing with Guaranteed Delivery in ad ho Wireless Networks (cid:3)
Prosenjit Bose
,
Pat Morin
,
I. Stojmenovi
,
J. Urrutia
2001
Corpus ID: 267910680
We onsider routing problems in ad ho wireless networks modeled as unit graphs in whi h nodes are points in the plane and two…
Expand
1997
1997
G. Cécé and A. Finkel Programs with Quasi−stable Channels Are Effectively Recognizable Programs with Quasi-stable Channels Are Eeectively Recognizable
A. Finkel
1997
Corpus ID: 334716
We consider the analysis of in nite half-duplex systems which consists of nite state machines that communicate over unbounded…
Expand
1986
1986
Model and Complexity of Termination for Distributed Computations
Brigitte Rozoy
International Symposium on Mathematical…
1986
Corpus ID: 13133664
We define a model to describe the global running of a network of processes, as well as termination detection. We find algorithms…
Expand