Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Information and Computation
Compositionality through an operational semantics of contexts
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Towards a new algebraic foundation of flowchart scheme theory
Fundamenta Informaticae
Classes of finite relations as initial abstract data types I
Discrete Mathematics
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Selected papers of the Second Workshop on Concurrency and compositionality
Selected papers of the 3rd workshop on Concurrency and compositionality
Structured operational semantics and bisimulation as a congruence
Information and Computation
A calculus of mobile processes, II
Information and Computation
Refinement of actions in event structures and causal trees
MFCS '90 Selected papers of the 15th international symposium on Mathematical foundations of computer science
Flow models of distributed computations: three equivalent semantics for CCS
Information and Computation
Journal of the ACM (JACM)
Comparing locality and causality based equivalences
Acta Informatica
Location equivalence in a parametric setting
Theoretical Computer Science
Interaction categories and the foundations of typed concurrent programming
Proceedings of the NATO Advanced Study Institute on Deductive program design
Information and Computation
A calculus for cryptographic protocols
Information and Computation
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
Zero-safe nets: comparing the collective and individual token approaches
Information and Computation - Special issue on EXPRESS 1997
Tile formats for located and mobile systems
Information and Computation - Special issue on EXPRESS 1997
Information and Computation - Special issue on EXPRESS 1997
Information and Computation - Special issue on EXPRESS 1997
Proof, language, and interaction
Network Algebra
Algebraic Semantics of Imperative Programs
Algebraic Semantics of Imperative Programs
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
Executable Tile Specifications for Process Calculi
FASE '99 Proceedings of the Second Internationsl Conference on Fundamental Approaches to Software Engineering
Observational Equivalence for Synchronized Graph Rewriting with Mobility
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
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
Span(Graph): A Categorial Algebra of Transition Systems
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
A 2-Categorical Presentation of Term Graph Rewriting
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Cartesian Closed Double Categories, Their Lambda-Notation, and the Pi-Calculus
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Mobile Petri Nets
Process and Term Tile Logic
Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
Mathematical Structures in Computer Science
Elementary structures in process theory (1): Sets with renaming
Mathematical Structures in Computer Science
Premonoidal categories and notions of computation
Mathematical Structures in Computer Science
Observational congruences for dynamically reconfigurable tile systems
Theoretical Computer Science - Process algebra
Linear-Ordered Graph Grammars: Applications to Distributed Systems Design
Concurrency, Graphs and Models
Models of Computation: A Tribute to Ugo Montanari's Vision
Concurrency, Graphs and Models
A connector algebra for P/T nets interactions
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Connector algebras, petri nets, and BIP
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
| Hi-index | 5.23 |
We propose a metatheoretic approach to the definition of operational and abstract concurrent semantics for systems where name handling is a key issue. The main ingredients of our framework are connectors and tile logic. The former allow for the modeling of various kinds of graph-like and term-like structures, which can be useful in representing system distribution and causal histories. The latter is used to combine the use of connectors in space and in time (i.e., according to configurations and computations). As a detailed case study, we show how to define a concurrent operational semantics and causal weak bisimilarity for a flavor of basic parallel processes.