A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
A Further Step towards a Theory of Regular MSC Languages
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Emptiness Is Decidable for Asynchronous Cellular Machines
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Pomsets for local trace languages
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
Regular sets of infinite message sequence charts
Information and Computation
Hi-index | 0.00 |