Process algebra with prepositional signals

Theoretical Computer Science

Volumn 177, Issue 2, 1997, Pages 381-405

  Baeten, J C M ^a   Bergstra, J A ^b,c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

^c UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; FORMAL LOGIC; SIGNAL DETECTION; SIGNAL ENCODING; SIGNAL FILTERING AND PREDICTION; SIGNAL PROCESSING;

PROPOSITIONAL SIGNALS;

INFORMATION THEORY;

EID: 0031146369     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00253-8     Document Type: Article

References (17)

1. D. Austry and G. Boudol, Algèbre de processus et synchronisation, Theoret. Comput. Sci. 30 (1984) 91-131.
2. J.C.M. Baeten and J.A. Bergstra, Global renaming operators in concrete process algebra, Inform. and Comput. 78 (1988) 205-245.
3. J.C.M. Baeten and J.A. Bergstra, Process algebra with signals and conditions, in: M. Broy, ed., Programming and mathematical method, Proc. Summer School, Marktoberdorf, 1990 NATO ASI Series F 88 (Springer, Berlin, 1992) 273-323.
4. J.C.M. Baeten and W.P. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science, Vol. 18 (Cambridge Univ. Press, Cambridge, 1990).
5. J.A. Bergstra, ACP with signals, in: J. Grabowski, P. Lescanne and W. Wechler, eds., Algebraic and Logic Programming, Lecture Notes in Computer Science, Vol. 343 (Springer, Berlin, 1988) 11-20.
6. J.A. Bergstra and J.W. Klop, Process algebra for synchronous communication. Inform. and Control 60 (1984) 109-137.
7. J.A. Bergstra and A. Ponse, Frame based process logics, in: A. Ponse, Y. Venema and M. de Rijke, eds., Modal Logic and Process Algebra, CSLI Lecture Notes, Vol. 53 (CSLI Publications, Stanford, 1995) 39-63.
8. S.D. Brookes, C.A.R. Hoare and W. Roscoe, A theory of communicating sequential processes, J. ACM 31 (1984) 560-599.
9. W.S. Brouwer, Stable signals and observation in a process specification formalism, M.Sc. Thesis, University of Amsterdam, 1990.
10. W.J. Fokkink and C. Verhoef, A conservative look at term deduction systems with variable binding, Report CSR 95-28, Eindhoven University of Technology, 1995.
11. R.J. van Olabbeek and W.P. Weijland, Branching time and abstraction in bisimulation semantics. J. ACM 43 (1996) 555-600.
12. J.F. Groote and A. Ponse, Process algebra with guards (combining Hoare logic with process algebra), Formal Aspects Comput. 6 (1994) 115-164.
13. R. Milner, A calculus for communicating systems, Lecture Notes in Computer Science, Vol. 92 (Springer, Berlin, 1980).
14. R. Milner, A complete inference system for a class of regular behaviours, JCSS 28 (1984) 439-466.
15. X. Nicollin and J. Sifakis, The algebra of timed processes ATP: theory and application, Inform. Comput. 114 (1994) 131-178.
16. C. Verhoef, Linear unary operators in process algebra, Ph. D. Thesis, University of Amsterdam, 1992.
17. C. Verhoef, A congruence theorm for structured operational semantics with predicates and negative premises, Nordic J. Comput. 2 (1995) 274-302.