A brief history of process algebra

Baeten, J.C.M.

doi:10.1016/j.tcs.2004.07.036

Cited by 220 publications

(139 citation statements)

References 64 publications

Supporting

Mentioning

127

Contrasting

Unclassified

Order By: Relevance

“…PARS is a process algebra [4] for representing robot programs and environments for the purpose of analysis and verification. This section gives a brief introduction to PARS as a precursor to the discussion on flow-functions and filtering in subsequent.…”

Section: Pars Representation Of Missionsmentioning

confidence: 99%

Getting it right the first time: Robot mission guarantees in the presence of uncertainty

Lyons

Arkin

Nirmal

et al. 2013

2013 IEEE/RSJ International Conference on Intelligent Robots and Systems

View full text Add to dashboard Cite

Abstract-Certain robot missions need to perform predictably in a physical environment that may only be poorly characterized in advance. We have previously developed an approach to establishing performance guarantees for behaviorbased controllers in a process-algebra framework. We extend that work here to include random variables, and we show how our prior results can be used to generate a Dynamic Bayesian Network for the coupled system of program and environment model. Verification is reduced to a filtering problem for this network. Finally, we present validation results that demonstrate the effectiveness of the verification of a multiple waypoint robot mission using this approach.

show abstract

Section: Pars Representation Of Missionsmentioning

confidence: 99%

Getting it right the first time: Robot mission guarantees in the presence of uncertainty

Lyons

Arkin

Nirmal

et al. 2013

2013 IEEE/RSJ International Conference on Intelligent Robots and Systems

View full text Add to dashboard Cite

show abstract

“…Process algebra [2] is one of a range of Computer Science techniques being applied to biological systems. While mathematical models have been used in biology for some time, the computational approach is relatively new, with the majority of applications being in the last ten years.…”

Section: Introductionmentioning

confidence: 99%

A Symbolic Investigation of Superspreaders

et al. 2010

View full text Add to dashboard Cite

Abstract. Superspreaders are an important phenomenon in the spread of infectious disease, accounting for a higher than average number of new infections in the population. We use mathematical models to compare the impact of supershedders and supercontacters on population dynamics.The stochastic, individual based models are investigated by conversion to deterministic, population level Mean Field Equations, using process algebra. The mean emergent population dynamics of the models are shown to be equivalent with and without superspreaders; however, simulations confirm expectations of differences in variability, having implications for individual epidemics.

show abstract

“…These systems are being modeled using a process algebra [2]. Process algebra is a formalism used for algebraic and axiomatic reasoning about the behavior of systems, in particular those involving concurrency [3]. However, little is known about automatic code generation from process algebra models.…”

Section: Introductionmentioning

confidence: 99%

Transforming Process Algebra Models into UML State Machines: Bridging a Semantic Gap?

Amstel¹,

Brand²,

Protic³

et al. 2008

Theory and Practice of Model Transformations

View full text Add to dashboard Cite

Abstract. There exist many formalisms for modeling the behavior of (software) systems. These formalisms serve different purposes. Process algebras are used for algebraic and axiomatic reasoning about the behavior of distributed systems. UML state machines are suitable for automatic software generation. We have developed a transformation from the process algebra ACP into UML state machines to enable automatic software generation from process algebra models. This transformation needs to preserve both behavioral and structural properties. The combination of these preservation requirements gives rise to a semantic gap. It implies that we cannot transform ACP models into UML state machines on a syntactic level only.We address this semantic gap and propose a way of bridging it. To validate our proposal, we have implemented a tool for automatic transformation of ACP process algebra models into UML state machines.

show abstract

A brief history of process algebra

Abstract: This note addresses the history of process algebra as an area of research in concurrency theory, the theory of parallel and distributed systems in computer science. Origins are traced back to the early seventies of the twentieth century, and developments since that time are sketched.

Cited by 220 publications

References 64 publications

Getting it right the first time: Robot mission guarantees in the presence of uncertainty

Getting it right the first time: Robot mission guarantees in the presence of uncertainty

A Symbolic Investigation of Superspreaders

Transforming Process Algebra Models into UML State Machines: Bridging a Semantic Gap?

Contact Info

Product

Resources

About