The following pages link to Mojmír Křetínský (Q1006888):
Displaying 24 items.
- (Q688716) (redirect page) (← links)
- Refinement of actions in event structures and causal trees (Q688717) (← links)
- The existence of refinement mappings (Q805251) (← links)
- On decidability of LTL model checking for process rewrite systems (Q1006890) (← links)
- Reachability is decidable for weakly extended process rewrite systems (Q1023281) (← links)
- Concurrent and maximally concurrent evolution of nonsequential systems (Q1083185) (← links)
- Conditions for incremental iteration: Examples and counterexamples (Q1113663) (← links)
- (Q1179703) (redirect page) (← links)
- An algebra of concurrent non-deterministic processes (Q1179704) (← links)
- An extensional fixed-point semantics for nondeterministic data flow (Q1183593) (← links)
- Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings (Q1188590) (← links)
- Fairness and hyperfairness in multi-party interactions (Q1261113) (← links)
- TIC: a tImed calculus (Q1261314) (← links)
- Comparing expressibility of normed BPA and normed BPP processes (Q1306565) (← links)
- Denotational engineering (Q1825025) (← links)
- Testing equivalence as a bisimulation equivalence (Q2366163) (← links)
- Petri nets are less expressive than state-extended PA (Q2481981) (← links)
- (Q2847415) (← links)
- (Q2852014) (← links)
- Comparison of LTL to Deterministic Rabin Automata Translators (Q2870123) (← links)
- LTL to Büchi Automata Translation: Fast and More Deterministic (Q2894268) (← links)
- A process algebra for synchronous concurrent constraint programming (Q2956720) (← links)
- On Decidability of LTL+Past Model Checking for Process Rewrite Systems (Q5179053) (← links)
- CONCUR 2004 - Concurrency Theory (Q5311485) (← links)
