Unreliable channels are easier to verify than perfect channels
Information and Computation
Undecidable verification problems for programs with unreliable channels
Information and Computation
The Complexity of the Finite Containment Problem for Petri Nets
Journal of the ACM (JACM)
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
Nonprimitive recursive complexity and undecidability for Petri net equivalence
Theoretical Computer Science
Well-structured transition systems everywhere!
Theoretical 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
An Improved Search Strategy for Lossy Channel Systems
FORTE X / PSTV XVII '97 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE X) and Protocol Specification, Testing and Verification (PSTV XVII)
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Undecidable Problems in Unreliable Computations
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Decidability of the termination problem for completely specified protocols
Distributed Computing
On decidability of the control reachability problem in the asynchronous π-calculus
Nordic Journal of Computing
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
Verification of probabilistic systems with faulty communication
Information and Computation
Verification of programs with half-duplex communication
Information and Computation
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
Quantitative analysis of probabilistic lossy channel systems
Information and Computation
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
A general approach to comparing infinite-state systems with their finite-state specifications
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Constraint-based automatic verification of abstract models of multithreaded programs
Theory and Practice of Logic Programming
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
ACM Transactions on Computational Logic (TOCL)
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
Leftist Grammars Are Non-primitive Recursive
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
On the Reachability Analysis of Acyclic Networks of Pushdown Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A Biologically Inspired Model with Fusion and Clonation of Membranes
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Some Recent Results in Metric Temporal Logic
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Tree Pattern Rewriting Systems
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Nets with Tokens which Carry Data
Fundamenta Informaticae - PETRI NETS 2007
Universality Analysis for One-Clock Timed Automata
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
Model-checking Timed Temporal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Decidability of Reachability for Polymorphic Systems with Arrays: A Complete Classification
Electronic Notes in Theoretical Computer Science (ENTCS)
On the verification problem for weak memory models
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
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
Nets with tokens which carry data
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Post embedding problem is not primitive recursive, with applications to channel systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
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
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
On pebble automata for data languages with decidable emptiness problem
Journal of Computer and System Sciences
Maximal decidable fragments of Halpern and Shoham's modal logic of intervals
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
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
Taming distributed asynchronous systems
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
On the verification of membrane systems with dynamic structure
Natural Computing: an international journal
Automated termination in model checking modulo theories
RP'11 Proceedings of the 5th international conference on Reachability problems
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
Expand, enlarge and check... made efficient
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Temporal logics over transitive states
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A kleene theorem for a class of communicating automata with effective algorithms
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Forward analysis for petri nets with name creation
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Analysis of communicating automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Accelerations for the Coverability Set of Petri Nets with Names
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Decidability of Downward XPath
ACM Transactions on Computational Logic (TOCL)
Nets with Tokens which Carry Data
Fundamenta Informaticae - PETRI NETS 2007
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
Rational subsets and submonoids of wreath products
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.89 |
Lossy channel systems are systems of finite state automata that communicate via unreliable unbounded fifo channels. It is known that reachability, termination and a few other verification problems are decidable for these systems. In this article we show that these problems cannot be solved in primitive recursive time.