Theoretical Computer Science, Volume 13

Volume 13, 1981

• William W. Wadge: An Extensional Treatment of Dataflow Deadlock. 3-15 BibTeX
• Nancy A. Lynch, Michael J. Fischer: On Describing the Behavior and Implementation of Distributed Systems. 17-43 BibTeX
• Amir Pnueli: The Temporal Semantics of Concurrent Programs. 45-60 BibTeX
• Andrea Maggiolo-Schettini, Horst Wedde, Józef Winkowski: Modeling a Solution for a Control Problem in Distributed Systems by Restrictions. 61-83 BibTeX
• Mogens Nielsen, Gordon D. Plotkin, Glynn Winskel: Petri Nets, Event Structures and Domains, Part I. 85-108 BibTeX
• Hartmann J. Genrich, Kurt Lautenbach: System Modelling with High-Level Petri Nets. 109-136 BibTeX
• Howard Straubing: A Generalization of the Schützenberger Product of Finite Monoids. 137-150 BibTeX
• Joseph E. Stoy: The Congruence of two Programming Language Definitions. 151-174 BibTeX
• David Harel: On the Total Correctness of Nondeterministic Programs. 175-192 BibTeX
• Jean H. Gallier: Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness I. 193-223 BibTeX
• Warren D. Goldfarb: The Undecidability of the Second-Order Unification Problem. 225-230 BibTeX
• Wolfgang Thomas: Remark on the Star-Height-Problem. 231-237 BibTeX
• Jean H. Gallier: Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness II. 239-270 BibTeX
• Erwin Engeler: Generalized Galois Theory and its Application to Complexity. 271-293 BibTeX
• Eitan M. Gurari, Oscar H. Ibarra: The Complexity of the Equivalence Problem for two Characterizations of Presburger Sets. 295-314 BibTeX
• Friedhelm Meyer auf der Heide: A Comparison of two Variations of a Pebble Game on Graphs. 315-322 BibTeX
• Ernst L. Leiss: Succint Representation of Regular Languages by Boolean Automata. 323-330 BibTeX
• Zvi Galil, Joel I. Seiferas: Linear-Time String-Matching Using only a Fixed Number of Local Storage Locations. 331-336 BibTeX