Jiří Srba

From MaRDI portal
Person:444489

Available identifiers

zbMath Open srba.jiriMaRDI QIDQ444489

List of research outcomes

PublicationDate of PublicationType
Model verification through dependency graphs2024-02-23Paper
Abstract Dependency Graphs and Their Application to Model Checking2023-11-24Paper
Elimination of detached regions in dependency graph verification2023-10-16Paper
Simulation relations and applications in formal methods2023-08-10Paper
Start pruning when time gets urgent: partial order reduction for timed systems2023-05-26Paper
Partial order reduction for reachability games2023-02-03Paper
Synthesis for Multi-weighted Games with Branching-Time Winning Conditions2022-09-01Paper
On-the-Fly Synthesis for Strictly Alternating Games2022-09-01Paper
Kaki: concurrent update synthesis for regular policies via Petri games2022-08-19Paper
Automata-driven partial order reduction and guided search for LTL model checking2022-07-08Paper
Faster pushdown reachability analysis with applications in network verification2022-06-22Paper
Stubborn set reduction for timed reachability and safety games2022-03-24Paper
Verification of multiplayer stochastic games via abstract dependency graphs2022-03-23Paper
Automatic synthesis of transiently correct network updates via Petri games2022-03-21Paper
Resilient capacity-aware routing2021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q58564252021-03-26Paper
Simplification of CTL formulae for efficient model checking of Petri nets2019-12-18Paper
Model checking and synthesis for branching multi-weighted logics2019-06-20Paper
Stubborn versus structural reductions for Petri nets2018-12-19Paper
A Distributed Fixed-Point Algorithm for Extended Dependency Graphs*2018-10-02Paper
Extended dependency graphs and efficient distributed fixed-point computation2018-08-20Paper
Distributed computation of fixed points on dependency graphs2018-08-16Paper
PTrie: data structure for compressing and storing sets via prefix sharing2017-11-03Paper
Polynomial Time Decidability of Weighted Synchronization under Partial Observability2017-09-12Paper
Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization2016-06-22Paper
Soundness of Timed-Arc Workflow Nets in Discrete and Continuous-Time Semantics2016-05-02Paper
Language Emptiness of Continuous-Time Parametric Timed Automata2015-11-04Paper
Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets2015-08-06Paper
Refinement checking on parametric modal transition systems2015-04-16Paper
Synchronizing Strategies under Partial Observability2014-09-15Paper
Soundness of Timed-Arc Workflow Nets2014-07-08Paper
TCTL-preserving translations from timed-arc Petri nets to networks of timed automata2014-06-10Paper
The algorithmics of bisimilarity2014-04-25Paper
https://portal.mardi4nfdi.de/entity/Q28474112013-09-09Paper
Complexity of Weak Bisimilarity and Regularity for BPA and BPP2013-04-26Paper
EXPTIME-completeness of thorough refinement on modal transition systems2012-11-27Paper
Extending modal transition systems with structured labels2012-09-06Paper
Modal transition systems with weight intervals2012-08-14Paper
TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets2012-06-29Paper
Dual-Priced Modal Transition Systems with Time Durations2012-06-15Paper
Energy Games in Multiweighted Automata2012-01-06Paper
Parametric Modal Transition Systems2011-10-07Paper
Verification of Timed-Arc Petri Nets2011-02-15Paper
On determinism in modal transition systems2009-09-29Paper
https://portal.mardi4nfdi.de/entity/Q33959482009-09-15Paper
Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete2009-08-20Paper
Beyond Language Equivalence on Visibly Pushdown Automata2009-04-29Paper
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains2009-03-31Paper
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation2009-03-12Paper
Undecidability of bisimilarity by defender's forcing2008-12-21Paper
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets2008-12-02Paper
Infinite Runs in Weighted Timed Automata with Energy Constraints2008-12-02Paper
Height-Deterministic Pushdown Automata2008-09-17Paper
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols2008-09-04Paper
Reactive Systems2007-10-04Paper
Foundations of Software Science and Computation Structures2007-05-02Paper
Decidability issues for extended ping-pong protocols2007-01-30Paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science2006-11-14Paper
Applications and Theory of Petri Nets 20052005-12-14Paper
SOFSEM 2005: Theory and Practice of Computer Science2005-12-07Paper
https://portal.mardi4nfdi.de/entity/Q46734292005-04-29Paper
https://portal.mardi4nfdi.de/entity/Q46657382005-04-11Paper
On the computational complexity of bisimulation, redux2005-01-11Paper
https://portal.mardi4nfdi.de/entity/Q47368692004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47372022004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47382392004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44742262004-08-04Paper
Complexity of weak bisimilarity and regularity for BPA and BPP2004-03-30Paper
Strong bisimilarity of simple process algebras: Complexity lower bounds2004-03-11Paper
Undecidability of domino games and hhp-bisimilarity.2003-08-19Paper
https://portal.mardi4nfdi.de/entity/Q44121122003-07-13Paper
https://portal.mardi4nfdi.de/entity/Q44845122003-06-12Paper
https://portal.mardi4nfdi.de/entity/Q47912692003-02-06Paper
https://portal.mardi4nfdi.de/entity/Q45363812002-11-04Paper
https://portal.mardi4nfdi.de/entity/Q45351702002-06-13Paper
Basic process algebra with deadlocking states2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q44962482001-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42181121998-11-11Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jiří Srba