Dynamic connectors for concurrency
From MaRDI portal
Recommendations
Cites work
- A 2-categorical presentation of term graph rewriting
- A calculus for cryptographic protocols: The spi calculus
- A calculus of mobile agents
- A calculus of mobile processes. II
- A theory of processes with localities
- Algebra of communicating processes with abstraction
- An algebraic presentation of term graphs, via gs-monoidal categories
- Bicategories of processes
- Bicategories of spans and relations
- Bisimilarity congruences for open terms and term graphs via tile logic
- Bisimilarity of open terms.
- Bisimulation can't be traced
- CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification
- Calculi for interaction
- Cartesian bicategories. I
- Categories of partial maps
- Catégories structurées
- Classes of finite relations as initial abstract data types. I
- Closed action calculi
- Coalgebras and cartesian categories
- Comparing locality and causality based equivalences
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
- Compositional SOS and beyond: A coalgebraic view of open systems
- Compositionality through and operational semantics of contexts
- Conditional rewriting logic as a unified model of concurrency
- Configuration structures, event structures and Petri nets
- Elementary structures in process theory (1): Sets with renaming
- Flow models of distributed computations: Three equivalent semantics for CCS
- Functorial semantics for multi-algebras
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- High-level Petri nets as type theories in the join calculus
- Higher-level synchronising devices in Meije-SCCS
- scientific article; zbMATH DE number 4157896 (Why is no real title available?)
- scientific article; zbMATH DE number 3773853 (Why is no real title available?)
- scientific article; zbMATH DE number 3510514 (Why is no real title available?)
- scientific article; zbMATH DE number 1231623 (Why is no real title available?)
- scientific article; zbMATH DE number 1497812 (Why is no real title available?)
- scientific article; zbMATH DE number 3329974 (Why is no real title available?)
- Interaction combinators
- LEAN: An intermediate language based on graph rewriting
- Location equivalence in a parametric setting
- Mapping tile logic into rewriting logic
- Membership algebra as a logical framework for equational specification
- Mobile ambients
- Mobile Petri nets
- Network algebra
- Normal forms for algebras of connections.
- Normal forms for partitions and relations
- Observational equivalence for synchronized graph rewriting with mobility
- Observing localities
- Open ended systems, dynamic bisimulation and tile logic
- Premonoidal categories and notions of computation
- Process rewrite systems.
- Proved trees
- Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi
- Refinement of actions in event structures and causal trees
- Span(Graph): A categorical algebra of transition systems
- Structured operational semantics and bisimulation as a congruence
- Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
- The chemical abstract machine
- The regular viewpoint on PA-processes
- Tile formats for located and mobile systems.
- Zero-safe nets: Comparing the collective and individual token approaches.
Cited in
(6)- Observational congruences for dynamically reconfigurable tile systems
- Revisiting causality, coalgebraically
- Tiling transactions in rewriting logic
- A connector algebra for P/T nets interactions
- Linear-Ordered Graph Grammars: Applications to Distributed Systems Design
- Models of Computation: A Tribute to Ugo Montanari’s Vision
This page was built for publication: Dynamic connectors for concurrency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603689)