Symbolic Verification of Communication Protocols with Infinite StateSpaces using QDDs
Formal Methods in System Design
Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
On Verifying Fair Lossy Channel Systems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Effective Recognizability and Model Checking of Reactive Fiffo Automata
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Effective Lossy Queue Languages
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Decidability of Reachability Problems for Classes of Two Counters Automata
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Channel Representations in Protocol Verification
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Verifying Performance Equivalence for Timed Basic Parallel Processes
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
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
Languages, Rewriting Systems, and Verification of Infinite-State Systems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Undecidable problems in unreliable computations
Theoretical Computer Science - Latin American theoretical informatics
Using Forward Reachability Analysis for Verification of Lossy Channel Systems
Formal Methods in System Design
Verification of probabilistic systems with faulty communication
Information and Computation
Verification of programs with half-duplex communication
Information and Computation
Quantitative analysis of probabilistic lossy channel systems
Information and Computation
Decidability analysis of self-stabilization for infinite-state systems
Fundamenta Informaticae
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
ACM Transactions on Computational Logic (TOCL)
Mixing Lossy and Perfect Fifo Channels
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Name Creation vs. Replication in Petri Net Systems
Fundamenta Informaticae - PETRI NETS 2007
Universality Analysis for One-Clock Timed Automata
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Forward Analysis for WSTS, Part II: Complete WSTS
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Regular Model Checking Using Inference of Regular Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Regularity Results for FIFO Channels
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of probabilistic systems with faulty communication
Information and Computation
Verification of programs with half-duplex communication
Information and Computation
Quantitative analysis of probabilistic lossy channel systems
Information and Computation
Verification of probabilistic systems with faulty communication
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Model checking lossy channels systems is probably decidable
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Quantitative analysis of probabilistic lossy channel systems
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Model checking lossy vector addition systems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Noetherian spaces in verification
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
A classification of the expressive power of well-structured transition systems
Information and Computation
Reachability Problems in Piecewise FIFO Systems
ACM Transactions on Computational Logic (TOCL)
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
On metric temporal logic and faulty turing machines
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Decidability and complexity results for timed automata via channel machines
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Communicating timed automata: the more synchronous, the more difficult to verify
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Piecewise FIFO channels are analyzable
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
On the expressiveness of asynchronous cellular automata
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Monotonic set-extended prefix rewriting and verification of recursive ping-pong protocols
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Language-based comparison of petri nets with black tokens, pure names and ordered data
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Verification of communication protocols using abstract interpretation of FIFO queues
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Reliable contracts for unreliable half-duplex communications
WS-FM'11 Proceedings of the 8th international conference on Web Services and Formal Methods
Name Creation vs. Replication in Petri Net Systems
Fundamenta Informaticae - PETRI NETS 2007
Universality Analysis for One-Clock Timed Automata
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
The theory of WSTS: the case of complete WSTS
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Decidability Analysis of Self-Stabilization for Infinite-State Systems
Fundamenta Informaticae
Comparing the expressive power of well-structured transition systems
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Unidirectional channel systems can be tested
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
On the coverability and reachability languages of monotonic extensions of Petri nets
Theoretical Computer Science
The parametric ordinal-recursive complexity of post embedding problems
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
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.01 |