| Publication | Date of Publication | Type |
|---|
A completeness proof for a regular predicate logic with undefined truth value
Notre Dame Journal of Formal Logic | 2023-05-31 | Paper |
Finding Stubborn Sets of Coloured Petri Nets without Unfolding
| 2022-12-09 | Paper |
scientific article; zbMATH DE number 7407780 (Why is no real title available?)
| 2021-10-08 | Paper |
A simple character string proof of the ``true but unprovable version of Gödel's first incompleteness theorem
| 2021-06-22 | Paper |
Stubborn set intuition explained
Lecture Notes in Computer Science | 2021-06-14 | Paper |
Stubborn Sets, Frozen Actions, and Fair Testing
Fundamenta Informaticae | 2021-05-21 | Paper |
The inconsistent labelling problem of stutter-preserving partial-order reduction
| 2020-09-23 | Paper |
All congruences below stability-preserving fair testing or CFFD
Acta Informatica | 2020-05-26 | Paper |
Compositionality in state space verification methods
Application and Theory of Petri Nets 1996 | 2019-05-02 | Paper |
Safety property-driven stubborn sets
| 2018-03-26 | Paper |
More stubborn set methods for process algebras
| 2018-03-26 | Paper |
Stubborn sets with frozen actions
| 2017-12-20 | Paper |
Constructing Minimal Coverability Sets
Fundamenta Informaticae | 2017-03-16 | Paper |
Fair testing and stubborn sets
Model Checking Software | 2016-06-22 | Paper |
On constructibility and unconstructibility of LTS operators from other LTS operators
Acta Informatica | 2015-04-16 | Paper |
Asymptotic proportion of hard instances of the halting problem
Acta Cybernetica | 2015-01-09 | Paper |
Constructing minimal coverability sets
Lecture Notes in Computer Science | 2014-07-07 | Paper |
Old and new algorithms for minimal coverability sets
Fundamenta Informaticae | 2014-05-12 | Paper |
Good to know about the efficiency of state space methods
Nordic Journal of Computing | 2013-12-13 | Paper |
All linear-time congruences for familiar operators
Logical Methods in Computer Science | 2013-11-28 | Paper |
External behaviour of systems of state machines with variables
Transactions on Petri Nets and Other Models of Concurrency VII | 2013-05-31 | Paper |
Does the Shannon bound really apply to all data structures?
Proceedings of the Estonian Academy of Sciences | 2013-04-30 | Paper |
Efficient minimization of DFAs with partial transition
| 2013-03-19 | Paper |
All Linear-Time Congruences for Familiar Operators Part 2: Infinite LTSs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Old and new algorithms for minimal coverability sets
Lecture Notes in Computer Science | 2012-09-04 | Paper |
Fast brief practical DFA minimization
Information Processing Letters | 2012-07-18 | Paper |
scientific article; zbMATH DE number 6017853 (Why is no real title available?)
| 2012-03-22 | Paper |
Simple bisimilarity minimization in \(O(m \log n)\) time
Fundamenta Informaticae | 2011-03-28 | Paper |
Can stubborn sets be optimal?
Applications and Theory of Petri Nets | 2010-06-22 | Paper |
Simple \(O(m \log n)\) time Markov chain lumping
Tools and Algorithms for the Construction and Analysis of Systems | 2010-04-27 | Paper |
Exploring the scope for partial order reduction
Automated Technology for Verification and Analysis | 2009-12-01 | Paper |
Bisimilarity Minimization in O(m logn) Time
Applications and Theory of Petri Nets | 2009-06-30 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Operational Determinism and Fast Algorithms
CONCUR 2006 – Concurrency Theory | 2007-09-04 | Paper |
Question-guided stubborn set methods for state properties
Formal Methods in System Design | 2007-01-24 | Paper |
A modern mathematical theory of co-operating state machines
| 2006-08-15 | Paper |
More efficient on-the-fly LTL verification with Tarjan's algorithm
Theoretical Computer Science | 2005-12-06 | Paper |
scientific article; zbMATH DE number 1982202 (Why is no real title available?)
| 2003-09-16 | Paper |
scientific article; zbMATH DE number 1927561 (Why is no real title available?)
| 2003-06-12 | Paper |
scientific article; zbMATH DE number 1863165 (Why is no real title available?)
| 2003-02-03 | Paper |
scientific article; zbMATH DE number 1863167 (Why is no real title available?)
| 2003-02-03 | Paper |
Relaxed visibility enhances partial order reduction
Formal Methods in System Design | 2002-10-23 | Paper |
scientific article; zbMATH DE number 1696461 (Why is no real title available?)
| 2002-06-17 | Paper |
scientific article; zbMATH DE number 1746446 (Why is no real title available?)
| 2002-05-28 | Paper |
scientific article; zbMATH DE number 1538044 (Why is no real title available?)
| 2001-05-20 | Paper |
scientific article; zbMATH DE number 1361140 (Why is no real title available?)
| 1999-12-20 | Paper |
Essential transitions to bisimulation equivalences
Theoretical Computer Science | 1998-07-22 | Paper |
scientific article; zbMATH DE number 1059329 (Why is no real title available?)
| 1997-09-10 | Paper |
The weakest deadlock-preserving congruence
Information Processing Letters | 1997-02-28 | Paper |
Compositional failure-based semantic models for basic LOTOS
Formal Aspects of Computing | 1996-02-01 | Paper |
A stubborn attack on state explosion
Formal Methods in System Design | 1993-09-30 | Paper |
scientific article; zbMATH DE number 177511 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 177237 (Why is no real title available?)
| 1993-05-18 | Paper |
