Samson Abramski, Domain Theory in Logical Form, LICS '87.
Luca Aceto, Rocco De Nicola and Alessandro Fantechi, A Testing Equivalence For Event Structures, in Mathematical Models for the Semantics of Parallelism, Springer LNCS 280, 1987, 1–20.Google Scholar
Howard Barringer, Using Temporal Logic In The Compositional Specification of Concurrent Systems, Tech. Rep. UMCS-86-10-1, October 1986, Dept. of Computer Science, Univ. of Manchester.
Gerard Boudol and Ilaria Castellani, Concurrency and Atomicity, 1987, Theoretical Computer Science 59, 1–2, 1988, pp. 25–84.Google Scholar
Boudol, G. and Castellani, I. Permutations of Transitions: An Event Structure Semantics for CCS and SCCS, LNCS 354, Springer, pp. 411–427.
M. C. Browne, E. M. Clarke and O. Grumberg, Characterizing Finite Kripke Structures in Propositional Temporal Logic, TCS.Vol.59, No
,2, July 1988, pp. 115–132Google Scholar
Manfred Broy, Process Semantics of Communicating Concurrent Programs, Tech. Rep. MIP-8602, Univ. Passau, Feb. 1986.
Ilaria Castellani, Bisimulation and Abstraction Homomorphisms, Journal of Computer and System Sciences, April/June 1987, vol. 34, No.2/3.
Ilaria Castellani and Mattew Hennessy, Distributed Bisimulations, Research Report 5/87, Computer Science Department, University of Sussex, July 1987. Also JACM, to appear.
E. M. Clarke, E. A. Emerson and A. P. Sistla, Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications, ACM Transactions on Programming Languages and Systems 8, 2(1986), 244–263.Google Scholar
Pierpaolo Degano, Rocco De Nicola and Ugo Montanari, Observational Equivalences for Concurrency Models, Proc. IFIP TC2 Workshop on Formal Description of Programming Concepts IV, North-Holland, 1987, M. Wirsing, Ed., 105–132
Pierpaolo Degano, Rocco De Nicola and Ugo Montanari, A Distributed Operational Semantics For CCS Based On Condition/Event Systems, Acta Informatica 26, pp.59–91 (1988).Google Scholar
Pierpaolo Degano, Rocco De Nicola and Ugo Montanari, On the Consistency of “Truly Concurrent” Operational and Denotational Semantics, Proc. 3rd Symp. on Logic in Computer Science, IEEE 1988, pp.133–141.
Pierpaolo Degano, Rocco De Nicola and Ugo Montanari, A partial Ordering Semantics For CCS. Technical Report, Dipartimento di Informatica di Pisa, TR-3/88. Also TCS, to appear.
Pierpaolo Degano, Roberto Gorrieri and Sergio Marchetti, An Exercise in Concurrency: A CSP Process as a Condition/Event System, in G. Rozenberg, Ed., Advances in Petri Net 1988, LNCS 340, Springer, pp.85–105.
Pierpaolo Degano and Ugo Montanari, Specification Languages For Distributed Systems, Tapsoft 1985, H. Ehrig et al., Eds., 29–51, Springer LNCS 185.
Pierpaolo Degano and Ugo Montanari, A Model For Distributed Systems Based On Graph Rewriting, Journal of the Association for Computing Machinery, Vol. 34, No. 2, April 1987, 411–449.Google Scholar
Pierpaolo Degano and Ugo Montanari, Concurrent Histories: A Basis for Observing Distributed Systems, Journal of Computer and System Sciences, April/June 1987, vol. 34, No.2/3, 422–461.Google Scholar
Diers, Y., Catégories Localisables, Thése de Doctorat d'Etat, Université Paris 6, 1977.
Michael P. Georgeff and Amy L. Lansky, Eds., Proc. 1986 Workshop on Reasoning about Actions and Plans, Morgan Kaufmann, 1987.
Goltz, U. and Reisig, W. The Non-sequential Behaviour of Petri Nets, Info. and Co.
, 125–147 (1983).Google Scholar
Roberto Gorrieri, Sergio Marchetti and Ugo Montanari, A2CCS: A Simple Extension Of CCS For Handling Atomic Actions, Proc. CAAP 1988, Springer LNCS 299, pp. 258–270.
Matthew Hennessy and Robin Milner, Algebraic Laws for Nondeterminism and Concurrency, Journal of ACM
(1985), pp. 137–161.Google Scholar
Shmuel Katz and Doron Peled, Interleaving Set Temporal Logic, 1987, submitted for publication. A preliminary version is in PODC '87.
Johnstone, P., A Syntactic Approach to Diers' Localizable Categories, Proc. Durham Conference on Applications of Sheaves 1977, Spriger Lecture Notes in Mathematics 153, 1979.
K. Lodaya and P. S. Thiagarajan, A Modal Logic For A Subclass Of Event Structures, 1987. A preliminary version is in ICALP '87.
Mazurkiewicz, A., Concurrent Program Schemas and Their Interpretation, Proc. Aarhus Workshop on Verification of Parallel Programs, 1977.
José Meseguer and Ugo Montanari, Petri Nets are Monoids: A New Algebraic Foundations for Net Theory, Proc. 3rd Symp. on Logic in Computer Science, IEEE 1988, pp. 155–164.
Ugo Montanari and Marcello Sgamma, On A Standard Representation Of Nondeterministic Behaviour, Proc. Colloquium On The Resolution Of Equations In Algebraic Structures, Lakeway, Texas, May 4–6, 1987, North-Holland, to appear.
Nielsen, M., Plotkin, G. and Winskel, G., Petri Nets, Event Structures and Domains, TCS 13 (1981), pp. 85–108.  Ernst-Rudiger Olderog, Operational Petri Net Semantics For CCSP, Advances in Petri Nets 1987, G. Rozenberg, Ed., 196–223, Springer LNCS 266.Google Scholar
Ernst-Rudiger Olderog, Operational Petri Net Semantics For CCSP, Advances in Petri Nets 1987, G. Rozenberg, Ed., 196–223, Springer LNCS 266.
Shlomit S. Pinter and Pierre Wolper, A Temporal Logic For Reasoning About Partially Ordered Computations, Proc Third Symp. on Principles of Distributed Computing, Vancouver, August 27–29, 1984, 28–37.
Gordon Plotkin, A Structural Approach to Operational Semantics, Technical Report DAIMI FN-19, Aarhus University, (Department of Computer Science, Aarhus, 1981).Google Scholar
Vaughn Pratt, Modelling Concurrency with Partial Orders, International Journal of Parallel Programming
, (1986) pp. 33–71.Google Scholar
Reisig, W. Towards a Temporal Logic for True Concurrency. Part I: Linear Time Propositional Logic. Arbeitspapiere der GMD 277, 1987.
Yohav Shoham, What is the Frame Problem?, in , pp. 83–99.
Stark, E. W., Concurrent Transition Systems, Tech. Rep., SUNY at Stony Brook, Computer Science Dept, June 1987.
Colin Stirling, A Proof-Theoretic characterization of Observational Equivalence, Theoretical Computer Science 39 (1985) 27–45.Google Scholar
Colin Stirling, Modal Logics for Communicating Systems, Theoretical Computer Science 49 (1987) 311–347.Google Scholar
Rob van Glabbeek and Frits Vaandrager, Petri Net Models For Algebraic Theories Of Concurrency, PARLE Conference 1987, J. W. de Bakker et al., Eds., Springer LNCS 259.
Moshe Y. Vardi, Verification of Concurrent Programs: The Automata-Theoretic Framework, Proc. Symp. on Logics in Computer Science, Ithaca, June 22–25, 1987, 167–176.
Glynn Winskel, Event structures, University of Cambridge Computer Laboratory, July 1986, Technical Report No.95. Also in Advances in Petri Nets 1986, LNCS 255, Springer, pp.325–392.
Glynn Winskel, Lectures on Models and Logic of MOS Circuits. Four invited lectures for the Marktoberdorf Summer School, July 1986. Published in the Springer NATO ASI Series, 1987.
Glynn Winskel, Petri Nets, Algebras, Morphisms and Compositionality, Info and Co., 1987, vol.72, 197–238.Google Scholar
Glynn Winskel, A Category of Labelled Petri Nets and Compositional Proof Systems, Proc. 3rd Symp. on Logic in Computer Science, IEEE 1988.
Zhang, Q., On Semantics-Directed Logic, PhD Thesis, University of Cambridge, in preparation, to be completed in 1989.