Process algebra for hybrid systems

Bergstra, Jan A.; Middleburg, C. A.

doi:10.1016/j.tcs.2004.04.019

Cited by 72 publications

(55 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Initiated and used in Computer Science to reason about computer software, process algebras found many applications in several diverse fields from web applications to hybrid systems [24]. Using process algebra for specification of UAV missions was first considered in Ref.…”

Section: Process Algebramentioning

confidence: 99%

A Process Algebra Genetic Algorithm

Karaman

Shima

2012

IEEE Trans. Evol. Computat.

View full text Add to dashboard Cite

Abstract-A genetic algorithm that utilizes process algebra for coding of solution chromosomes and for defining evolutionary based operators is presented. The algorithm is applicable to mission planning and optimization problems. As an example the high level mission planning for a cooperative group of uninhabited aerial vehicles is investigated. The mission planning problem is cast as an assignment problem, and solutions to the assignment problem are given in the form of chromosomes that are manipulated by evolutionary operators. The evolutionary operators of crossover and mutation are formally defined using the process algebra methodology, along with specific algorithms needed for their execution. The viability of the approach is investigated using simulations and the effectiveness of the algorithm is shown in small, medium, and large scale problems.

show abstract

Section: Process Algebramentioning

confidence: 99%

A Process Algebra Genetic Algorithm

Karaman

Shima

2012

IEEE Trans. Evol. Computat.

View full text Add to dashboard Cite

show abstract

“…Other hybrid process algebras have been developed, such as ACP srt hs [24], hybrid χ [25] and the φ-calculus [26], but they all have a property inherited from hybrid automata theory [27,28], requiring that abstract actions are used to represent discontinuities in the physics. HyPA and BHPC [29] are the only hybrid process algebras that allow discontinuous behavior without explicit communication between actions.…”

Section: Related Formalismsmentioning

confidence: 99%

Constitutive Hybrid Processes: a Process-Algebraic Semantics for Hybrid Bond Graphs

2008

View full text Add to dashboard Cite

Models of physical systems have to be based on physical principles such as conservation of energy and continuity of power. These principles are inherently enforced by the bond graph modeling formalism. Often, however, physical components may be best modeled as piecewise continuous with discrete mode changes, which leads to a violation of continuity principles. To support such hybrid models, bond graphs can be extended by facilitating a dynamic model structure, resulting in hybrid bond graphs. Behavior generation then requires computing continuous-time evolution, detecting the occurrence of events, executing the discrete state changes, and re-initializing the continuous-time state. This paper presents a comprehensive representation of these different aspects of behavior using hybrid process algebra. The behavior of a hybrid bond graph can then be studied using a uniform representation while a direct correspondence with the elements of the bond graph is maintained. Additionally, nondeterminism can be included in hybrid bond graph semantics which may alleviate the modeling task without being detrimental to the required analyses.

show abstract

“…A thermostat is one of the main introductory examples of hybrid systems. It is used in many sources (Alur et al, 1994;Henzinger, 1996;Bergstra and Middelburg, 2003;Schiffelers et al, 2003). The temperature of a room is controlled by a thermostat, which continuously senses the temperature and switches a heater on and off.…”

Section: Thermostatmentioning

confidence: 99%

“…A prominent framework for hybrid systems is provided by the family of hybrid automata models (hybrid automata (Alur et al, 1993;Henzinger, 1996), hybrid behavioural automata (Julius et al, 2002), hybrid input/output automata (Lynch et al, 2003)). More recently process algebraic models have been put forward as a vehicle for the study of hybrid systems (Cuijpers and Reniers, 2003;Bergstra and Middelburg, 2003).…”

Section: Introductionmentioning

confidence: 99%

“…Standard process algebraic techniques lead to the characterization of the observable behaviour of such systems as equivalence classes under some suitably adapted notion of bisimulation, yielding a potentially interesting mathematical interpretation of the notion of hybrid behaviour. A technical advantage of our approach is that, in contrast to (Cuijpers and Reniers, 2003;Bergstra and Middelburg, 2003) strong bisimulation is a congruence relation with respect to the parallel composition of subsystems, i.e. substitution of a subsystem by a bisimilar subsystem does not affect the behaviour of the composition.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Process Algebraic Approach to Hybrid Systems

Brinksma

Krilavičius

Usenko

2005

IFAC Proceedings Volumes

View full text Add to dashboard Cite

Process algebra is a theoretical framework for the modelling and analysis of the behaviour of concurrent discrete event systems that has been developed within computer science in past quarter century. It has generated a deeper understanding of the nature of concepts such as observable behaviour in the presence of nondeterminism, system composition by interconnection of concurrent component systems, and notions of behavioural equivalence of such systems. It has contributed fundamental concepts such as bisimulation, and has been succesfully used in a wide range of problems and practical applications in concurrent systems. We believe that the basic tenets of process algebra are highly compatible with the behavioural approach to dynamical systems. In our contribution we present an extension of classical process algebra that is suitable for the modelling and analysis of continuous and hybrid dynamical systems. It provides a natural framework for the concurrent composition of such systems, and can deal with nondeterministic behaviour that may arise from the occurrence of internal switching events. Standard process algebraic techniques lead to the characterization of the observable behaviour of such systems as equivalence classes under some suitably adapted notion of bisimulation.

show abstract

Process algebra for hybrid systems

Cited by 72 publications

References 47 publications

A Process Algebra Genetic Algorithm

A Process Algebra Genetic Algorithm

Constitutive Hybrid Processes: a Process-Algebraic Semantics for Hybrid Bond Graphs

Process Algebraic Approach to Hybrid Systems

Contact Info

Product

Resources

About