On automatic verification of SLIDE descriptions

1 Acknowledgements 2

[1]  Jan van Leeuwen A partial solution to the reachability-problem for vector-addition systems , 1974, STOC '74.

[2]  C. H. West,et al.  General technique for communications protocol validation , 1978 .

[3]  Robert Chia-Hua Chen Bus communications systems. , 1974 .

[4]  C. G. Bell,et al.  Computer engineering: A DEC view of hardware systems design , 1978 .

[5]  B. O. Nash Reachability Problems in Vector Addition Systems , 1973 .

[6]  Michel Hack,et al.  The Recursive Equivalence of the Reachability Problem and the Liveness Problem for Petri Nets and Vector Addition Systems , 1974, SWAT.

[7]  William E. Burr,et al.  A Bus System for the Military Computer Family , 1979, Computer.

[8]  L. Cooprider Petri nets and the representation of standard synchronizations , 1976 .

[9]  Sten F. Andler,et al.  Predicate path expressions , 1979, POPL.

[10]  Daniel P. Siewiorek,et al.  The CMU Design Automation System - An Example of Automated Data Path Design , 1979, 16th Design Automation Conference.

[11]  Alice C. Parker,et al.  Slide: An I/O Hardware Descriptive Language , 1981, IEEE Transactions on Computers.

[12]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[13]  Sten Fredrik Andler,et al.  Predicate path expressions: a high-level synchronization mechanism , 1979 .

[14]  A. Nico Habermann,et al.  Prevention of system deadlocks , 1969, CACM.

[15]  C. A. Petri Fundamentals of a Theory of Asynchronous Information Flow , 1962, IFIP Congress.