Completeness in real time process algebra
Abstract: "Recently, J.C.M. Baeten and J.A. Bergstra extended ACP with real time, resulting in a Real Time Process Algebra, called ACP[subscript rho] [BB89]. They introduced an equational theory and an operational semantics. Their paper does not contain a completeness result nor does it contain...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1991
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
91,6 |
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Abstract: "Recently, J.C.M. Baeten and J.A. Bergstra extended ACP with real time, resulting in a Real Time Process Algebra, called ACP[subscript rho] [BB89]. They introduced an equational theory and an operational semantics. Their paper does not contain a completeness result nor does it contain the definitions to give proofs in detail. In this paper we introduce some machinery and a completeness result. The operational semantics of [BB89] contains the notion of an idle step reflecting that a process can do nothing more then [sic] passing the time before performing a concrete action at a certain point in time. This idle step corresponds nicely to our intuition but it results in uncountable branching transition systems In this paper we give a more abstract operational semantics, by abstracting from the idle step. Due to this simplification we can prove soundness and completeness easily. These results hold for the semantics of [BB89] as well, since both operational semantics induce the same equivalence relation between processes. |
|---|---|
| Beschreibung: | 57 S. |