Jirí Srba

Orcid: 0000-0001-5551-6547

Affiliations:
  • Aarhus University, Denmark


According to our database1, Jirí Srba authored at least 141 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Reproducibility Package for SYPER: Synthesis of Perfectly Resilient Local Fast Re-Routing Rules for Highly Dependable Networks.
Dataset, January, 2024

2023
AllSynth: A BDD-based approach for network update synthesis.
Sci. Comput. Program., August, 2023

A toolchain for domestic heat-pump control using Uppaal Stratego.
Sci. Comput. Program., August, 2023

Pushdown Systems.
Arch. Formal Proofs, 2023

Labeled Transition Systems.
Arch. Formal Proofs, 2023

Elimination of Detached Regions in Dependency Graph Verification.
Proceedings of the Model Checking Software - 29th International Symposium, 2023

Potency-Based Heuristic Search with Randomness for Explicit Model Checking.
Proceedings of the Model Checking Software - 29th International Symposium, 2023

Discovery of Flow Splitting Ratios in ISP Networks with Measurement Noise.
Proceedings of the 28th IEEE Pacific Rim International Symposium on Dependable Computing, 2023

Modelling of Hot Water Buffer Tank and Mixing Loop for an Intelligent Heat Pump Control.
Proceedings of the Formal Methods for Industrial Critical Systems, 2023

2022
Artifact for "R-MPLS: Recursive Protection for Highly Dependable MPLS Networks".
Dataset, October, 2022

Repeatability Package for "PDAAAL: A Library for Reachability Analysis of Weighted Pushdown Systems".
Dataset, August, 2022

Automata-Theoretic Approach to Verification of MPLS Networks Under Link Failures.
IEEE/ACM Trans. Netw., 2022

Extended abstract dependency graphs.
Int. J. Softw. Tools Technol. Transf., 2022

Methods for Efficient Unfolding of Colored Petri Nets.
Fundam. Informaticae, 2022

Automata-Driven Partial Order Reduction and Guided Search for LTL Model Checking.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2022

AllSynth: Transiently Correct Network Update Synthesis Accounting for Operator Preferences.
Proceedings of the Theoretical Aspects of Software Engineering, 2022

End-to-End Heat-Pump Control Using Continuous Time Stochastic Modelling and Uppaal Stratego.
Proceedings of the Theoretical Aspects of Software Engineering, 2022

Kaki: Concurrent Update Synthesis for Regular Policies via Petri Games.
Proceedings of the Integrated Formal Methods - 17th International Conference, 2022

Differential Testing of Pushdown Reachability with a Formally Verified Oracle.
Proceedings of the 22nd Formal Methods in Computer-Aided Design, 2022

The Hazard Value: A Quantitative Network Connectivity Measure Accounting for Failures.
Proceedings of the 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2022

R-MPLS: recursive protection for highly dependable MPLS networks.
Proceedings of the 18th International Conference on emerging Networking EXperiments and Technologies, 2022

MPLS-Kit: An MPLS Data Plane Toolkit.
Proceedings of the 11th IEEE International Conference on Cloud Networking, 2022

FBR: Dynamic Memory-Aware Fast Rerouting.
Proceedings of the 11th IEEE International Conference on Cloud Networking, 2022

Simulation Relations and Applications in Formal Methods.
Proceedings of the Principles of Systems Design, 2022

PDAAAL: A Library for Reachability Analysis of Weighted Pushdown Systems.
Proceedings of the Automated Technology for Verification and Analysis, 2022

STOMPC: Stochastic Model-Predictive Control with Uppaal Stratego.
Proceedings of the Automated Technology for Verification and Analysis, 2022

2021
Repeatability Package for "Faster Pushdown Reachability Analysis with Applications in Network Verification".
Dataset, June, 2021

Stubborn Set Reduction for Two-Player Reachability Games.
Log. Methods Comput. Sci., 2021

Resilient Capacity-Aware Routing.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2021

Improvements in Unfolding of Colored Petri Nets.
Proceedings of the Reachability Problems - 15th International Conference, 2021

Stubborn Set Reduction for Timed Reachability and Safety Games.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2021

Faster Pushdown Reachability Analysis with Applications in Network Verification.
Proceedings of the Automated Technology for Verification and Analysis, 2021

Automatic Synthesis of Transiently Correct Network Updates via Petri Games.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2021

Learning Safe and Optimal Control Strategies for Storm Water Detention Ponds.
Proceedings of the 7th IFAC Conference on Analysis and Design of Hybrid Systems, 2021

2020
Dependency graphs with applications to verification.
Int. J. Softw. Tools Technol. Transf., 2020

Latte: Improving the Latency of Transiently Consistent Network Update Schedules.
SIGMETRICS Perform. Evaluation Rev., 2020

Verification of Multiplayer Stochastic Games via Abstract Dependency Graphs.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2020

AalWiNes: a fast and quantitative what-if analysis tool for MPLS networks.
Proceedings of the CoNEXT '20: The 16th International Conference on emerging Networking EXperiments and Technologies, 2020

Urgent Partial Order Reduction for Extended Timed Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2020

Synthesis for Multi-weighted Games with Branching-Time Winning Conditions.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2020

On-the-Fly Synthesis for Strictly Alternating Games.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2020

2019
Model checking and synthesis for branching multi-weighted logics.
J. Log. Algebraic Methods Program., 2019

Stubborn versus structural reductions for Petri nets.
J. Log. Algebraic Methods Program., 2019

Selected papers from the 28th Nordic Workshop on Programming Theory (NWPT'16).
J. Log. Algebraic Methods Program., 2019

Abstract Dependency Graphs and Their Application to Model Checking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019


Model Verification Through Dependency Graphs.
Proceedings of the Model Checking Software - 26th International Symposium, 2019

Safe and Time-Optimal Control for Railway Games.
Proceedings of the Reliability, Safety, and Security of Railway Systems. Modelling, Analysis, Verification, and Certification, 2019

Partial Order Reduction for Reachability Games.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018
MCC'2017 - The Seventh Model Checking Contest.
Trans. Petri Nets Other Model. Concurr., 2018

Reachability problems: Special issue.
Theor. Comput. Sci., 2018

Discrete and continuous strategies for timed-arc Petri net games.
Int. J. Softw. Tools Technol. Transf., 2018

A Distributed Fixed-Point Algorithm for Extended Dependency Graphs.
Fundam. Informaticae, 2018

Analytical Solution for Long Battery Lifetime Prediction in Nonadaptive Systems.
Proceedings of the Quantitative Evaluation of Systems - 15th International Conference, 2018

Polynomial-Time What-If Analysis for Prefix-Manipulating MPLS Networks.
Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

P-Rex: fast verification of MPLS networks with multiple link failures.
Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies, 2018

Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

Simplification of CTL Formulae for Efficient Model Checking of Petri Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2018

2017
Recording and evaluation of high resolution optical meteor spectra and comparative laboratory measurements using laser ablation of solid meteorite specimens.
Proceedings of the 2017 19th International Conference on Transparent Optical Networks (ICTON), 2017

PTrie: Data Structure for Compressing and Storing Sets via Prefix Sharing.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2017, 2017

Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2017

2016
TAPAAL and Reachability Analysis of P/T Nets.
Trans. Petri Nets Other Model. Concurr., 2016

Efficient model-checking of weighted CTL with upper-bound constraints.
Int. J. Softw. Tools Technol. Transf., 2016

Online and Compositional Learning of Controllers with Application to Floor Heating.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization.
Proceedings of the Model Checking Software - 23rd International Symposium, 2016

Distributed Computation of Fixed Points on Dependency Graphs.
Proceedings of the Dependable Software Engineering: Theories, Tools, and Applications, 2016

Toolchain for user-centered intelligent floor heating control.
Proceedings of the IECON 2016, 2016

2015
Soundness of Timed-Arc Workflow Nets in Discrete and Continuous-Time Semantics.
Fundam. Informaticae, 2015

Refinement checking on parametric modal transition systems.
Acta Informatica, 2015

CAAL: Concurrency Workbench, Aalborg Edition.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

Language Emptiness of Continuous-Time Parametric Timed Automata.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Polynomial Time Decidability of Weighted Synchronization under Partial Observability.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
TCTL-preserving translations from timed-arc Petri nets to networks of timed automata.
Theor. Comput. Sci., 2014

Memory Efficient Data Structures for Explicit Verification of Timed Systems.
Proceedings of the NASA Formal Methods - 6th International Symposium, NFM 2014, Houston, TX, USA, April 29, 2014

Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2014

Synchronizing Strategies under Partial Observability.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Soundness of Timed-Arc Workflow Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2014

2013
Model-checking web services business activity protocols.
Int. J. Softw. Tools Technol. Transf., 2013

Note on Undecidability of Bisimilarity for Second-Order Pushdown Processes
CoRR, 2013

Local Model Checking of Weighted CTL with Upper-Bound Constraints.
Proceedings of the Model Checking Software - 20th International Symposium, 2013

Models for Real-Time Embedded Systems.
Proceedings of the Communicating Embedded Systems, 2013


2012
Extending modal transition systems with structured labels.
Math. Struct. Comput. Sci., 2012

Modal transition systems with weight intervals.
J. Log. Algebraic Methods Program., 2012

EXPTIME-completeness of thorough refinement on modal transition systems.
Inf. Comput., 2012

Time-Darts: A Data Structure for Verification of Closed Timed Automata
Proceedings of the Proceedings Seventh Conference on Systems Software Verification, 2012

A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets
Proceedings of the Proceedings Seventh Conference on Systems Software Verification, 2012

A Logic for Accumulated-Weight Reasoning on Multiweighted Modal Automata.
Proceedings of the Sixth International Symposium on Theoretical Aspects of Software Engineering, 2012

TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

Action Investment Energy Games.
Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012

Verification of Liveness Properties on Closed Timed-Arc Petri Nets.
Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012

Dual-Priced Modal Transition Systems with Time Durations.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2012

Verification of Timed Healthcare Workflows Using Component Timed-Arc Petri Nets.
Proceedings of the Foundations of Health Information Engineering and Systems, 2012

Unblockable compositions of software components.
Proceedings of the 15th ACM SIGSOFT Symposium on Component Based Software Engineering, 2012

The algorithmics of bisimilarity.
Proceedings of the Advanced Topics in Bisimulation and Coinduction., 2012

2011
Modelling and Verification of Web Services Business Activity Protocol.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2011

Verification of Timed-Arc Petri Nets.
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011


Energy Games in Multiweighted Automata.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Johannesburg, South Africa, August 31, 2011

Parametric Modal Transition Systems.
Proceedings of the Automated Technology for Verification and Analysis, 2011

2010
A Formal Analysis of the Web Services Atomic Transaction Protocol with UPPAAL.
Proceedings of the Leveraging Applications of Formal Methods, Verification, and Validation, 2010

A Framework for Relating Timed Transition Systems and Preserving TCTL Model Checking.
Proceedings of the Computer Performance Engineering, 2010

An experiment with using Google tools for project supervision at tertiary education.
Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing, 2010

2009
On determinism in modal transition systems.
Theor. Comput. Sci., 2009

Beyond Language Equivalence on Visibly Pushdown Automata
Log. Methods Comput. Sci., 2009

Teaching Concurrency: Theory in Practice.
Proceedings of the Teaching Formal Methods, Second International Conference, 2009

Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete.
Proceedings of the Theoretical Aspects of Computing, 2009

An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata.
Proceedings of the Formal Methods and Software Engineering, 2009

Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains.
Proceedings of the Foundations of Software Science and Computational Structures, 2009

TAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets.
Proceedings of the Automated Technology for Verification and Analysis, 2009

2008
Undecidability of bisimilarity by defender's forcing.
J. ACM, 2008

Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2008

Infinite Runs in Weighted Timed Automata with Energy Constraints.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2008

2007
Height-Deterministic Pushdown Automata.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
Decidability Issues for Extended Ping-Pong Protocols.
J. Autom. Reason., 2006

Undecidability Results for Bisimilarity on Prefix Rewrite Systems.
Proceedings of the Foundations of Software Science and Computation Structures, 2006

Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols.
Proceedings of the Automated Technology for Verification and Analysis, 2006

2005
Preface.
Proceedings of the 7th International Workshop on Verification of Infinite-State Systems, 2005

Recursion Versus Replication in Simple Cryptographic Protocols.
Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

On Counting the Number of Consistent Genotype Assignments for Pedigrees.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Timed-Arc Petri Nets vs. Networks of Timed Automata.
Proceedings of the Applications and Theory of Petri Nets 2005, 2005

2004
On the computational complexity of bisimulation, redux.
Inf. Comput., 2004

Highly Undecidable Questions for Process Algebras.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003
Undecidability of domino games and hhp-bisimilarity.
Inf. Comput., 2003

Completeness Results for Undecidable Bisimilarity Problems.
Proceedings of INFINITY 2003, 2003

Strong bisimilarity of simple process algebras: complexity lower bounds.
Acta Informatica, 2003

2002
Roadmap of Infinite Results.
Bull. EATCS, 2002

Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard.
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Note on the Tableau Technique for Commutative Transition Systems.
Proceedings of the Foundations of Software Science and Computation Structures, 2002

Undecidability of Weak Bisimilarity for PA-Processes.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

Undecidability of Weak Bisimilarity for Pushdown Processes.
Proceedings of the CONCUR 2002, 2002

2001
Basic process algebra with deadlocking states.
Theor. Comput. Sci., 2001

Properties of Distributed Timed-Arc Petri Nets.
Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

On the Power of Labels in Transition Systems.
Proceedings of the CONCUR 2001, 2001

Towards a Notion of Distributed Time for Petri Nets.
Proceedings of the Application and Theory of Petri Nets 2001, 2001

2000
Complexity of Weak Bisimilarity and Regularity for BPA and BPP.
Proceedings of the 7th International Workshop on Expressiveness in Concurrency, 2000

Matching Modulo Associativity and Idempotency Is NP-Complete.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1999
Pattern Equations and Equations with Stuttering.
Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999

1998
Deadlocking States in Context-Free Process Algebra.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998


  Loading...