Travelled to:1 × Austria
1 × Estonia
1 × France
1 × Germany
1 × Hungary
1 × Italy
1 × Spain
1 × United Kingdom
2 × Japan
Collaborated with:∅ P.Jancar K.G.Larsen A.P.Ravn S.Vighio N.Benes P.Bezdek M.Kühnrich S.Schwoon S.Kiefer F.M.Bønneland P.G.Jensen M.Muñiz R.Dong J.Faber Z.Liu N.Zhan J.Zhu A.David L.Jacobsen M.Jacobsen K.Y.Jørgensen M.H.Møller
Talks about:time (5) bisimilar (3) system (3) automata (2) undecid (2) process (2) languag (2) interprocedur (1) techniqu (1) pushdown (1)
Person: Jirí Srba
DBLP: Srba:Jir=iacute=
Contributed to:
2015
2012
20122011
2009
20062006
200220022002
2018Wrote 11 papers:
- ICALP-v2-2015-BenesBLS #automaton #parametricity
- Language Emptiness of Continuous-Time Parametric Timed Automata (NB, PB, KGL, JS), pp. 69–81.
- CBSE-2012-DongFLSZZ #component #composition
- Unblockable compositions of software components (RD, JF, ZL, JS, NZ, JZ), pp. 103–108.
- TACAS-2012-DavidJJJMS #development #ide #petri net
- TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets (AD, LJ, MJ, KYJ, MHM, JS), pp. 492–497.
- TACAS-2011-RavnSV #modelling #process #protocol #verification #web #web service
- Modelling and Verification of Web Services Business Activity Protocol (APR, JS, SV), pp. 357–371.
- FoSSaCS-2009-KuhnrichSSK #analysis #data flow #infinity #interprocedural
- Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains (MK, SS, JS, SK), pp. 440–455.
- CSL-2006-Srba #automaton #bisimulation #equivalence #simulation
- Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation (JS), pp. 89–103.
- FoSSaCS-2006-JancarS #similarity #term rewriting
- Undecidability Results for Bisimilarity on Prefix Rewrite Systems (PJ, JS), pp. 277–291.
- DLT-2002-Srba #similarity
- Undecidability of Weak Bisimilarity for PA-Processes (JS), pp. 197–208.
- FoSSaCS-2002-Srba #commutative
- Note on the Tableau Technique for Commutative Transition Systems (JS), pp. 387–401.
- ICALP-2002-Srba #algebra #process #similarity
- Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard (JS), pp. 716–727.
- CAV-2018-BonnelandJLMS #partial order #reduction
- Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems (FMB, PGJ, KGL, MM, JS), pp. 527–546.