Process algebra with propositional signals
ACP '95 Proceedings from the international workshop on Algebra of communicating processes
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Information and Computation
Process algebra for hybrid systems
Theoretical Computer Science - Process algebra
Lost in Translation: Hybrid-Time Flows vs. Real-Time Transitions
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
A Rule Format for Associativity
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Psi-calculi: Mobile Processes, Nominal Data, and Logic
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
HYPE: A Process Algebra for Compositional Flows and Emergent Behaviour
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Notions of bisimulation and congruence formats for SOS with data
Information and Computation
The φ-calculus: a language for distributed control of reconfigurable embedded systems
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Reconciling urgency and variable abstraction in a hybrid compositional setting
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Rule formats for distributivity
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
| Hi-index | 5.23 |
The process algebra for hybrid systems of Bergstra and Middelburg (2005) [6], called ACP"h"s^s^r^t, is a well-known formalism for the specification of hybrid systems (i.e. systems in which discrete and continuous behavior both play a role). Recently, a number of errors have been found in it. Most importantly, the semantics chosen in [6] is such that the alternative composition (+) is not associative, and also the axiom of time-determinism (SRT3), together with some other axioms related to choice are violated. In this paper, we make a start in repairing ACP"h"s^s^r^t, by studying the most basic sub-algebra of ACP"h"s^s^r^t for which the time-determinism axiom fails: the Basic Process Algebra with Standard Relative Timing and Non-existence (BPA"@?^s^r^t). We repair BPA"@?^s^r^tin two different ways: by adapting the axioms to the semantics, and by adapting the semantics to the axioms. Furthermore, we extend these two solutions to (two versions of) the basic process algebra for hybrid systems BPA"h"s^s^r^t.