Boundedness, empty channel detection, and synchronization for communicating finite automata
Theoretical Computer Science
Synthesis of two-party error-recoverable protocols
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
On deadlock detection in systems of communicating finite state machines
Computers and Artificial Intelligence
A generalization of the procedure of Karp and Miller to well structured transition systems
14th International Colloquium on Automata, languages and programming
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
A survey on the decidability questions for classes of FIFO nets
Advances in Petri Nets 1988
A discipline for constructing multiphase communication protocols
ACM Transactions on Computer Systems (TOCS)
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Foreword: Special Issue on Tools for Computer Communication Systems
IEEE Transactions on Software Engineering
Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part I
Protocol Description and Analysis Based on a State Transition Model with Channel Expressions
Proceedings of the IFIP WG6.1 Seventh International Conference on Protocol Specification, Testing and Verification VII
Reachability analysis of protocols with FIFO channels
SIGCOMM '83 Proceedings of the symposium on Communications Architectures & Protocols
Duplication, insertion and lossiness errors in unreliable communication channels
SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
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
On the Existence of Network Invariants for Verifying Parameterized Systems
Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
Transitive Closures of Regular Relations for Verifying Infinite-State Systems
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Channel Representations in Protocol Verification
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
ICATPN '01 Proceedings of the 22nd 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
Verification of programs with half-duplex communication
Information and Computation
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
Verification of programs with half-duplex communication
Information and Computation
Calibrating embedded protocols on asynchronous systems
Information Sciences: an International Journal
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
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
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
On the expressiveness of asynchronous cellular automata
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Temporal logics over transitive states
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Ordinal theory for expressiveness of well-structured transition systems
Information and Computation
The power of well-structured 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 |
In this paper, we present a new class of protocols called completely specified protocols. Each protocol is represented as a system of Communicating Finite State Machines. The class of completely specified protocols is such that each message that can be received by a Finite State Machine, can also be received in every local state of the Finite State Machine. These protocols are important because they allow for modelling unbounded fifo channels and make it possible to decide the Termination Problem, that is whether the reachability tree is finite or not. An example of our techniques is given using a practical problem concerning link protocols.