A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Fixed points in free process algebras: Part I
Theoretical Computer Science
A complete axiomatisation for observational congruence of finite-state behaviours
Information and Computation
Information and Computation
Process algebra
Concurrent regular expressions and their relationship to Petri nets
Theoretical Computer Science
A calculus of mobile processes, II
Information and Computation
Iteration theories: the equational logic of iterative processes
Iteration theories: the equational logic of iterative processes
A theory of communicating processes with value passing
Information and Computation
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
Two Complete Axiom Systems for the Algebra of Regular Events
Journal of the ACM (JACM)
The regular viewpoint on PA-processes
Theoretical Computer Science
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Automata, Languages, and Machines
Automata, Languages, and Machines
The Book of Traces
Handbook of Process Algebra
ACM Transactions on Computational Logic (TOCL)
Specification and Analysis of Concurrent Systems: The COSY Approach
Specification and Analysis of Concurrent Systems: The COSY Approach
Petri Net Models for Algebraic Theories of Concurrency
Proceedings of the Parallel Architectures and Languages Europe, Volume I
Degrees of Non-Determinism and Concurrency: A Petri Net View
Proceedings of the Fourth Conference on Foundations of Software Technology and Theoretical Computer Science
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
The specification of process synchronization by path expressions
Operating Systems, Proceedings of an International Symposium
Regular Event Structures and Finite Petri Nets: The Conflict-Free Case
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Keeping track of the latest gossip in a distributed system
Distributed Computing
Regular Expressions in Process Algebra
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Product Automata and Process Algebra
SEFM '06 Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods
Kleene theorems for product systems
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Hi-index | 0.00 |
While different algebraic structures have been proposed for the treatment of concurrency, finding solutions for equations over these structures needs to be worked on further. This article is a survey of process algebra from a very narrow viewpoint, that of finite automata and regular languages. What have automata theorists learnt from process algebra about finite state concurrency? The title is stolen from [31]. There is a recent survey article [7] on finite state processes which deals extensively with rational expressions. The aim of the present article is different. How do standard notions such as Petri nets, Mazurkiewicz trace languages and Zielonka automata fare in the world of process algebra? This article has no original results, and the attempt is to raise questions rather than answer them.