Petri nets: an introduction
Communicating sequential processes
Communicating sequential processes
Towards a new algebraic foundation of flowchart scheme theory
Fundamenta Informaticae
Information and Computation
Transition systems with algebraic structure as models of computations
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
Notions of computation and monads
Information and Computation
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
An algebraic semantics for structured transition systems and its application to logic programs
Theoretical Computer Science - Selected papers of the 7th Annual Symposium on theoretical aspects of computer science (STACS '90) Rouen, France, February 1990
A calculus of mobile processes, I
Information and Computation
Handbook of logic in computer science (vol. 2)
Term graph rewriting: theory and practice
Term graph rewriting: theory and practice
A theory of higher order communicating systems
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
Proof, language, and interaction
Formal verification of parallel programs
Communications of the ACM
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Executable Tile Specifications for Process Calculi
FASE '99 Proceedings of the Second Internationsl Conference on Fundamental Approaches to Software Engineering
Types and Models for Higher-Order Action Calculi
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
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
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
Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
On Asynchronous Communication Semantics
ECOOP '91 Proceedings of the Workshop on Object-Based Concurrent Computing
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Relating Two Categorial Models of Term Rewriting
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Equational Reasoning with Two-Dimensional Diagrams
Term Rewriting, French Spring School of Theoretical Computer Science, Advanced Course
Axiomatizing Permutation Equivalence in the Lambda-Calculus
Proceedings of the Third International Conference on Algebraic and Logic Programming
CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
From Action Calculi to Linear Logic
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
A 2-Categorical Presentation of Term Graph Rewriting
CTCS '97 Proceedings of the 7th International Conference on Category Theory and 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
Process and Term Tile Logic
Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
Mathematical Structures in Computer Science
Categorical logic of names and abstraction in action calculi
Mathematical Structures in Computer Science
Premonoidal categories and notions of computation
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Dynamic connectors for concurrency
Theoretical Computer Science
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Linear Ordered Graph Grammars and Their Algebraic Foundations
ICGT '02 Proceedings of the First International Conference on Graph Transformation
A General Framework for Types in Graph Rewriting
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Observational congruences for dynamically reconfigurable tile systems
Theoretical Computer Science - Process algebra
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
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
A Rewriting Logic Approach to Operational Semantics (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Graph-Based Design and Analysis of Dynamic Software Architectures
Concurrency, Graphs and Models
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
Deriving bisimulation congruences with borrowed contexts
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Connector algebras, petri nets, and BIP
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
| Hi-index | 0.00 |
The large diffusion of concurrent and distributed systems has spawned in recent years a variety of new formalisms, equipped with features for supporting an easy specification of such systems. The aim of our paper is to analyze three proposals, namely rewriting logic, action calculi and tile logic, chosen among those formalisms designed for the description of rule-based systems. For each of these logics we first try to understand their foundations, then we briefly sketch some applications. The overall goal of our work is to find out a common layout where these logics can be recast, thus allowing for a comparison and an evaluation of their specific features.