Petri nets: an introduction
Communicating sequential processes
Communicating sequential processes
Modeling concurrency with partial orders
International Journal of Parallel Programming
Concurrent histories: a basis for observing distributed systems
Journal of Computer and System Sciences
Fixed points in free process algebras: Part I
Theoretical Computer Science
Termination, deadlock, and divergence
Journal of the ACM (JACM)
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
Handbook of logic in computer science (vol. 4)
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Automata, Languages, and Machines
Automata, Languages, and Machines
A Completeness Theorem fro Nondeterministic Kleene Algebras
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
Proceedings of the 9th Colloquium on Automata, Languages and Programming
NAPAW '92 Proceedings of the First North American Process Algebra Workshop
Fully Abstract Models for Nondeterministic Regular Expressions
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Enriched Categories for Local and Interaction Calculi
Category Theory and Computer Science
Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
Categories of asynchronous systems
Categories of asynchronous systems
Tree-functors, determinacy and bisimulations
Mathematical Structures in Computer Science
Spatial and temporal aspects in visual interaction
Journal of Visual Languages and Computing
Hi-index | 0.00 |
Given an automaton, its behaviour can be modelled as the sets of strings over an alphabet A that can be accepted from any of its states. When considering concurrent systems, we can see a concurrent agent as an automaton, where non-determinism derives from the fact that its states can offer a different behaviour at different moments in time. Non-deterministic computations between a pair of states can then no longer be described as a ‘set’ of strings in a free monoid. Consequently, between two states we will have a labelled structured set of computations, where the structure describes the possibility of two computations parting from each other while maintaining the same observable steps. In this paper, we shall consider different kinds of observation domains and related structured sets of computations. Structured sets of computations will be organised as a category of generalised trees built over a meet-semilattice monoid formalizing the observation domain. Theorems allowing us to introduce the usual concurrency operators in the models and relating different models will then be obtained by first considering ordinary functors (on and between the observation domains), and then lifting them to the categories of structured sets of computations.