Compositional reachability analysis using process algebra

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	ACW90	S. Aggarwal , C. Courcoubetis , P. Wolper, Adding liveness properties to coupled finite-state machines, ACM Transactions on Programming Languages and Systems (TOPLAS), v.12 n.2, p.303-339, April 1990 [doi>10.1145/78942.78948]
	Apt83	Krzysztof R. Apt, A Static Analysis of CSP Programs, Proceedings of the Carnegie Mellon Workshop on Logic of Programs, p.1-17, June 06-08, 1983
	BCM+90	J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking: 1020 states and beyond. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, June 1990.
	BHR84	S. D. Brookes , C. A. R. Hoare , A. W. Roscoe, A Theory of Communicating Sequential Processes, Journal of the ACM (JACM), v.31 n.3, p.560-599, July 1984 [doi>10.1145/828.833]
	BK84	J. A. Bergstra and J. W. Klop. Process algebra for synchronous communication. lnjormation and Control, 60:109-137, 1984.
	Bri86	Ed Brinksma, A tutorial on LOTOS, Proceedings of the IFIP WG6.1 Fifth International Conference on Protocol Specification, Testing and Verification V, p.171-194, June 10-13, 1985
	Bro83	Stephen D. Brookes, On the Relationship of CCS and CSP, Proceedings of the 10th Colloquium on Automata, Languages and Programming, p.83-96, July 18-22, 1983
	BSW69	K. A. Bartlett , R. A. Scantlebury , P. T. Wilkinson, A note on reliable full-duplex transmission over half-duplex links, Communications of the ACM, v.12 n.5, p.260-261, May 1969 [doi>10.1145/362946.362970]
	BvG87	J. C. M. Baeten , R. J. van Glabbeek, Another look at abstraction in process algebra, 14th International Colloquium on Automata, languages and programming, p.84-94, July 1987, Karlsruhe, Germany
	CES86	E. M. Clarke , E. A. Emerson , A. P. Sistla, Automatic verification of finite-state concurrent systems using temporal logic specifications, ACM Transactions on Programming Languages and Systems (TOPLAS), v.8 n.2, p.244-263, April 1986 [doi>10.1145/5397.5399]
	CLM89	E. M. Clarke, D. E. Long, and L. McMillan. Compositional model checking. Technical Report CMU-CS-89-145, Carnegie-Mellon University, School of Computer Science, Pittsburgh, PA 15213, April 1989.
	CPS90	Rance Cleaveland , Joachim Parrow , Bernhard Steffen, A Semantics Based Verification Tool for Finite State Systems, Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX, p.287-302, June 06-09, 1989
	CPS91	R. Cleaveland , J. Parrow , B. Steffen, The concurrency workbench, Proceedings of the international workshop on Automatic verification methods for finite state systems, p.24-37, February 1990, Grenoble, France
	CSF89	V. Carchiolo , A. Di Stefano , A. Faro , G. Pappalardo, ECCS and LIPS: two languages for OSI systems specification and verification, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.2, p.284-329, April 1989 [doi>10.1145/63264.63402]
	Hen88	Matthew Hennessy, Algebraic theory of processes, MIT Press, Cambridge, MA, 1988
	Hoa85	Charles Anthony Richard Hoare. Communicating Sequential Processes. Prentice-Hall, London, 1985.
	KS90	Paris C. Kanellakis , Scott A. Smolka, CCS expressions finite state processes, and three problems of equivalence, Information and Computation, v.86 n.1, p.43-68, May 1990 [doi>10.1016/0890-5401(90)90025-D]
	Lad79	Richard E. Ladner, The complexity of problems in systems of communicating sequential processes (Extended Abstract), Proceedings of the eleventh annual ACM symposium on Theory of computing, p.214-223, April 30-May 02, 1979, Atlanta, Georgia, United States [doi>10.1145/800135.804415]
	LC89	Douglas L. Long , Lori A. Clarke, Task interaction graphs for concurrency analysis, Proceedings of the 11th international conference on Software engineering, p.44-52, May 1989, Pittsburgh, Pennsylvania, United States [doi>10.1145/74587.74592]
	LM87	K. G. Larsen , R. Milner, Verifying a protocol using relativized bisimulation, 14th International Colloquium on Automata, languages and programming, p.126-135, July 1987, Karlsruhe, Germany
	LS90	Leo Yuhsiang Liu , R. K. Shyamasundar, Static Analysis of Real-Time Distributed Systems, IEEE Transactions on Software Engineering, v.16 n.4, p.373-388, April 1990 [doi>10.1109/32.54290]
	Mil80	R. Milner, A Calculus of Communicating Systems, Springer-Verlag New York, Inc., Secaucus, NJ, 1982
	Mil89	R. Milner, Communication and concurrency, Prentice-Hall, Inc., Upper Saddle River, NJ, 1989
	MM90	José Meseguer , Ugo Montanari, Petri nets are moniods, Information and Computation, v.88 n.2, p.105-155, Oct. 1990 [doi>10.1016/0890-5401(90)90013-8]
	MR87	E. Timothy Morgan , Rami R. Razouk, Interactive state-space analysis of concurrent systems, IEEE Transactions on Software Engineering, v.13 n.10, p.1080-1091, October 1, 1987 [doi>10.1109/TSE.1987.232850]
	MZGT85	D. Mandrioli , R. Zicari , C. Ghezzi , F. Tisato, Modeling the ADA task system by Petri nets, Computer Languages, v.10 n.1, p.43-61, 1985 [doi>10.1016/0096-0551(85)90010-4]
	Pet81	James Lyle Peterson, Petri Net Theory and the Modeling of Systems, Prentice Hall PTR, Upper Saddle River, NJ, 1981
	SMBT90	S. M. Shatz , K. Mai , C. Black , S. Tu, Design and Implementation of a Petri Net Based Toolkit for Ada Tasking Analysis, IEEE Transactions on Parallel and Distributed Systems, v.1 n.4, p.424-441, October 1990 [doi>10.1109/71.80172]
	Smo84	Scott Allen Smolka, Analysis of communicating finite-state processes, 1984
	SMS82	Richard L. Schwartz and P. Michael Melliar- Smith. From state machines to temporal logic: Specification methods for protocol standards. IEEE Transactions on Communications, COM- 30(12):2486-2496, December 1982.
	Sun81	Carl A. Sunshine, editor. Communication Protocol Modeling. Artech House, Dedham, MA, 1981.
	Tay83a	Richard N. Taylor. Complexity of analyzing the synchronization structure of concurrent programs.Acta Informatica, 19:57-84, 1983.
	Tay83b	Richard N. Taylor, A general-purpose algorithm for analyzing concurrent programs, Communications of the ACM, v.26 n.5, p.361-376, May 1983 [doi>10.1145/69586.69587]
	Win87	Glynn Winskel, Petr nets, algebras, morphisms, and compositionality, Information and Computation, v.72 n.3, p.197-238, March 1987 [doi>10.1016/0890-5401(87)90032-0]
	Wol86	Pierre Wolper, Expressing interesting properties of programs in propositional temporal logic, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.184-193, January 01, 1986, St. Petersburg Beach, Florida [doi>10.1145/512644.512661]
	YTFB89	M. Young , R. Taylor , K. Forester , D. Brodbeck, Integrated concurrency analysis in a software development enviornment, Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification, p.200-209, December 13-15, 1989, Key West, Florida, United States