The following pages link to Jan Friso Groote (Q169680):
Displaying 50 items.
- (Q236792) (redirect page) (← links)
- A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus (Q549180) (← links)
- Confluence for process verification (Q672042) (← links)
- Transition system specifications with negative premises (Q685387) (← links)
- A syntactic commutativity format for SOS (Q835035) (← links)
- Lock-free parallel and concurrent garbage collection by mark\&sweep (Q858913) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- Hiding propositional constants in BDDs. (Q960509) (← links)
- Search algorithms for automated validation (Q1014571) (← links)
- (Q1188907) (redirect page) (← links)
- A systematic catalogue of reusable abstract data types (Q1188908) (← links)
- A short proof of the decidability of bisimulation for normed BPA- processes (Q1198053) (← links)
- Structured operational semantics and bisimulation as a congruence (Q1198952) (← links)
- A complete equational axiomatization for MPA with string iteration (Q1274456) (← links)
- Process algebra with guards: Combining hoare logic with process algebra (Q1329197) (← links)
- Undecidable equivalences for basic process algebra (Q1342523) (← links)
- Focus points and convergent process operators: A proof strategy for protocol verification (Q1349249) (← links)
- Formalizing process algebraic verifications in the calculus of constructions (Q1355748) (← links)
- Formal verification of a leader election protocol in process algebra (Q1391796) (← links)
- Analysis of a distributed system for lifting trucks. (Q1400154) (← links)
- Resolution and binary decision diagrams cannot simulate each other polynomially (Q1408378) (← links)
- Binary decision diagrams for first-order predicate logic. (Q1426055) (← links)
- A practical theory of reactive systems. Incremental modeling of dynamic behaviors. (Q1770845) (← links)
- The mean drift: tailoring the mean field theory of Markov processes for real-world applications (Q1798148) (← links)
- Process algebra with timing (Q1847280) (← links)
- Lock-free dynamic hash tables with open addressing (Q1953636) (← links)
- The propositional formula checker HeerHugo (Q1977753) (← links)
- A set automaton to locate all pattern matches in a term (Q2119959) (← links)
- Term rewriting on GPUs (Q2145278) (← links)
- An \(O(m\log n)\) algorithm for stuttering equivalence and branching bisimulation (Q2272927) (← links)
- Operational semantics for Petri net components (Q2373704) (← links)
- Task allocation in a multi-server system (Q2464397) (← links)
- Model-checking processes with data (Q2486254) (← links)
- Parameterised Boolean equation systems (Q2571204) (← links)
- A computer checked algebraic verification of a distributed summation algorithm (Q2576570) (← links)
- Verification of a sliding window protocol in \(\mu\) CRL and PVS (Q2576590) (← links)
- An efficient algorithm to determine probabilistic bisimulation (Q2633253) (← links)
- (Q2749861) (← links)
- (Q2760254) (← links)
- (Q2767014) (← links)
- A Probabilistic Analysis of the Game of the Goose (Q2808273) (← links)
- (Q2818569) (← links)
- (Q2851074) (← links)
- Specification Guidelines to Avoid the State Space Explosion Problem (Q2894558) (← links)
- (Q3043797) (← links)
- Suitability of mCRL2 for Concurrent-System Design: A 2 × 2 Switch Case Study (Q3066124) (← links)
- (Q3148335) (← links)
- (Q3191614) (← links)
- (Q3385650) (← links)
- (Q3395989) (← links)