Title
Process algebra for hybrid systems
Abstract
We propose a process algebra obtained by extending a combination of the process algebra with continuous relative timing from Baeten and Middelburg (Process Algebra with Timing, Springer, Berlin, 2002, Chapter 4), and the process algebra with propositional signals from Baeten and Bergstra (Theoret. Comput. Sci. 177 (1977) 381-405). The proposed process algebra makes it possible to deal with the behaviour of hybrid systems, i.e. systems in which the instantaneous state transitions caused by performing actions are alternated with continuous state evolutions. This process algebra has, in addition to equational axioms, rules to derive equations with the help of real analysis.
Year
DOI
Venue
2005
10.1016/j.tcs.2004.04.019
Theoretical Computer Science
Keywords
Field
DocType
proposed process algebra,hybrid systems,hybrid system,continuous state evolution,process algebra,state evolutions,propositional signals,propositional signal,instantaneous state,real analysis,state transitions.,continuous relative timing
Algebra of Communicating Processes,Term algebra,Graph algebra,Constraint algebra,Algebra,Axiom,Pure mathematics,Process calculus,Two-element Boolean algebra,Mathematics,Algebra representation
Journal
Volume
Issue
ISSN
335
2-3
Theoretical Computer Science
Citations 
PageRank 
References 
41
1.89
40
Authors
2
Name
Order
Citations
PageRank
Jan A. Bergstra11445140.42
C. A. Middleburg2411.89