Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
Model checking of systems with many identical timed processes
Theoretical Computer Science
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
Reasoning about Probabilistic Lossy Channel Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
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
Using Forward Reachability Analysis for Verification of Lossy Channel Systems
Formal Methods in System Design
Simulating perfect channels with probabilistic lossy channels
Information and Computation
Verification of probabilistic systems with faulty communication
Information and Computation
Verification of programs with half-duplex communication
Information and Computation
Verification of communicating data-driven web services
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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)
On Communicating Automata with Bounded Channels
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Recurrent Reachability Analysis in Regular Model Checking
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Universality Analysis for One-Clock Timed Automata
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Verification of probabilistic systems with faulty communication
Information and Computation
Verification of programs with half-duplex communication
Information and Computation
Simulating perfect channels with probabilistic lossy channels
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
Periodic and infinite traces in matrix semigroups
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
The ω-regular post embedding problem
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
A classification of the expressive power of well-structured transition systems
Information and Computation
Forward analysis and model checking for trace bounded WSTS
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
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
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Communicating timed automata: the more synchronous, the more difficult to verify
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Proving liveness by backwards reachability
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Verification of communication protocols using abstract interpretation of FIFO queues
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Safety metric temporal logic is fully decidable
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Value-passing CCS with noisy channels
Theoretical Computer Science
McScM: a general framework for the verification of communicating machines
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Universality Analysis for One-Clock Timed Automata
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
On Communicating Automata with Bounded Channels
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Decidability Analysis of Self-Stabilization for Infinite-State Systems
Fundamenta Informaticae
Finite automata with time-delay blocks
Proceedings of the tenth ACM international conference on Embedded software
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
Proceedings of the 2nd International Workshop on Software Engineering for Resilient Systems
Computable fixpoints in well-structured symbolic model checking
Formal Methods in System Design
Hi-index | 0.00 |