Preview
Unable to display preview. Download preview PDF.
References
Abramsky, S., (1995). Interaction categories, This Volume.
Andersen, H., and Winskel, G. (1992). Compositional checking of satisfaction. Formal Methods in System Design, 1.
Andersen, H., Stirling, C., and Winskel, G. (1994). A compositional proof system for the modal mu-calculus. Procs 9th IEEE Symposium on Logic in Computer Science, 144–153.
Austry, D., and Boudol, G. (1984). Algebra de processus et synchronisation. Theoretical Computer Science, 30, 90–131.
Baeten, J., Bergstra, J., and Klop, J. (1987). Decidability of bisimulation equivalence for processes generating context-free languages. Lecture Notes in Computer Science, 259, 94–113.
Baeten, J, and Weijland, W. (1990). Process Algebra. Cambridge University Press.
Baeten, J., Bergstra, J., Hoare, C., Milner, R., Parrow, J., and de Simone, R. (1992). The variety of process algebra. Manuscript.
De Bakker, J. (1980). Mathematical Theory of Program Correctness, Prentice-Hall.
De Bakker, J., and De Roever, W. (1973). A calculus for recursive program schemes. In Automata, Languages and Programming, ed. Nivat, M. 167–196, North-Holland.
Bernholtz, O., Vardi, M. and Wolper, P. (1994). An automata-theoretic approach to branching-time model checking. Lecture Notes in Computer Science, 818, 142–155.
Bergstra, J. and Klop, J. (1989). Process theory based on bisimulation semantics. Lecture Notes in Computer Science, 354, 50–122.
van Benthem, J. (1984). Correspondence theory. In Handbook of Philosophical Logic, Vol. II, ed. Gabbay, D. and Guenthner, F., 167–248, Reidel.
Bloom, B., Istrail, S., and Meyer A. (1988). Bisimulation cant be traced. In 15th Annual Symposium on the Principles of Programming Languages, 229–239.
Boudol, G. (1985). Notes on algebraic calculi of processes, in Logics and Models of Concurrent Systems, Springer.
Bradfield, J. (1992). Verifying Temporal Properties of Systems. Birkhauser.
Bradfield, J. (1993). A proof assistant for symbolic model checking. Lecture Notes in Computer Science, 663, 316–329.
Bradfield, J. and Stirling, C. (1990). Verifying temporal properties of processes. Lecture Notes in Computer Science, 458, 115–125.
Bradfield, J. and Stirling, C. (1992). Local model checking for infinite state spaces. Theoretical Computer Science, 96, 157–174.
Browne, M., Clarke, E., and Grumberg, O. (1988). Characterizing finite Kripke structures in propositional temporal logic. Theoretical Computer Science, 59, 115–131.
Bruns, G. (1993). A practical technique for process abstraction. Lecture Notes in Computer Science, 715, 37–49.
Camilleri, J., and Winskel, G. (1991). CCS with priority. Procs 6th IEEE Symposium on Logic in Computer Science, 246–255.
Christensen, S., Hirshfeld, Y., and Moller, F. (1993). Bisimulation is decidable for all basic parallel processes. Lecture Notes in Computer Science, 715, 143–157.
Christensen, S., Hüttel, H., and Stirling, C. (1992). Bisimulation equivalence is decidable for all context-free processes. Lecture Notes in Computer Science, 630, 138–147.
Cleaveland, R., and Hennessy, M. (1988). Priorities in process algebra. Proc. 3rd IEEE Symposium on Logic in Computer Science, 193–202.
Cleaveland, R, Parrow, J, and Steffen, B. (1989). The concurrency workbench. Lecture Notes in Computer Science, 407, 24–37.
Condon, A. (1992). The complexity of stochastic games. Information and Computation, 96, 203–224.
De Nicola, R. and Vaandrager, V. (1990). Three logics for branching bisimulation. Proc. 5th IEEE Symposium on Logic in Computer Science, 118–129.
Emerson, E, and Clarke, E. (1980). Characterizing correctness properties of parallel programs using fixpoints. Lecture Notes in Computer Science, 85, 169–181.
Emerson, E., and Jutla, C. (1991). Tree automata, mu-calculus and determinacy. In Proc. 32nd IEEE Foundations of Computer Science.
Emerson, E, and Lei, C. (1986). Efficient model checking in fragments of the propositional mu-calculus. In Proc. 1st IEEE Symposium on Logic in Computer Science, 267–278.
Emerson, E, and Srinivasan, J. (1989). Branching time temporal logic. Lecture Notes in Computer Science, 354, 123–284.
van Glabbeek, J. (1990). The linear time-branching time spectrum. Lecture Notes in Computer Science, 458, 278–297.
van Glabbeek, J. F., and Weijland, W.P. (1989). Branching time and abstraction in bisimulation semantics. Information Processing Letters, 89, 613–618.
Groote, J. (1993). Transition system specifications with negative premises. Theoretical Computer Science, 118, 263–299.
Groote, J. and Vaandrager, F. (1989). Structured operational semantics and bisimulation as a congruence. Lecture Notes in Computer Science, 372, 423–438.
Hennessy, M. (1988). An Algebraic Theory of Processes. MIT Press.
Hennessy, M. and Ingolfsdottir. (1990). A theory of communicating processes with value-passing. Lecture Notes in Computer Science, 443, 209–220.
Hennessy, M. and Milner, R. (1980). On observing nondeterminism and concurrency. Lecture Notes in Computer Science, 85, 295–309.
Hennessy, M. and Milner, R. (1985). Algebraic laws for nondeterminism and concurrency. Journal of Association of Computer Machinery, 32, 137–162.
Hoare, C. (1985). Communicating Sequential Processes. Prentice Hall.
Kannellakis, P. and Smolka, S. (1990). CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86, 43–68.
Kozen, D. (1983). Results on the propositional mu-calculus. Theoretical Computer Science, 27, 333–354.
Lamport, L. (1983) Specifying concurrent program modules. ACM Transactions of Programming Language Systems, 6, 190–222.
Larsen, K. (1990). Proof systems for satisfiability in Hennessy-Milner logic with recursion. Theoretical Computer Science, 72, 265–288.
Larsen, K. (1990). Ideal specification formalism. Lecture Notes in Computer Science, 458, 33–56.
Larsen, K. and Skou. (1989). Bisimulation through probabilistic testing. In 16th Annual ACM Symposium on Principles of Programming Languages.
Long, D., Browne, A., Clarke, E., Jha, S., and Marrero, W. (1994). An improved algorithm for the evaluation of fixpoint expressions. Lecture Notes in Computer Science, 818.
Ludwig, W. (1995). A subexponential randomized algorithm for the simple stochastic game problem. Information and Computation, 117, 151–155.
Manna, Z, and Pnueli, A. (1991). The Temporal Logic of Reactive and Concurrent Systems. Springer.
Milner, R. (1980). A Calculus of Communicating Systems. Lecture Notes in Computer Science, 92.
Milner, R. (1983). Calculi for synchrony and asynchrony. Theoretical Computer Science, 25, 267–310.
Milner, R. (1989). Communication and Concurrency. Prentice Hall.
Milner, R., Parrow, J., and Walker, D. (1992). A calculus of mobile processes, Parts I and II, Information and Computation, 100, 1–77.
Moller, F. and Tofts, C. (1990). A temporal calculus of communicating processes. Lecture Notes in Computer Science, 458, 401–415.
Nicollin, X. and Sifakis, J. (1992). An overview and synthesis on timed process algebras. Lecture Notes in Computer Science, 575, 376–398.
Park, D. (1969). Fixpoint induction and proofs of program properties. Machine Intelligence, 5, 59–78, Edinburgh University Press
Park, D. (1981). Concurrency and automata on infinite sequences. Lecture Notes in Computer Science, 154, 561–572.
Parrow, J. (1988). Verifying a CSMA/CD-Protocol with CCS. In Protocol Specification, Testing, and Verification VIII, 373–384. North-Holland.
Plotkin, G. (1981). A structural approach to operational semantics. Technical Report, DAIMI FN-19, Aarhus University.
Pratt, V. (1982). A decidable mu-calculus, 22nd IEEE Symposium on Foundations of Computer Science, 421–427.
Simone, R. de (1985). Higher-level synchronizing devices in Meije-SCCS. Theoretical Computer Science, 37, 245–267.
Sistla, P., Clarke, E., Francez, N. and Meyer, A. (1984). Can message buffers be axiomatized in linear temporal logic? Information and Control, 68, 88–112.
Stirling, C. (1987). Modal logics for communicating systems, Theoretical Computer Science, 49, 311–347.
Stirling, C. (1992) Modal and temporal logics. In Handbook of Logic in Computer Science Vol. 2, ed. Abramsky, S, Gabbay, D, and Maibaum, T., 477–563, Oxford University Press.
Stirling, C. (1995). Local model checking games. Lecture Notes in Computer Science, 962, 1–11.
Stirling, C. and Walker, D. (1991). Local model checking in the modal mucalculus. Theoretical Computer Science, 89, 161–177.
Streett, R. and Emerson, E. (1989). An automata theoretic decision procedure for the propositional mu-calculus. Information and Computation, 81, 249–264.
Taubner, D. (1989). Finite Representations of CCS and TCSP Programs by Automata and Petri Nets. Lecture Notes in Computer Science, 369.
Walker, D. (1987). Introduction to a calculus of communicating systems. Technical Report ECS-LFCS-87-22, Dept. of Computer Science, Edinburgh University.
Walker, D. (1989). Automated analysis of mutual exclusion algorithms using CCS. Formal Aspects of Computing, 1, 273–292.
Walker, D. (1990). Bisimulations and divergence. Information and Computation, 85, 202–241.
Winskel, G. (1988). A category of labelled Petri Nets and compositional proof system. Procs 3rd IEEE Symposium on Logic in Computer Science, 142–153.
Wolper, P. (1983). Temporal logic can be more expressive. Information and Control, 56, 72–99.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Stirling, C. (1996). Modal and temporal logics for processes. In: Moller, F., Birtwistle, G. (eds) Logics for Concurrency. Lecture Notes in Computer Science, vol 1043. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60915-6_5
Download citation
DOI: https://doi.org/10.1007/3-540-60915-6_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60915-5
Online ISBN: 978-3-540-49675-5
eBook Packages: Springer Book Archive