Non-regular iterators in process algebra
From MaRDI portal
Recommendations
Cites work
- A complete equational axiomatization for MPA with string iteration
- A complete equational axiomatization for prefix iteration
- A complete inference system for a class of regular behaviours
- A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
- Algebra of communicating processes with abstraction
- An equational axiomatization for multi-exit iteration
- Axiomatising finite delay operators
- Axiomatizations for the perpetual loop in process algebra
- Axiomatizing flat iteration
- Axiomatizing prefix iteration with silent steps
- Branching time and abstraction in bisimulation semantics
- Calculi for synchrony and asynchrony
- Computable processes and bisimulation equivalence
- Decidability of bisimulation equivalence for process generating context-free languages
- Global renaming operators in concrete process algebra
- scientific article; zbMATH DE number 4011914 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 1189291 (Why is no real title available?)
- scientific article; zbMATH DE number 3744561 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1113857 (Why is no real title available?)
- scientific article; zbMATH DE number 1555176 (Why is no real title available?)
- scientific article; zbMATH DE number 883892 (Why is no real title available?)
- scientific article; zbMATH DE number 1412988 (Why is no real title available?)
- scientific article; zbMATH DE number 3894457 (Why is no real title available?)
- Nonaxiomatisability of equivalences over finite state processes
- On the consistency of Koomen's fair abstraction rule
- Process Algebra
- Process algebra for synchronous communication
- Process algebra with recursive operations
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- Top-down design and the algebra of communicating processes
- Two finite specifications of a queue
Cited in
(7)- Branching time and orthogonal bisimulation equivalence
- Process algebra with recursive operations
- Register-machine based processes
- Sequential composition in the presence of intermediate termination (extended abstract)
- The \(\pi\)-calculus is behaviourally complete and orbit-finitely executable
- Bounded stacks, bags and queues
- Execution architectures for program algebra
This page was built for publication: Non-regular iterators in process algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958616)