Richard Mayr

Log. Methods Comput. Sci., 2013

Advanced automata minimization.

[BibT_eX]

[DOI]

Lorenzo Clemente

Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

Decidability of Weak Simulation on One-Counter Nets.

[BibT_eX]

[DOI]

Piotr Hofman

Patrick Totzke

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Simulation Over One-counter Nets is PSPACE-Complete.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Returning Lost Elements in the Sales Process: Manum Dare.

[BibT_eX]

[DOI]

Proceedings of the Novel Methods and Technologies for Enterprise Information Systems, 2013

Solving Parity Games on Integer Vectors.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012

Petri Nets with Time and Cost

[BibT_eX]

[DOI]

Proceedings of the Proceedings 14th International Workshop on Verification of Infinite-State Systems, 2012

2011

Common Intervals of Multiple Permutations.

[BibT_eX]

[DOI]

Steffen Heber

Jens Stoye

Algorithmica, 2011

Computing Optimal Coverability Costs in Priced Timed Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Advanced Ramsey-Based Büchi Automata Inclusion Testing.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010

On the complexity of checking semantic equivalences between pushdown processes and finite-state processes.

[BibT_eX]

[DOI]

Inf. Comput., 2010

When Simulation Meets Antichains.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010

Multipebble Simulations for Alternating Automata - (Extended Abstract).

[BibT_eX]

[DOI]

Lorenzo Clemente

Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

2009

On the Computational Complexity of Verifying One-Counter Processes.

[BibT_eX]

[DOI]

Stefan Göller

Anthony Widjaja To

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

Minimal Cost Reachability/Coverability in Priced Timed Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2009

2008

Stochastic Games with Lossy Channels.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2008

2007

Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness.

[BibT_eX]

[DOI]

Pritha Mahata

Log. Methods Comput. Sci., 2007

Decisive Markov Chains.

[BibT_eX]

[DOI]

Noomene Ben Henda

Log. Methods Comput. Sci., 2007

2006

Model Checking Probabilistic Pushdown Automata.

[BibT_eX]

[DOI]

Javier Esparza

Log. Methods Comput. Sci., 2006

Limiting Behavior of Markov Chains with Eager Attractors.

[BibT_eX]

[DOI]

Proceedings of the Third International Conference on the Quantitative Evaluation of Systems (QEST 2006), 2006

Eager Markov Chains.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2006

2005

Weak bisimilarity and regularity of context-free processes is EXPTIME-hard.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances.

[BibT_eX]

[DOI]

Javier Esparza

Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property.

[BibT_eX]

[DOI]

Noomene Ben Henda

Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

2004

A Scalable Incomplete Test for the Boundedness of UML RT Models.

[BibT_eX]

[DOI]

Stefan Leue

Wei Wei

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

A Scalable Incomplete Test for Message Buffer Overflow in Promela Models.

[BibT_eX]

[DOI]

Stefan Leue

Wei Wei

Proceedings of the Model Checking Software, 2004

Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets.

[BibT_eX]

[DOI]

Pritha Mahata

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2003

Undecidable problems in unreliable computations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Automatic verification of recursive procedures with one integer parameter.

[BibT_eX]

[DOI]

Ahmed Bouajjani

Peter Habermehl

Theor. Comput. Sci., 2003

Weak Bisimilarity and Regularity of Context-Free Processes is <i>EXPTIME</i>-hard.

[BibT_eX]

[DOI]

Proceedings of the 10th International Workshop on Expressiveness in Concurrency, 2003

Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Simulation Preorder over Simple Process Algebras.

[BibT_eX]

[DOI]

Inf. Comput., 2002

Preface.

[BibT_eX]

[DOI]

Proceedings of the 4th International Workshop on Verification of Infinite-State Systems (CONCUR 2002 Satellite Workshop), 2002

On the Complexity of Semantic Equivalences for Pushdown Automata and BPA.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Why Is Simulation Harder than Bisimulation?

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2002, 2002

2001

Decidability of model checking with the temporal logic EF.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Deciding bisimulation-like equivalences with finite-state processes.

[BibT_eX]

[DOI]

Petr Jancar

Theor. Comput. Sci., 2001

Introduction - Verification of Parameterized Systems - VEPAS 2001.

[BibT_eX]

[DOI]

Proceedings of the Verification of Parameterized Systems, 2001

2000

On the Complexity of Bisimulation Problems for Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2000

On the Complexity of Bisimulation Problems for Basic Parallel Processes.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999

Model Checking Lossy Vector Addition Systems.

[BibT_eX]

[DOI]

Ahmed Bouajjani

Proceedings of the STACS 99, 1999

On the Verification of Broadcast Protocols.

[BibT_eX]

[DOI]

Javier Esparza

Alain Finkel

Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

Simulation Preorder on Simple Process Algebras.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998

Decidability and complexity of model checking problems for infinite state systems.

[BibT_eX]

[DOI]

PhD thesis, 1998

Higher-Order Rewrite Systems and Their Confluence.

[BibT_eX]

[DOI]

Tobias Nipkow

Theor. Comput. Sci., 1998

Strict Lower Bounds for Model Checking BPA.

[BibT_eX]

[DOI]

Proceedings of the MFCS '98 Workshop on Concurrency, 1998

1997

Process rewrite systems.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Expressiveness in Concurrency, 1997

Combining Petri Nets and PA-Processes.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computer Software, Third International Symposium, 1997

Tableau Methods for PA-Processes.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1997

Polynomial Time Approximation Schemes for Geometric Optimization Problems in Euclidean Metric Spaces.

[BibT_eX]

[DOI]

Annette Schelten

Proceedings of the Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, 1997

Model Checking PA-Processes.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '97: Concurrency Theory, 1997

1996

Semantic reachability.

[BibT_eX]

[DOI]

Proceedings of the First International Workshop on Verification of Infinite State Systems, 1996

Weak Bisimulation and Model Checking for Basic Parallel Processes.

[BibT_eX]

[DOI]