On oraclizable networks and Kahn's principle
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the relations computable by a class of concurrent automata
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Schedulers as abstract interpretations of higher-dimensional automata
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Relating conflict-free stable transition and event models via redex families
Theoretical Computer Science
Dihomotopy as a Tool in State Space Analysis
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Axiomatic Rewriting Theory VI Residual Theory Revisited
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
On Recognizable Languages in Divisibility Monoids
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Petri Nets, Configuration Structures and Higher Dimensional Automata
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Recognizable languages in divisibility monoids
Mathematical Structures in Computer Science
Geometry and concurrency: a user's guide
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Information Processing Letters
The conflict-free reduction geometry
Theoretical Computer Science
On the expressiveness of higher dimensional automata
Theoretical Computer Science - Expressiveness in concurrency
Algebraic topology and concurrency
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Erratum: Erratum to “On the expressiveness of higher dimensional automata”
Theoretical Computer Science
Correct-by-Construction Asynchronous Implementation of Modular Synchronous Specifications
Fundamenta Informaticae - The Fourth Special Issue on Applications of Concurrency to System Design (ACSD05)
Recognizable languages in divisibility monoids
Mathematical Structures in Computer Science
Decomposition Theorems for Bounded Persistent Petri Nets
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
On Trace-Expressible Behaviour of Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Information Processing Letters
Residuals in higher-order rewriting
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Stable computational semantics of conflict-free rewrite systems (partial orders with duplication)
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Mind the gap: Expanding communication options in decentralized discrete-event control
Automatica (Journal of IFAC)
On Trace-Expressible Behaviour of Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Correct-by-Construction Asynchronous Implementation of Modular Synchronous Specifications
Fundamenta Informaticae - The Fourth Special Issue on Applications of Concurrency to System Design (ACSD05)
Hi-index | 5.23 |