| Body na spoluautora | Body za publikaci pro MU | Odkaz ISVaV | | 7,23 | 21,68 | On Determinism in Modal Transition Systems
|
| 14,45 | 14,45 | Teaching Concurrency: Theory in Practice
|
| 14,45 | 14,45 | TAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets
|
| 14,45 | 14,45 | Infinite Runs in Weighted Timed Automata with Energy Constraints
|
| 14,45 | 14,45 | Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
|
| 0,00 | 0,00 | Timed-Arc Petri Nets vs. Networks of Timed Automata
|
| 0,00 | 0,00 | On Counting the Number of Consistent Genotype Assignments for Pedigrees
|
| 0,00 | 0,00 | Recursion vs. Replication in Simple Cryptographic Protocols
|
| 0,00 | 0,00 | Decidability Issues for Extended Ping-Pong Protocol
|
| 14,45 | 14,45 | Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
|
| 0,00 | 0,00 | Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
|
| 39,28 | 39,28 | Undecidability of Bisimilarity by Defender's Forcing
|
| 14,45 | 14,45 | Height-Deterministic Pushdown Automata
|
| 0,00 | 0,00 | Height-Deterministic Pushdown Automata
|
| 14,45 | 14,45 | Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
|
| 23,29 | 23,29 | Beyond Language Equivalence on Visibly Pushdown Automata
|
| 4,82 | 14,45 | Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
|
| 14,45 | 14,45 | An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata
|
| 100,62 | 100,62 | Reactive Systems: Modelling, Specification and Verification
|
| 0,00 | 0,00 | Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
|
| 0,00 | 0,00 | Undecidability Results for Bisimilarity on Prefix Rewrite Systems
|
Back
(c) Michal Bulant, 2011