Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
On decidability of the control reachability problem in the asynchronous π-calculus
Nordic Journal of Computing
ICAL '99 Proceedings of the 26th 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
Petri Nets with Marking-Dependent Ar Cardinality: Properties and Analysis
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Undecidable problems in unreliable computations
Theoretical Computer Science - Latin American theoretical informatics
LTL with the Freeze Quantifier and Register Automata
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Alternation-free modal mu-calculus for data trees
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
The Ordinal Recursive Complexity of Lossy Channel Systems
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Leftist Grammars Are Non-primitive Recursive
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Future-Looking Logics on Data Words and Trees
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
On Pebble Automata for Data Languages with Decidable Emptiness Problem
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Pumping and counting on the regular post embedding problem
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Lossy counter machines decidability cheat sheet
RP'10 Proceedings of the 4th international conference on Reachability problems
Lossy counter machines decidability cheat sheet
RP'10 Proceedings of the 4th international conference on Reachability problems
On the power of cliques in the parameterized verification of Ad Hoc networks
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Ideal abstractions for well-structured transition systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Multiset rewriting for the verification of depth-bounded processes with name binding
Information and Computation
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
Efficient coverability analysis by proof minimization
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
The power of well-structured systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
The power of priority channel systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Computable fixpoints in well-structured symbolic model checking
Formal Methods in System Design
| Hi-index | 0.00 |
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.