The following pages link to Walter Vogler (Q396978):
Displayed 50 items.
- (Q197400) (redirect page) (← links)
- Modular construction and partial order semantics of Petri nets (Q396979) (← links)
- Recent advances in unfolding technique (Q403021) (← links)
- Safe reasoning with logic LTS (Q549200) (← links)
- Step failures semantics and a complete proof system (Q582133) (← links)
- Bisimulation on speed: Worst-case efficiency (Q598200) (← links)
- Fairness and partial order semantics (Q672492) (← links)
- Bisimulation and action refinement (Q685407) (← links)
- Failures semantics based on interval semiwords is a congruence for refinement (Q757073) (← links)
- Merged processes: a new condensed representation of Petri net behaviour (Q854679) (← links)
- Performance of pipelined asynchronous systems (Q864507) (← links)
- Fair testing (Q865623) (← links)
- Conjunction on processes: Full abstraction via ready-tree semantics (Q875513) (← links)
- Another short proof of optimality for the MIN cache replacement algorithm (Q963371) (← links)
- Ready simulation for concurrency: it's logical! (Q988555) (← links)
- Liveness of a mutex algorithm in a fair process algebra (Q1015393) (← links)
- STG decomposition strategies in combination with unfolding (Q1031867) (← links)
- Representing abstract groups by powers of a graph (Q1065820) (← links)
- Failures semantics and deadlocking of modular Petri nets (Q1101233) (← links)
- Metatheorems for decision problems on hyperedge replacement graph languages (Q1121675) (← links)
- Executions: A new partial-order semantics of Petri nets (Q1183595) (← links)
- On hyperedge replacement and BNLC graph grammars (Q1308742) (← links)
- Faster asynchronous systems. (Q1401952) (← links)
- Comparing the worst-case efficiency of asynchronous systems with PAFAS (Q1403331) (← links)
- An improvement of McMillan's unfolding algorithm (Q1600655) (← links)
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem (Q1607225) (← links)
- Partial order semantics and read arcs (Q1608891) (← links)
- Measuring the performance of asynchronous systems with PAFAS (Q1781997) (← links)
- Canonical prefixes of Petri net unfoldings (Q1889762) (← links)
- Generalized OM-bisimulation (Q1891131) (← links)
- Timed testing of concurrent systems (Q1899907) (← links)
- The limit of split\(_ n\)-language equivalence (Q1923087) (← links)
- A linear-time branching-time perspective on interface automata (Q2182669) (← links)
- Richer interface automata with optimistic and pessimistic compatibility (Q2350491) (← links)
- ACTL for modal interface automata (Q2404073) (← links)
- A trace-based service semantics guaranteeing deadlock freedom (Q2428498) (← links)
- Component refinement and CSC-solving for STG decomposition (Q2464945) (← links)
- Fairness of components in system computations (Q2491632) (← links)
- Fairness of actions in system computations (Q2502272) (← links)
- Bisimulation on speed: a unified approach (Q2503326) (← links)
- Error-pruning in interface automata (Q2517232) (← links)
- Nondeterministic modal interfaces (Q2629098) (← links)
- Interface automata for shared memory (Q2675806) (← links)
- (Q2703738) (← links)
- (Q2766578) (← links)
- Fair Testing and Stubborn Sets (Q2814628) (← links)
- (Q2848134) (← links)
- Error-Pruning in Interface Automata (Q2938099) (← links)
- A Trace-Based View on Operating Guidelines (Q3000625) (← links)
- Graphs with given group and given constant link (Q3317131) (← links)