The following pages link to Reactive Systems (Q5309950):
Displaying 50 items.
- Adequacy and complete axiomatization for timed modal logic (Q283762) (← links)
- Bisimulations for fuzzy automata (Q423147) (← links)
- Value-passing CCS with noisy channels (Q428864) (← links)
- Reachability analysis for timed automata using max-plus algebra (Q444476) (← links)
- Lattice-valued simulations for quantitative transition systems (Q473367) (← links)
- Differential privacy in probabilistic systems (Q529047) (← links)
- Computation of the greatest simulations and bisimulations between fuzzy automata (Q690916) (← links)
- Quantitative analysis of weighted transition systems (Q710680) (← links)
- Synthesising correct concurrent runtime monitors (Q888412) (← links)
- Product line process theory (Q898612) (← links)
- Nondeterministic automata: equivalence, bisimulations, and uniform relations (Q903611) (← links)
- An operational semantics for a calculus for wireless systems (Q964487) (← links)
- Cyber-physical systems (Q1699390) (← links)
- A logic for the stepwise development of reactive systems (Q1786564) (← links)
- On decidability of recursive weighted logics (Q1797779) (← links)
- Compositionality for quantitative specifications (Q1797783) (← links)
- Predicate liftings and functor presentations in coalgebraic expression languages (Q1798785) (← links)
- Testing interruptions in reactive systems (Q1941859) (← links)
- A theory of monitors (Q2051767) (← links)
- A study on team bisimulation and H-team bisimulation for BPP nets (Q2055961) (← links)
- On bidirectional runtime enforcement (Q2117010) (← links)
- Team bisimilarity, and its associated modal logic, for BPP nets (Q2231652) (← links)
- Compositional reasoning using intervals and time reversal (Q2251129) (← links)
- Partition consistency. A case study in modeling systems with weak memory consistency and proving correctness of their implementations (Q2256965) (← links)
- A linear-time-branching-time spectrum for behavioral specification theories (Q2291820) (← links)
- Determinizing monitors for HML with recursion (Q2291832) (← links)
- Bisimulation of type 2 for BL-general fuzzy automata (Q2297988) (← links)
- A propositional dynamic logic for instantial neighborhood semantics (Q2323639) (← links)
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions (Q2340255) (← links)
- Simulation for lattice-valued doubly labeled transition systems (Q2353987) (← links)
- Monitorability for the Hennessy-Milner logic with recursion (Q2402551) (← links)
- Verification of finite-state machines: a distributed approach (Q2413026) (← links)
- When are prime formulae characteristic? (Q2422016) (← links)
- Characteristic formulae for fixed-point semantics: a general framework (Q2883115) (← links)
- When Are Prime Formulae Characteristic? (Q2946326) (← links)
- Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems (Q2948229) (← links)
- Dynamic Logic with Binders and Its Application to the Development of Reactive Systems (Q3179414) (← links)
- On the Executability of Interactive Computation (Q3188271) (← links)
- (Q3384912) (← links)
- Teaching Concurrency Concepts to Freshmen (Q3599211) (← links)
- Checking Timed Büchi Automata Emptiness Using LU-Abstractions (Q3648834) (← links)
- (Q4553282) (← links)
- A doctrinal approach to modal/temporal Heyting logic and non-determinism in processes (Q4606700) (← links)
- (Q5009452) (← links)
- (Q5014797) (← links)
- Consistently-detecting monitors (Q5111620) (← links)
- Monitoring for Silent Actions (Q5136296) (← links)
- Discount-Optimal Infinite Runs in Priced Timed Automata (Q5179061) (← links)
- Simplified Coalgebraic Trace Equivalence (Q5256339) (← links)
- Bidirectional Runtime Enforcement of First-Order Branching-Time Properties (Q5883741) (← links)
