The following pages link to (Q3404131):
Displayed 50 items.
- Reactive Turing machines (Q393091) (← links)
- Repairing time-determinism in the process algebra for hybrid systems (Q442292) (← links)
- A ground-complete axiomatization of stateless bisimilarity over Linda (Q477631) (← links)
- Maximally permissive controlled system synthesis for non-determinism and modal logic (Q513185) (← links)
- Dynamic consistency in process algebra: from paradigm to ACP (Q541685) (← links)
- SOS rule formats for zero and unit elements (Q549170) (← links)
- Unguardedness mostly means many solutions (Q549175) (← links)
- The free process algebra generated by \(\delta \), \(\epsilon\) and \(\tau \) (Q549205) (← links)
- Branching bisimulation congruence for probabilistic systems (Q764289) (← links)
- Product line process theory (Q898612) (← links)
- Rule formats for distributivity (Q1758150) (← links)
- A logic for the stepwise development of reactive systems (Q1786564) (← links)
- Toward an algebraic theory of systems (Q1786609) (← links)
- Axiomatizing GSOS with termination (Q1878716) (← links)
- Probabilistic may/must testing: retaining probabilities by restricted schedulers (Q1941883) (← links)
- Formal modeling of evolving self-adaptive systems (Q1951611) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
- Bisimulation maps in presheaf categories (Q2133160) (← links)
- Axiomatizing recursion-free, regular monitors (Q2141297) (← links)
- On the axiomatisability of priority. III: Priority strikes again (Q2193294) (← links)
- Unique solutions of contractions, CCS, and their HOL formalisation (Q2216120) (← links)
- Towards `up to context' reasoning about higher-order processes (Q2286742) (← links)
- SOS rule formats for idempotent terms and idempotent unary operators (Q2436519) (← links)
- Axiomatizing weak simulation semantics over BCCSP (Q2453533) (← links)
- Generic Models of the Laws of Programming (Q2842638) (← links)
- The Equational Theory of Weak Complete Simulation Semantics over BCCSP (Q2891363) (← links)
- Verification of Context-Dependent Channel-Based Service Models (Q3066118) (← links)
- Suitability of mCRL2 for Concurrent-System Design: A 2 × 2 Switch Case Study (Q3066124) (← links)
- Reactive Turing Machines (Q3088297) (← links)
- Axiomatizing Weak Ready Simulation Semantics over BCCSP (Q3105742) (← links)
- On Rule Formats for Zero and Unit Elements (Q3178250) (← links)
- Dynamic Logic with Binders and Its Application to the Development of Reactive Systems (Q3179414) (← links)
- (Q3384919) (← links)
- A Pre-congruence Format for XY-simulation (Q3455865) (← links)
- Language Representability of Finite P/T Nets (Q3460873) (← links)
- A Context-Free Process as a Pushdown Automaton (Q3541013) (← links)
- (Q4585073) (← links)
- A Higher-Order Calculus of Computational Fields (Q4617982) (← links)
- Unifying Semantics for Concurrent Programming (Q4922078) (← links)
- (Q5014795) (← links)
- (Q5089283) (← links)
- (Q5111623) (← links)
- (Q5155676) (← links)
- A Basic Parallel Process as a Parallel Pushdown Automaton (Q5170665) (← links)
- (Q5228882) (← links)
- A Generic Process Algebra (Q5262952) (← links)
- Equations, Contractions, and Unique Solutions (Q5278202) (← links)
- (Q5856418) (← links)
- Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity (Q5875352) (← links)
- Pushdown Automata and Context-Free Grammars in Bisimulation Semantics (Q5883743) (← links)