Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
On flowchart theories: part II. The nondeterministic case
Theoretical Computer Science
Information and Computation
Towards a new algebraic foundation of flowchart scheme theory
Fundamenta Informaticae
Classes of finite relations as initial abstract data types I
Discrete Mathematics
An axiomatization of the algebra of Petri net concatenable processes
Theoretical Computer Science
Equational term graph rewriting
Fundamenta Informaticae - Special issue on graph transformations
Interaction categories and the foundations of typed concurrent programming
Proceedings of the NATO Advanced Study Institute on Deductive program design
Tile formats for located and mobile systems
Information and Computation - Special issue on EXPRESS 1997
Proof, language, and interaction
Network Algebra
Algebraic Semantics of Imperative Programs
Algebraic Semantics of Imperative Programs
Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Mapping tile logic into rewriting logic
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
An inductive view of graph transformation
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Representation Theorems for Petri Nets
Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday
Span(Graph): A Categorial Algebra of Transition Systems
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Axioms for Contextual Net Processes
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A 2-Categorical Presentation of Term Graph Rewriting
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
Process and Term Tile Logic
Premonoidal categories and notions of computation
Mathematical Structures in Computer Science
Dynamic connectors for concurrency
Theoretical Computer Science
Transition systems, link graphs and Petri nets
Mathematical Structures in Computer Science
A basic algebra of stateless connectors
Theoretical Computer Science - Algebra and coalgebra in computer science
Graph rewriting for the π-calculus
Mathematical Structures in Computer Science
Models of Computation: A Tribute to Ugo Montanari's Vision
Concurrency, Graphs and Models
Calculating Colimits Compositionally
Concurrency, Graphs and Models
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
A Decentralized Implementation of Mobile Ambients
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
An Observational Model for Spatial Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Graphical encoding of a spatial logic for the π-calculus
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
On GS-monoidal theories for graphs with nesting
Graph transformations and model-driven engineering
A connector algebra for P/T nets interactions
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Graph processes with fusions: concurrency by colimits, again
Formal Methods in Software and Systems Modeling
Complete axioms for stateless connectors
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Connector algebras, petri nets, and BIP
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
| Hi-index | 5.23 |
Recent years have seen a growing interest towards algebraic structures that are able to express formalisms different from the standard, tree-like presentation of terms. Many of these approaches reveal a specific interest towards the application to the 'distributed and concurrent systems' field, but an exhaustive comparison between them is sometimes difficult, because their presentations can be quite dissimilar. This work is a first step towards a unified view: Focusing on the primitive ingredients of distributed spaces (namely interfaces, links and basic modules), we introduce a general schema for describing a normal form presentation of many algebraic formalisms, and show that those normal forms can be thought of as arrows of suitable monoidal categories.