The following pages link to Process Algebra (Q3999164):
Displayed 50 items.
- Near-ring congruences on seminearrings (Q2153504) (← links)
- Refinement-oriented probability for CSP (Q2365393) (← links)
- Computable processes and bisimulation equivalence (Q2365394) (← links)
- Continuity controlled hybrid automata (Q2368692) (← links)
- Linearization of hybrid processes (Q2368694) (← links)
- Syntax and consistent equation semantics of hybrid Chi (Q2368698) (← links)
- Non-bisimulation-based Markovian behavioral equivalences (Q2373649) (← links)
- Operational semantics for Petri net components (Q2373704) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- Denotational semantics for thread algebra (Q2469153) (← links)
- Symmetric electoral systems for ambient calculi (Q2475806) (← links)
- Simulating Turing machines on Maurer machines (Q2480963) (← links)
- On the expressiveness of higher dimensional automata (Q2491631) (← links)
- Branching bisimulation for probabilistic systems: characteristics and decidability (Q2491633) (← links)
- Splitting bisimulations and retrospective conditions (Q2500474) (← links)
- Hierarchical control of discrete-event systems (Q2563779) (← links)
- Synchronized shuffles (Q2566012) (← links)
- Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal (Q2568979) (← links)
- A theory of stochastic systems. II: Process algebra (Q2575855) (← links)
- Decidable first-order transition logics for PA-processes (Q2575856) (← links)
- Axiomatising divergence (Q2581532) (← links)
- Reversing algebraic process calculi (Q2643334) (← links)
- Reactive bisimulation semantics for a process algebra with timeouts (Q2687033) (← links)
- Algebra of timed frames (Q2710790) (← links)
- The Shuffle Product: New Research Directions (Q2799163) (← links)
- Structural Operational Semantics with First-Order Logic (Q2810690) (← links)
- Automating Soundness Proofs (Q2810691) (← links)
- (Q2851048) (← links)
- Notes on Generative Probabilistic Bisimulation (Q2866317) (← links)
- Parallel Processes with Implicit Computational Capital (Q2870191) (← links)
- Modal logic and the approximation induction principle (Q2883116) (← links)
- Proving the validity of equations in GSOS languages using rule-matching bisimilarity (Q2883120) (← links)
- A logic for extensional protocols (Q2901223) (← links)
- Process Algebra and Model Checking (Q3176390) (← links)
- A Calculus for Local Reversibility (Q3186582) (← links)
- SC-EXPRESSIONS IN OBJECT-ORIENTED LANGUAGES (Q3401492) (← links)
- A Context-Free Process as a Pushdown Automaton (Q3541013) (← links)
- A Rule Format for Associativity (Q3541037) (← links)
- On the operating unit size of load/store architectures (Q3564342) (← links)
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems (Q3599065) (← links)
- PRISMA: A Mobile Calculus with Parametric Synchronization (Q3608457) (← links)
- A Look Around the Corner: The Pi-Calculus (Q3623819) (← links)
- Bisimulations and predicate logic (Q4314681) (← links)
- Network algebra for asynchronous dataflow<sup>∗</sup> (Q4375420) (← links)
- Automating the refinement of specifications for distributed systems via syntactic transformations (Q4392352) (← links)
- Distributed processes and location failures (Q4571978) (← links)
- Solving recursive net equations (Q4645215) (← links)
- Strong types for coordinating active objects (Q4790922) (← links)
- Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination (Q4917024) (← links)
- Complexity of Weak Bisimilarity and Regularity for BPA and BPP (Q4917028) (← links)