The following pages link to Benedikt Bollig (Q420854):
Displayed 50 items.
- An optimal construction of Hanf sentences (Q420856) (← links)
- Temporal logics for concurrent recursive programs: satisfiability and model checking (Q472794) (← links)
- Muller message-passing automata and logics (Q948076) (← links)
- Realizability of concurrent recursive programs (Q1620953) (← links)
- An automata-theoretic approach to the verification of distributed algorithms (Q1706162) (← links)
- Synthesis in presence of dynamic links (Q2105465) (← links)
- Property-directed verification and robustness certification of recurrent neural networks (Q2147216) (← links)
- Branch-well-structured transition systems and extensions (Q2165211) (← links)
- Parameterized synthesis for fragments of first-order logic over data words (Q2200816) (← links)
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic (Q2208242) (← links)
- Event clock message passing automata: a logical characterization and an emptiness checking algorithm (Q2248059) (← links)
- Identifiers in registers. Describing network algorithms with logic (Q2289067) (← links)
- The complexity of model checking multi-stack systems (Q2398213) (← links)
- Message-passing automata are expressively equivalent to EMSO logic (Q2503037) (← links)
- Propositional Dynamic Logic for Message-Passing Systems (Q2786133) (← links)
- Model Checking Languages of Data Words (Q2892785) (← links)
- A Robust Class of Data Languages and an Application to Learning (Q2938772) (← links)
- Automata and Logics for Concurrent Systems: Five Models in Five Pages (Q2947404) (← links)
- (Q2978552) (← links)
- Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking (Q3088034) (← links)
- An Automaton over Data Words That Captures EMSO Logic (Q3090829) (← links)
- Communicating Finite-State Machines and Two-Variable Logic (Q3304111) (← links)
- Parameterized Verification of Communicating Automata under Context Bounds (Q3447694) (← links)
- Emptiness of Multi-pushdown Automata Is 2ETIME-Complete (Q3533004) (← links)
- Distributed Timed Automata with Independently Evolving Clocks (Q3541012) (← links)
- Realizability of Dynamic MSC Languages (Q3569730) (← links)
- Pebble Weighted Automata and Transitive Closure Logics (Q3587470) (← links)
- Realizability of Concurrent Recursive Programs (Q3617744) (← links)
- On the Expressive Power of 2-Stack Visibly Pushdown Automata (Q3623011) (← links)
- Weighted versus Probabilistic Logics (Q3637211) (← links)
- (Q4428292) (← links)
- Logic for communicating automata with parameterized topology (Q4635601) (← links)
- Logical characterization of weighted pebble walking automata (Q4635602) (← links)
- (Q4636567) (← links)
- Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete (Q4639894) (← links)
- A Probabilistic Kleene Theorem (Q4649311) (← links)
- (Q4673428) (← links)
- (Q4738217) (← links)
- Weighted Specifications over Nested Words (Q4910432) (← links)
- Dynamic Communicating Automata and Branching High-Level MSCs (Q4910456) (← links)
- (Q4972731) (← links)
- (Q5009419) (← links)
- (Q5020999) (← links)
- (Q5028474) (← links)
- Non axiomatisability of positive relation algebras with constants, via graph homomorphisms (Q5089316) (← links)
- The Complexity of Flat Freeze LTL (Q5111647) (← links)
- Pebble Weighted Automata and Weighted Logics (Q5169971) (← links)
- The Complexity of Model Checking Multi-stack Systems (Q5271053) (← links)
- A Fresh Approach to Learning Register Automata (Q5300834) (← links)
- CONCUR 2004 - Concurrency Theory (Q5311471) (← links)