Formal Analysis of the Alternating Bit Protocol by Temporal Petri Nets
IEEE Transactions on Software Engineering
A LOTOS extension for the performance analysis of distributed systems
IEEE/ACM Transactions on Networking (TON)
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Elements of distributed algorithms: modeling and analysis with Petri nets
Elements of distributed algorithms: modeling and analysis with Petri nets
A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
Using Formal Description Techniques: An Introduction to Estelle, Lotos, and SDL
Using Formal Description Techniques: An Introduction to Estelle, Lotos, and SDL
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Computer Networks
IEEE Transactions on Software Engineering
Modelling and Analysis of Communication and Cooperation Protocols Using Petri Net Based Models
Proceedings of the IFIP WG6.1 Second International Workshop on Protocol Specification, Testing and Verification
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
A Generalised Sweep-Line Method for Safety Properties
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Diophantine Equations, Presburger Arithmetic and Finite Automata
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
On the Verification of Broadcast Protocols
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Unbounded Verification Results by Finite-State Compositional Techniques: 10^any States and Beyond
CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design
Using Forward Reachability Analysis for Verification of Lossy Channel Systems
Formal Methods in System Design
Data and Computer Communications (8th Edition)
Data and Computer Communications (8th Edition)
Using parametric automata for the verification of the stop-and-wait class of protocols
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Performance Analysis and Functional Verification of the Stop-and-Wait Protocol in HOL
Journal of Automated Reasoning
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
A parametric state space for the analysis of the infinite class of stop-and-wait protocols
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Hi-index | 0.01 |
Most protocols contain parameters, such as the maximum number of retransmissions in an error recovery protocol. These parameters are instantiated with values that depend on the operating environment of the protocol. We would therefore like our formal specification or model of the system to include these parameters symbolically, where in general each parameter will have an arbitrary upper limit. The inclusion of parameters results in an infinite family of finite state systems, which makes verification difficult. However, techniques and tools are being developed for the verification of parametric and infinite state systems. We explore the use of one such tool, FAST, for automatically verifying several properties (such as channel bounds and the stop-and-wait property of alternating sends and receives) of the stop-and-wait class of protocols, where the maximum number of retransmissions and the maximum sequence number are considered as unbounded parameters. Coloured Petri nets (CPNs), an expressive language for representing protocols, is used to model this stop-and-wait class. However, FAST'S foundation is counter systems, automata where states are a vector of non-negative integers and with operations limited to Presburger arithmetic. We therefore also present some first steps in transforming CPNs to counter systems in the context of stop-and-wait protocols operating over unbounded FIFO channels.