PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Srba, Jirí"

Author of the publication

copydeleteadd this publication to your clipboard
Energy Games in Multiweighted Automata.

, , , and . ICTAC, volume 6916 of Lecture Notes in Computer Science, page 95-115. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Srba, Jirí
add a person with the name Srba, Jirí
 

Other publications of authors with the same name

On the computational complexity of bisimulation, redux., , and . Inf. Comput., 194 (2): 129-143 (2004)Time-Darts: A Data Structure for Verification of Closed Timed Automata, , and . SSV, volume 102 of EPTCS, page 141-155. (2012)Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete., , , and . ICTAC, volume 5684 of Lecture Notes in Computer Science, page 112-126. Springer, (2009)A Framework for Relating Timed Transition Systems and Preserving TCTL Model Checking., , , and . EPEW, volume 6342 of Lecture Notes in Computer Science, page 83-98. Springer, (2010)Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization., , and . SPIN, volume 9641 of Lecture Notes in Computer Science, page 129-146. Springer, (2016)Parametric Modal Transition Systems., , , , and . ATVA, volume 6996 of Lecture Notes in Computer Science, page 275-289. Springer, (2011)Note on the Tableau Technique for Commutative Transition Systems.. FoSSaCS, volume 2303 of Lecture Notes in Computer Science, page 387-401. Springer, (2002)Undecidability Results for Bisimilarity on Prefix Rewrite Systems., and . FoSSaCS, volume 3921 of Lecture Notes in Computer Science, page 277-291. Springer, (2006)Verification of Liveness Properties on Closed Timed-Arc Petri Nets., , , , and . MEMICS, volume 7721 of Lecture Notes in Computer Science, page 69-81. Springer, (2012)Deadlocking States in Context-Free Process Algebra.. MFCS, volume 1450 of Lecture Notes in Computer Science, page 388-398. Springer, (1998)