Process algebra with four-valued logic

Journal of Applied Non-Classical Logics

Volumn 10, Issue 1, 2000, Pages 27-53

  Bergstra, Jan A ^a   Ponse, Alban ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Conditional Composition; Conditional Guard Construct; Many Valued Logic; Process Algebra

Indexed keywords

EID: 0003796788     PISSN: 11663081     EISSN: 19585780     Source Type: Journal    
DOI: 10.1080/11663081.2000.10510987     Document Type: Article

References (35)

1. K.R. Apt. Ten years of Hoare's logic, a survey, part I. ACM Transactions on Programming Languages and Systems, 3(4):431-483, 1981
2. J.C.M. Baeten and J.A. Bergstra. Process algebra with signals and conditions. In M. Broy, editor, Programming and Mathematical Method, Proceedings Summer School Marktoberdorf, 1990 NATO ASI Series F, pages 273-323, Springer-Verlag, 1992
3. J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Syntax and defining equations for an interrupt mechanism in process algebra. Fundamenta lnformaticae, IX(2): 127-168, 1986
4. J.A. Bergstra, I. Bethke, and A Ponse. Process algebra with iteration and nesting. Computer Journal, 37( 4 ):243-258, 1994
5. J.A. Bergstra, I. Bethke, and P.H. Rodenburg. A propositional logic with 4 values: true, false, divergent and meaningless. Journal of Applied Non-Classical Logics, 5:199-217,1995
6. H. Barringer, J.H. Cheng, and C.B. Jones. A logic covering undefinedness in program proofs. Acta Informatica, 21 :251-269, 1984
7. S.D. Brookes, C.A.R. Hoare, and A.W. Roscoe. A theory of communicating sequential processes. Journal of the ACM, 31(3):560-599,1984
8. J.A. Bergstra and J.W. Klop. The algebra of recursively defined processes and the algebra of regular processes. In A. Ponse, C. Verhoef, and S.F.M. van Vlijmen, Algebra of Communicating Processes, Utrecht 1994, Workshops in Computing, pages 1-25
9. An extended abstract appeared in I. Paredaens, editor, Proceedings l1 1h ICALP, Antwerp, volume 172 of Lecture Notes in Computer Science, pages 82-95. Springer-Verlag, 1984
10. J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Control, 60(1/3): 109-137, 1984
11. D.A. Bochvar. On a 3-valued logical calculus and its application to the analysis of contradictions (in Russian). Matemati~eskij sbornik, 4:287-308, 1939
12. J.A. Bergstra and J.C. van de Pol. A calculus for sequential logic with 4 values. Technical Report 160, Logic Group Preprint Series, Utrecht University, 1996, (see also http: I lwww .phil. uu. nllpreprints. html
13. J.A. Bergstra and A. Ponse. Bochvar-McCarthy logic and process algebra. Technical Report P9722, Programming Research Group, University of Amsterdam, 1997, (http:llwww.wins.uva.nllresearchlproglreportslreports.html
14. J.A. Bergstra and A. Ponse. Process algebra primitives for file transfer. Liber Amicorum dedicated to Paul Klint, pages 33-42, CWI, 1997. Also: Technical Report P9725, Programming Research Group, University of Amsterdam, 1997, (http:llwww.wins.uva.nllresearchlproglreportslreports.html
15. I .A. Bergstra and A. Ponse. Kleene's three-valued logic and process algebra. Information Processing Letters, 67(2):95-103, 1998
16. J.A. Bergstra and A. Ponse. Process algebra with five-valued conditions. In C.S. Calude and M.J. Dinneen (eds.). Combinatorics, Complexity, and Logic. Proceedings of DMTCS'99 and CATS'99, Springer-Verlag, Singapore, 1999. To appear
17. J .A. Bergstra and M.P.A. Sellink. Sequential data algebra primitives. Technical Report P9602b, Programming Research Group, University of Amsterdam, 1996, (http: I lwww. wins. uva. nllresearchlproglreportslreports. html
18. J.P. Burgess. Basic tense logic. In D. Gabbay and F. Guenthner (eds.), Handbook of Philosophical Logic, Vol. II, pages 89-133, Reidel, 1984
19. J.C.M. Baeten and W.P. Weijland. Process algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990
20. E.W. Dijkstra. Cooperating sequential processes. In F. Genuys, editor, Programming Languages, pages 43-112, Academic Press, New York, 1968
21. E.W. Dijkstra. Guarded Commands, Nondeterminacyand Formal Derivation of Programs. Communications of the ACM, 18(8):453-457, August 1975
22. WJ. Fokkink and R.J. van Glabbeek. Ntyft/ntyxt rules reduce to ntree rules. Information and Computation, 126: 1-10, 1996
23. W.J. Fokkink. Axiomatizations for the perpetual loop in process algebra. In P. Degano, R. Gorrieri and A. Marchetti-Spaccamela (eds.), Proc. 24th Colloquium on Automata, Languages and Programming- ICALP'97, Lecture Notes in Computer Science 1256, pages 571-581, Springer-Verlag, 1997
24. J.F. Groote and A. Ponse. Process algebra with guards: combining Hoare logic and process algebra. Formal Aspects of Computing, 6:115-164, 1994
25. J.F. Groote. Transition system specifications with negative premises. Theoretical Computer Science, 118(2):263-299, 1993
26. C.A.R. Hoare,I.J. Hayes, J. He, C.C. Morgan, A.W. Roscoe, J.W. Sanders, I.H. Sorensen, J.M. Spivey, and B.A. Sufrin. Laws of programming. Communications of the ACM, 30(8):672-686, August 1987
27. C.B. Jones, C.A. Middelburg. A typed logic of partial functions reconstructed classically. Acta Informatica, 31(5):399-430, 1994
28. C.B. Jones. Systematic Software Development using VDM (2nd edition). Prentice-Hall International, Englewood Cliffs, 1990
29. J. Kalman. Lattices with involution. Trans. Am. Math. Soc., 87:485-491, 1958
30. S.C. Kleene. On a notation for ordinal numbers. Journal of Symbolic Logic, 3:150-155, 1938
31. S.C. Kleene. Representation of events in nerve nets and finite automata. In Automata Studies, page.~ 3-41. Princeton University Press, Princeton NJ, 1956
32. J. McCarthy. A basis for a mathematical theory of computation. In P. Braffort and D. Hirshberg (eds.), Computer Programming and Formal Systems, pages 33- 70, North-Holland, Amsterdam, 1963
33. A. Ponse. Process expressions and Hoare's logic. Information and Computation 95(2):192-217, 1991
34. P.H. Rodenburg. A complete system of four-valued logic. Technical Report P9616, Programming Re.~ch Group, University of Amsterdam, 1996, (http://www.wins.uva.nl/research/prog/reports/reports.html). To appear in Journal of Applied Non-Classical Logics
35. C. Verhoef. A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing, 2(2):274-302, 1995