Process algebra with recursive operations
From MaRDI portal
Recommendations
Cited in
(21)- A note on an expressiveness hierarchy for multi-exit iteration
- Process algebra with action dependencies
- Adding recursive constructs to bialgebraic semantics
- Branching time and orthogonal bisimulation equivalence
- Formal enforcement of security policies on concurrent systems
- Register-machine based processes
- Knowledge and Games in Modal Semirings
- Reactive Turing machines
- scientific article; zbMATH DE number 1487746 (Why is no real title available?)
- scientific article; zbMATH DE number 7319030 (Why is no real title available?)
- scientific article; zbMATH DE number 7080198 (Why is no real title available?)
- Exploring type-level bisimilarity towards more expressive multiparty session types
- Using Hoare logic in a process algebra setting
- Complete axiomatization for divergent-sensitive bisimulations in basic process algebra with prefix iteration
- Domain Axioms for a Family of Near-Semirings
- Non-regular iterators in process algebra
- Underspecification for a simple process algebra of recursive processes.
- An algebraic theory of nondeterministic finite automata
- Sequential value passing yields a Kleene theorem for processes
- Recursive process definitions with the state operator
- Revisiting sequential composition in process calculi
This page was built for publication: Process algebra with recursive operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760242)
