A Complete Finite Prefix for Process Algebra
No abstract available.
Related papers
- Reachability Analysis of the Domain Name System POPL 2025
- A sound and complete abstraction for reasoning about parallel prefix sums POPL 2014
- Finiteness Conditions and Structural Construction of Automata for All Process Algebras CAV 1990
- Combinatory Representation of Mobile Processes POPL 1994
- An Equational Axiomatization of Dynamic Threads via Algebraic Effects: Presheaves on Finite Relations, Labelled Posets, and Parameterized Algebraic Theories POPL 2026
- Combinatory Formaulations of Concurrent Languages TOPLAS 1997
- A Formalism for Real-Time Concurrent Object-Oriented Computing OOPSLA 1992
- Compiler prototyping using formal semantics PLDI 1984