Nets of processes and data flow
Proceedings of the Fourth Annual Symposium on Logic in computer science
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Compositional proofs for networks of processes
Fundamenta Informaticae
Comparing the Church and Turing approaches: two prophetical messages
The universal Turing machine (2nd ed.)
On the power of compositional proofs for nets: relationships between completeness and modularity
Fundamenta Informaticae
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
On Nets, Algebras and Modularity
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
On universal classes of program schemas
Proceedings of the International Sympoisum on Theoretical Programming
Some reflections on the connection between computer science and the theory of algorithms
Proceedings on Algorithms in Modern Mathematics and Computer Science
From Finite Automata toward Hybrid Systems (Extended Abstract)
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
From Denotational to Operational and Axiomatic Semantics for ALGOL-like Languages: an Overview
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Nets of processes and data flow
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Origins and Metamorphoses of The Trinity: Logic, Nets, Automata
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
The semantics of local storage, or what makes the free-list free?(Preliminary Report)
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Understanding Basic Automata Theory in the Continuous Time Setting
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Synchronous Circuits over Continuous Time: Feedback Reliability and mpleteness
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
IEEE Annals of the History of Computing
| Hi-index | 0.00 |