Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Undecidability of bisimilarity for Petri nets and some related problems
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
Unreliable channels are easier to verify than perfect channels
Information and Computation
Undecidable verification problems for programs with unreliable channels
Information and Computation
Symbolic Verification of Communication Protocols with Infinite StateSpaces using QDDs
Formal Methods in System Design
Petri nets and regular processes
Journal of Computer and System Sciences
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
Well-structured transition systems everywhere!
Theoretical Computer Science
Symbolic model checking with rich assertional languages
Theoretical Computer Science
Deciding bisimulation-like equivalences with finite-state processes
Theoretical Computer Science
Alternating-time temporal logic
Journal of the ACM (JACM)
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Self-Modifying Nets, a Natural Extension of Petri Nets
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Deciding Properties of Integral Relational Automata
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Symbolic Algorithms for Infinite-State Games
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Decidability and Complexity of Petri Net Problems - An Introduction
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Verifying Systems with Infinite but Regular State Spaces
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Handling Global Conditions in Parameterized System Verification
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Automatic Presentations of Structures
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Establishing Qualitative Properties for Probabilistic Lossy Channel Systems: An Algorithmic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Undecidable problems in unreliable computations
Theoretical Computer Science - Latin American theoretical informatics
On Model Checking for Non-Deterministic Infinite-State Systems
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
On iterating linear transformations over recognizable sets of integers
Theoretical Computer Science
Using Forward Reachability Analysis for Verification of Lossy Channel Systems
Formal Methods in System Design
Covering sharing trees: a compact data structure for parameterized verification
International Journal on Software Tools for Technology Transfer (STTT)
Model Checking µ-Calculus in Well-Structured Transition Systems
TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
A classification of symbolic transition systems
ACM Transactions on Computational Logic (TOCL)
Decidability of the termination problem for completely specified protocols
Distributed Computing
A general approach to comparing infinite-state systems with their finite-state specifications
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
ACM Transactions on Computational Logic (TOCL)
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
The Ordinal Recursive Complexity of Lossy Channel Systems
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
TaPAS: The Talence Presburger Arithmetic Suite
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
More on the Size of Higman-Haines Sets: Effective Constructions
Fundamenta Informaticae - Machines, Computations and Universality, Part I
The Complexity of Finding SUBSEQ(A)
Theory of Computing Systems
Future-Looking Logics on Data Words and Trees
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Regular Model Checking Using Inference of Regular Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Games for Counting Abstractions
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of probabilistic systems with faulty communication
Information and Computation
Simulating perfect channels with probabilistic lossy channels
Information and Computation
A well-structured framework for analysing petri net extensions
Information and Computation
Quantitative analysis of probabilistic lossy channel systems
Information and Computation
A note on the attractor-property of infinite-state Markov chains
Information Processing Letters
What do we know about language equations?
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Stochastic games with lossy channels
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Robust analysis of timed automata via channel machines
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Lossy counter machines decidability cheat sheet
RP'10 Proceedings of the 4th international conference on Reachability problems
Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Multiply-recursive upper bounds with Higman's Lemma
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Flat acceleration in symbolic model checking
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Verifying programs with dynamic 1-selector-linked structures in regular model checking
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Verification of gap-order constraint abstractions of counter systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Representing Hyper-arithmetical Sets by Equations over Sets of Integers
Theory of Computing Systems - Theoretical Aspects of Computer Science
On termination and invariance for faulty channel machines
Formal Aspects of Computing - Celebrating the 60th Birthday of Carroll Morgan
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Preface to the special issue on Probabilistic Model Checking
Formal Methods in System Design
| Hi-index | 0.00 |
We prove a general finite-time convergence theorem for fixpoint expressions over a well-quasi-ordered set. This has immediate applications for the verification of well-structured systems, where a main issue is the computability of fixpoint expressions, and in particular for game-theoretical properties and probabilistic systems where nesting and alternation of least and greatest fixpoints are common.