Minimal Transition Systems for History-Preserving Bisimulation

Causal computing

ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research

Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement

ACM Transactions on Computational Logic (TOCL)

On Plain and Hereditary History-Preserving Bisimulation

MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science

Bisimulation Equivalences for Graph Grammars

Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]

Bisimulation equivalences for graph grammars

Formal and natural computing

Structured coalgebras and minimal HD-automata for the π-calculus

Theoretical Computer Science - Mathematical foundations of computer science 2000

Causality versus true-concurrency

Theoretical Computer Science

Symmetries, local names and dynamic (de)-allocation of names

Information and Computation

A logic for true concurrency

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory

Composition and decomposition in true-concurrency

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

Canonizable partial order generators

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications

History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps

Electronic Notes in Theoretical Computer Science (ENTCS)