Dynamic connectors for concurrency
Theoretical Computer Science
Comparing logics for rewriting: rewriting logic, action calculi and tile logic
Theoretical Computer Science - Rewriting logic and its applications
Normal forms for algebras of connections
Theoretical Computer Science
Normal Forms for Partitions and Relations
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
A Formalization of the IWIM Model
COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
Categorical foundations for randomly timed automata
Theoretical Computer Science
Minimisation and minimal realisation in Span(Graph)
Mathematical Structures in Computer Science
Calculating Colimits Compositionally
Concurrency, Graphs and Models
A Note on an Old-Fashioned Algebra for (Disconnected) Graphs
Electronic Notes in Theoretical Computer Science (ENTCS)
Compositional Minimization in Span(Graph): Some Examples
Electronic Notes in Theoretical Computer Science (ENTCS)
Timing in the Cospan-Span Model
Electronic Notes in Theoretical Computer Science (ENTCS)
A finite complete set of equations generating graphs
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Representations of Petri net interactions
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
An Algebra of Automata That Includes Both Classical and Quantum Entities
Electronic Notes in Theoretical Computer Science (ENTCS)
Connector algebras, petri nets, and BIP
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
| Hi-index | 0.01 |