The following pages link to Process Algebra (Q3999164):
Displayed 50 items.
- Formal verification of a leader election protocol in process algebra (Q1391796) (← links)
- Two finite specifications of a queue (Q1391797) (← links)
- Revisiting timing in process algebra. (Q1394990) (← links)
- Analysis of a distributed system for lifting trucks. (Q1400154) (← links)
- A fully abstract model for the \(\pi\)-calculus. (Q1400720) (← links)
- The complexity of bisimilarity-checking for one-counter processes. (Q1401395) (← links)
- Finite axiom systems for testing preorder and De Simone process languages (Q1575273) (← links)
- Effective decomposability of sequential behaviours (Q1575536) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
- Language preorder as a precongruence (Q1575654) (← links)
- A hidden agenda (Q1575735) (← links)
- Bisimulation indexes and their applications (Q1606119) (← links)
- Process algebra and conditional composition (Q1607116) (← links)
- Impossible futures and determinism (Q1607117) (← links)
- Equivalence of recursive specifications in process algebra (Q1607118) (← links)
- A formal approach to object-oriented software engineering (Q1608926) (← links)
- Approximate analyzing of labeled transition systems (Q1667079) (← links)
- Hybrid process algebra (Q1763160) (← links)
- CCS with Hennessy's merge has no finite-equational axiomatization (Q1763725) (← links)
- A brief history of process algebra (Q1781995) (← links)
- Process algebra for hybrid systems (Q1781998) (← links)
- On the usability of process algebra: An architectural view (Q1781999) (← links)
- An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation (Q1785863) (← links)
- Modular specification of process algebras (Q1802074) (← links)
- Algebra and theory of order-deterministic pomsets (Q1815430) (← links)
- Action transducers and timed automata (Q1816917) (← links)
- Discrete time generative-reactive probabilistic processes with different advancing speeds (Q1853593) (← links)
- Bisimilarity of open terms. (Q1854331) (← links)
- Decoding choice encodings (Q1854385) (← links)
- Vertical implementation (Q1854462) (← links)
- Simulation preorder over simple process algebras (Q1854513) (← links)
- The box algebra = Petri nets + process expressions (Q1854558) (← links)
- Ordered SOS process languages for branching and eager bisimulations (Q1854563) (← links)
- On the expressiveness of choice quantification (Q1874242) (← links)
- Axiomatizing GSOS with termination (Q1878716) (← links)
- Rule formats for compositional non-interference properties (Q1878717) (← links)
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation (Q1878718) (← links)
- Branching time and orthogonal bisimulation equivalence (Q1884905) (← links)
- Precise interprocedural dependence analysis of parallel programs (Q1884938) (← links)
- Shuffle on positive varieties of languages (Q1884959) (← links)
- Discrete time process algebra (Q1914041) (← links)
- Categorical shape theory as a formal language for pattern recognition? (Q1924765) (← links)
- Timing and causality in process algebra (Q1924998) (← links)
- A specification structure for deadlock-freedom of synchronous processes (Q1960536) (← links)
- Models of nondeterministic regular expressions (Q1970200) (← links)
- Rooted branching bisimulation as a congruence (Q1975965) (← links)
- Process algebra with strategic interleaving (Q2000000) (← links)
- Probabilistic divide \& congruence: branching bisimilarity (Q2007735) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
- Matching logic explained (Q2035650) (← links)