The following pages link to Jörg Desel (Q589393):
Displaying 50 items.
- Instruction sequences for computer science. (Q441056) (← links)
- Efficient unfolding of contextual Petri nets (Q443729) (← links)
- A concurrency-preserving translation from time Petri nets to networks of timed automata (Q453542) (← links)
- Characterisation of the state spaces of marked graph Petri nets (Q515678) (← links)
- Complexity-preserving simulations among three variants of accepting networks of evolutionary processors (Q537856) (← links)
- Long-term security and universal composability (Q604632) (← links)
- Operational semantics and verification of security protocols. (Q610283) (← links)
- Proving nonreachability by modulo-invariants (Q672866) (← links)
- A simplified proof for a self-stabilizing protocol: A Game of Cards (Q672972) (← links)
- Reachability in cyclic extended free-choice systems (Q685410) (← links)
- Petri net synthesis (Q897109) (← links)
- Partial order behaviour and structure of Petri nets (Q911779) (← links)
- Executability of scenarios in Petri nets (Q1006647) (← links)
- On complexity of round transformations (Q1045033) (← links)
- Traps characterize home states in free choice systems (Q1194324) (← links)
- Compositional generation of home states in free choice nets (Q1205188) (← links)
- (Q1280237) (redirect page) (← links)
- Petri nets are dioids: a new algebraic foundation for non-deterministic net theory (Q1713413) (← links)
- Negotiation as concurrency primitive (Q1731828) (← links)
- Associative composition of components with double-sided interfaces (Q1733102) (← links)
- Shortest paths in reachability graphs (Q1900935) (← links)
- The synthesis problem of Petri nets (Q1901703) (← links)
- Polynomial algorithms in computer algebra (Q1912495) (← links)
- Distinguishing and relating higher-order and first-order processes by expressiveness (Q1935453) (← links)
- Rabin's theorem in the concurrency setting: a conjecture (Q2253187) (← links)
- Presynthesis of bounded choice-free or fork-attribution nets (Q2304527) (← links)
- State space axioms for T-systems (Q2340253) (← links)
- Observable liveness of Petri nets (Q2340254) (← links)
- ID-based cryptography using symmetric primitives (Q2384045) (← links)
- Construction of universal one-way hash functions: tree hashing revisited (Q2384401) (← links)
- Keep it fair: equivalence and composition (Q2423741) (← links)
- Classification and generation of disturbance vectors for collision attacks against SHA-1 (Q2430693) (← links)
- (Q2766559) (← links)
- Negotiation Programs (Q2941149) (← links)
- (Q3045249) (← links)
- Vicinity Respecting Homomorphisms for Abstracting System Requirements (Q3066130) (← links)
- Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages (Q3400552) (← links)
- (Q3602749) (← links)
- Construction of Process Models from Example Runs (Q3623827) (← links)
- Unifying Petri Net Semantics with Token Flows (Q3636837) (← links)
- Comparison of Different Algorithms to Synthesize a Petri Net from a Partial Language (Q3651243) (← links)
- (Q4023470) (← links)
- (Q4035686) (← links)
- (Q4035687) (← links)
- (Q4215822) (← links)
- (Q4247286) (← links)
- (Q4247288) (← links)
- (Q4281514) (← links)
- (Q4421715) (← links)
- (Q4421723) (← links)
