UvA-DARE is a service provided by the library of the University of Amsterdam (https://dare.uva.nl)
UvA-DARE (Digital Academic Repository)
Models and logics for process algebra
van der Zwaag, M.B.
Publication date
2002
Link to publication
Citation for published version (APA):
van der Zwaag, M. B. (2002). Models and logics for process algebra. Institute for
Programming Research and Algorithmics.
General rights
It is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s)
and/or copyright holder(s), other than for strictly personal, individual use, unless the work is under an open
content license (like Creative Commons).
Disclaimer/Complaints regulations
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please
let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material
inaccessible and/or remove it from the website. Please Ask the Library: https://uba.uva.nl/en/contact, or a letter
to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You
will be contacted as soon as possible.
[1]] L. Aceto, W. J. Fokkink, and C. Verhoef. Structural operational semantics. In [23], 2001. [2]] L. Aceto and M. Hennessy. Termination, deadlock, and divergence. Journal of the ACM,
39(1):147-187,, 1992.
[3]] J. C. M. Baeten and J. A. Bergstra. Real time process algebra. Formal Aspects of Computing, 3(2):: 142-188,1991.
[4]] J. C. M. Baeten and J. A. Bergstra. Discrete time process algebra. Formal Aspects of
Com-puting,puting, 8(2): 188-208, 1996.
[5]] J. C. M. Baeten, J. A. Bergstra, and J. W. Klop. Syntax and defining equations for an interrupt mechanismm in process algebra. Fund. Inf., IX: 127-168, 1986.
[6]] J. C. M. Baeten, J. A. Bergstra, and J. W. Klop. On the consistency of Koomen's fair abstrac-tionn rule. Theoretical Computer Science, 51(1/2): 129-176,1987.
[7]] J. C. M. Baeten, J. A. Bergstra, and M. A. Reniers. Discrete time process algebra with silent step.. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language, and Interaction:
EssaysEssays in Honour of Robin Milner, pages 535 - 569. MIT Press, 2000.
[8]] J. C. M. Baeten and R. J. van Glabbeek. Another look at abstraction in process algebra (ex-tendedd abstract)- In Th. Ottmann, editor, Proceedings 14th International Colloquium on
Au-tomata,tomata, Languages and Programming (ICALP'87), volume 267 of Lecture Notes in Com-puterputer Science, pages 84—94. Springer-Verlag, 1987.
[9]] J. C. M. Baeten and C. A. Middelburg. Process algebra with timing: Real time and discrete time.. In [23], 2001.
[10]] J. C. M. Baeten and C. Verhoef. Concrete process algebra. In S. Abramsky, D. M. Gabbay, andd T. S. E. Maibaum, editors. Handbook of Logic in Computer Science, volume 4, pages
149-268.. Oxford University Press, 1995.
[11]] J. C. M. Baeten and W. P. Weijland. Process Algebra, volume 18 of Cambridge Tracts in
TheoreticalTheoretical Computer Science. Cambridge University Press, 1990.
[12]] J. A. Bergstra, I. Bethke, and A. Ponse. Process algebra with iteration and nesting. The
Com-puterputer Journal, 37(4):243-258,1994.
[13]] J. A. Bergstra, I. Bethke, and P. H. Rodenburg. A prepositional logic with 4 values: true, false,, divergent and meaningless. Journal of Applied and Non-Classical Logics, 5(2): 199-218,, 1995.
[14]] J. A. Bergstra, W. J. Fokkink, and A. Ponse. Process algebra with recursive operations. Inn [23], 2001.
[15]] J. A. Bergstra and J. W. Klop. Process algebra for synchronous communication. Information
andand Control, 60(1-3):109-137, 1984.
[16]] J. A. Bergstra and J. W. Klop. Algebra of communicating processes with abstraction.
Theo-reticalretical Computer Science, 37(1):77—121, 1985.
[17]] J. A. Bergstra and A. Ponse. Bochvar-McCarthy logic and process algebra. Notre Dame
Jour-nalnal of Formal Logic, 39(4):464-^84, 1998.
156 6 References s
J.. A. Bergstra and A. Ponse. Process algebra with four-valued logic. Journal of Applied
Non-ClassicalClassical Logics, 10(l):27-53,2000.
J.. A. Bergstra and A. Ponse. Two recursive generalizations of iteration in process algebra. Technicall Report P9808, Programming Research Group, University of Amsterdam, 1998. J.. A. Bergstra and A. Ponse. Process algebra with five-valued logic. In C. S. Calude and M.. J. Dinneen, editors, Combinatorics, Computation and Logic, volume 21(3) of Australian
ComputerComputer Science Communications, pages 128-143. Springer-Verlag, 1999.
J.. A. Bergstra and A. Ponse. Process Algebra and Conditional Composition. Information
ProcessingProcessing Letters 80(l):41-49, 2001
J.. A. Bergstra and A. Ponse. Register-machine based processes. Journal of the ACM, 48(6):: 1207-1241, 2001.
J.. A. Bergstra, A. Ponse, and S. A. Smolka, editors. Handbook of Process Algebra. Elsevier Science,, 2001.
J.. A. Bergstra, A. Ponse, and M. B. van der Zwaag. Branching time and orthogonal bisimu-lationn equivalence. Technical Report SEN-R0035, CWI, Amsterdam, 2000.
M.. A. Bezem and J. F. Groote. A correctness proof of a one bit sliding window protocol in /xCRL.. The Computer Journal, 37(4):289-307, 1994.
G.. Birkhoff. On the structure of abstract algebras. In Proceedings of the Cambridge
Philo-sophicalsophical Society 31(4), pages 433-454, 1935.
S.. Blarney. Partial logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical
Logic:Logic: Volume III: Alternatives to Classical Logic, pages 1-70. Reidel, Dordrecht, 1986.
S.. C. C. Blom, W. J. Fokkink, J. F. Groote, I. A. van Langevelde, B. Lisser, and J. C. van de Pol.. jtiCRL: A toolset for analysing algebraic specifications. In G. Berry, H. Comon, and A.. Finkel, editors, Proceedings 13th Conference on Computer Aided Verification (CAV2001), volumee 2102 of Lecture Notes in Computer Science. Springer-Verlag, 2001.
R.. N. Bol and J. F. Groote. The meaning of negative premises in transition system specifica-tions.. Journal of the ACM, 43(5):863-914, 1996.
S.. D. Brookes, C. A. R. Hoare, and A. W. Roscoe. A theory of communicating sequential processes.. JournaloftheACM, 31(3): 560-599, 1984.
M.. C. A. Devillers, W. O. D. Griffioen, J. M. T Romijn, and F. W. Vaandrager. Verification off a leader election protocol — formal methods applied to IEEE 1394. Technical report, Computingg Science Institute, University of Nijmegen, 1997.
E.. W. Dijkstra. Cooperating sequential processes. In F. Genuys, editor, Programming
Lan-guages,guages, pages 43-112, Academic Press, New York, 1968.
J-C.. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sighireanu. CADP (Caesar/Aldebarann Development Package): A protocol validation and verification toolbox. In R.. Alur and T. A. Henzinger, editors, Proceedings ofCAV'96, number 1102 in LNCS, pages 437^140.. Springer-Verlag, 1996.
W.. J. Fokkink. An axiomatization for regular processes in timed branching bisimulation.
FundamentaFundamenta lnformaticae, 32:329-340, 1997.
W.. J. Fokkink. Introduction to Process Algebra. Texts in Theoretical Computer Science. Springer-Verlag,, 2000.
W.. J. Fokkink and H. Zantema. Basic process algebra with iteration: completeness of its equationall axioms. The Computer Journal, 37(4):259-267, 1994.
L.-A.. Fredlund, J. F. Groote, and H. P. Korver. Formal verification of a leader election proto-coll in process algebra. Theoretical Computer Science, Science, 177:459-486,1997. H.. Garavel and L. Mounier. Specification and verification of various distributed leader elec-tionn algorithms for unidirectional ring networks. Science of Computer Programming, 29(1-2):17t-197,, 1997.
R.. J. van Glabbeek. The linear time - branching time spectrum II; the semantics off sequential systems with silent moves. Manuscript. Preliminary version available by
ftpp at f t p : / / b o o l e . S t a n f o r d . e d u / p u b / s p e c t r u m . p s . g z . Extended abstract in E.. Best, editor, CONCUR'93, 4th International Conference on Concurrency Theory, volume 7155 of Lecture Notes Notes in Computer Science. Springer-Verlag, 1993.
[40]] R. J. van Glabbeek. A complete axiomatization for branching bisimulation congruence of
finite-statefinite-state behaviours. In A. M. Borzyszkowski and S. Sokolowski, editors, Proceedings
MathematicalMathematical Foundations of Computer Science 1993, volume 711 of Lecture Notes in Com-puterputer Science, pages 473-484. Springer-Verlag, 1993.
[41]] R. J. van Glabbeek. What is branching time semantics and why to use it? Bulletin of the
EATCS,EATCS, 53:190-198,1994. M. Nielsen, editor, The Concurrency Column.
[42]] R. J. van Glabbeek. The linear time - branching time spectrum I; the semantics of concrete, sequentiall processes. In [23], 2001.
[43]] R. J. van Glabbeek and W. R Weijland. Branching time and abstraction in bisimulation se-manticss (extended abstract). In G. X. Ritter, editor, Information Processing 89, Proceedings
ofof the IFIP llth World Computer Congress, pages 613-618. North-Holland, 1989. Full
ver-sionn in [44].
[44]] R. J. van Glabbeek and W. P. Weijland. Branching time and abstraction in bisimulation se-mantics.. Journal of of the ACM, 43(3):555-6O0, 1996.
[45]] M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL; A A theorem proving
environ-mentment for higher order logic. Cambridge University Press, 1993.
[46]] J. F. Groote. A note on « similar parallel processes. Technical Report CS-R9626, CWI, Am-sterdam,, 1996.
[47]] J. F. Groote. The syntax and semantics of timed /iCRL. Technical Report SEN-R9709, CWI, Amsterdam,, 1997.
[48]] J. F. Groote and H. P. Korver. Correctness proof of the bakery protocol in fiCRL. In A. Ponse, CC Verhoef, and S. F. M. van Vlijmen, editors, Algebra of Communicating Processes '94, Workshopss in Computing Series, pages 63-86. Springer-Verlag, 1995.
[49]] J. F. Groote and S. P. Luttik. Undecidabiliry and completeness results for process algebras withh alternative quantification over data. Technical Report SEN-R9806, CWI, Amsterdam, 1998. .
[50]] J. F. Groote, F. Monin, and J. C. van de Pol. Checking verifications of protocols and dis-tributedd systems by computer. In D. Sangiorgi and R. de Simone, editors, Proceedings of
CONCURCONCUR '98, volume 1466 of Lecture Notes in Computer Science, pages 629-655.
Springer-Verlag,, 1998.
[51]] J. F. Groote and J. C. van de Pol. A bounded retransmission protocol for large data packets. A casee study in computer checked verification. In M. Wirsing and M. Nivat, editors,
Proceed-ingsings of AMAST'96, volume 1101 of Lecture Notes in Computer Science. Springer-Verlag,
1996. .
[52]] J. F. Groote and A. Ponse. The syntax and semantics of /iCRL. In A. Ponse, C. Verhoef, andd S. F. M. van Vlijmen, editors, Algebra of Communicating Processes '94, Workshops in Computingg Series, pages 26-62. Springer-Verlag, 1995.
[53]] J. F. Groote and J. Springintveld. Focus points and convergent process operators. A proof strategyy for protocol verification. Logic Group Preprint Series 142, Department of Philoso-phy,, Utrecht University, 1995.
[54]] J. F. Groote and J. Springintveld. Algebraic verification of a distributed summation algorithm. Technicall Report CS-R9640, CWI, Amsterdam, 1996.
[55]] J. F. Groote and J. J. van Wamel. Analysis of tfiree hybrid systems in timed fiCRL. Science
ofof Computer Programming, 39:215-247, 2001. .
[56]] M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of of
thethe ACM, 32:137-161,1985.
158 8 References s
[58]] IEEE Standard for a High Performance Serial Bus. IEEE Computer Society, August 1996. Std.. 1394-1995.
[59]] J. A. Kalman. Lattices with involution. Trans. Am. Math. Soc, 87:485^191, 1958.
[60]] S. C. Kleene. On a notation for ordinal numbers. Journal of Symbolic Logic, 3:150-155, 1938. .
[61]] S. C. Kleene. Representation of events in nerve nets and finite automata. In Automata Studies, pagess 3-41. Princeton University Press, Princeton NJ, 1956.
[62]] A. S. Klusener. The silent step in time. In W. R. Cleaveland, editor. Proceedings of
CON-CUR'92,CUR'92, volume 630 of Lecture Notes in Computer Science, pages 421^*35.
Springer-Verlag,, 1992.
[63]] A. S. Klusener. Models and axioms for a fragment of real time process algebra. PhD thesis, Eindhovenn University of Technology, 1993.
[64]] H. P. Korver and M. P. A. Sellink. On automating process algebra proofs. In V. Atalay et al,
editor,, Proceedings of the 11-th International Symposium on Computer and Information Information
Sci-ences,ences, volume 2 of ISCIS XI, pages 815-826, 1996.
[65]] S. P. Luttik. Description and formal specification of the link layer of PI 394. Technical Report SEN-R9706,, CWI, Amsterdam, 1997.
[66]] S. P. Luttik. Choice Quantification in Process Algebra. PhD thesis, University of Amsterdam, 2002. .
[67]] J. McCarthy. A basis for a mathematical theory of computation. In P. Braffort and D. Hir-shbergg (eds.). Computer Programming and Formal Systems, pages 33-70, North-Holland, Amsterdam,Amsterdam, 1963.
[68]] R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer
Science.Science. Springer-Verlag, 1980.
[69]] R. Milner. Modal characterisation of observable machine behaviour. In G. Astesiano and C.. Bohm, editors, Proceedings CAAP 81, 81, volume 112 of Lecture Notes Notes in Computer Science, pagess 25-34. Springer-Verlag, 1981.
[70]] R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 28(3):267-310,, 1983.
[71]] R. Milner. Communication and Concurrency. Prentice-Hall International, 1989.
[72]] M. L. Minsky. Computation: finite and infinite machines. Prentice-Hall, Englewood Cliffs N.. J., 1967.
[73]] F. Moller and C. Tofts. A temporal calculus of communicating systems. In J. C. M. Baeten and J.. W. Klop, editors, Proceedings of CONCUR '90, volume 458 of Lecture Notes Notes in Computer
Science,Science, pages 401-415. Springer-Verlag, 1990.
[74]] D. M. R. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, 5th GI
Conference,Conference, volume 104 of Lecture Notes in Computer Science, pages 167-183.
Springer-Verlag,, 1981.
[75]] A. Ponse and M. B. van der Zwaag. The logic of ACP. Technical Report SEN-R0207, CWI, Amsterdam,, 2002.
[76]] G. M. Reed and A. W. Roscoe. A timed model for communicating sequential processes.
TheoreticalTheoretical Computer Science, 58(l/3):249-261, 1998.
[77]] M. A. Reniers, J. F. Groote, M. B. van der Zwaag, and J.J. van Wamel. Completeness of timedd fiCRL. Fundamenta Informaticae, 50(3-4), 2002.
[78]] C. Shankland and M. B. van der Zwaag. The tree identify protocol of IEEE 1394 in ^iCRL.
FormalFormal Aspects of Computing, 10:509-531, 1998.
[79]] M. Sighireanu and R. Mateescu. Validation of the link layer protocol of the IEEE-1394 serial buss (FireWire): an experiment with E-LOTOS. Technical Report 3172, INRIA, 1997. [80]] A. S. Tanenbaum. Computer Networks. Prentice-Hall, Englewood Cliffs N. J., second edition,
[81]] F. W. Vaandrager. Two simple protocols. In J. C. M. Baeten, editor, Applications of Process
Algebra,Algebra, number 17 in Cambridge Tracts in Theoretical Computer Science, pages 23-45.
Cambridgee University Press, 1990.
[82]] C. Verhoef. A congruence theorem for structured operational semantics with predicates and negativee premises. Nordic Journal of Computing, 2(2):274-302,1995.
[83]] M. B. van der Zwaag. Some verifications in process algebra with iota. Report P9806, Pro-grammingg Research Group, University of Amsterdam, 1998.
[84]] M. B. van der Zwaag. A verification in process algebra with iota. In J. F. Groote, S. P. Luttik, andd J. J. van Wamel, editors, Proceedings of the Third International Workshop on Formal
MethodsMethods for Industrial Critical Systems, pages 347-368, CWI, Amsterdam, The Netherlands,
1998. .
[85]] M. B. van der Zwaag. Time-stamped actions in pCRL algebras. Technical Report SEN-R0002,, CWI, Amsterdam, 2000.
[86]] M. B. van der Zwaag. The cones and foci proof technique for timed transition systems.
