Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,961,347 papers from all fields of science
Search
Sign In
Create Free Account
Process calculus
Known as:
Process calculi
, Hybrid Process Algebra
, Sequential composition
Expand
In computer science, the process calculi (or process algebras) are a diverse family of related approaches for formally modelling concurrent systems…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
45 relations
Actor model
Actor model and process calculi
Algebra of Communicating Processes
Ambient calculus
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Analysis of distributed systems with mCRL2
J. F. Groote
,
A. Mathijssen
,
M. Reniers
,
Y. Usenko
,
M. V. Weerdenburg
2008
Corpus ID: 14004582
ion An important notion in process algebra is that of abstraction. Usually the requirements of a system are defined in terms of…
Expand
2007
2007
Name-passing process calculi : operational models and structural operational semantics
S. Staton
2007
Corpus ID: 2532182
rule induction. Together, an abstract rule of this form and a U-structured B-coalgebra, (X ,h : UX → BUX ), provide parameterised…
Expand
2007
2007
On Relating and Integrating Two Trust Management Frameworks
F. Martinelli
,
M. Petrocchi
VODCA@FOSAD
2007
Corpus ID: 14309139
2007
2007
Palladio - Prediction of Performance Properties
K. Krogmann
,
Ralf H. Reussner
CoCoME
2007
Corpus ID: 46004094
Palladio is a component modelling approach with a focus on performance (i.e. response time, throughput, resource utilisation…
Expand
2006
2006
Modeling Web service composition using symbolic transition systems
Jyotishman Pathak
,
Samik Basu
,
Vasant G Honavar
AAAI Conference on Artificial Intelligence
2006
Corpus ID: 9951306
Web services are software entities which provide a set of functionalities that can be accessed over the Web. In general, the…
Expand
2003
2003
A process algebraic reduction strategy for automata theoretic verification of untimed and timed concurrent systems
Matti Luukkainen
2003
Corpus ID: 61954704
Highly Cited
2002
Highly Cited
2002
Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation
G. Ferrari
,
U. Montanari
,
M. Pistore
Foundations of Software Science and Computation…
2002
Corpus ID: 27493973
We address the problem of minimizing labelled transition systems for name passing calculi. We show how the co-algebraic…
Expand
1997
1997
Real-time concepts for a formal specification language for software hardware systems
M. Geilen
,
J. Voeten
1997
Corpus ID: 16706834
Increasingly complex systems are being designed that consist of concurrently operating and communicating processes, often…
Expand
1994
1994
Stars or Stripes: a comparative study of finite and transfinite techniques for surface modelling
Overveld van Cwam
,
M. Verhoeven
1994
Corpus ID: 122914530
Reduction and Topology, p. 28. Non Interleaving Process Algebra, p. 17. Design and Analysis of Dynamic Leader Election Protocols…
Expand
1991
1991
An Action Based Framework for Verifying Logical and Behavioural Properties of Concurrent Systems
R. Nicola
,
A. Fantechi
,
S. Gnesi
,
G. Ristori
International Conference on Computer Aided…
1991
Corpus ID: 39618946
A system is described which supports proofs of both behavioural and logical properties of concurrent systems; these are specified…
Expand
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)
ACCEPT & CONTINUE