Communicating sequential processes
Communicating sequential processes
Distributed mutual exclusion on a ring of processes
Science of Computer Programming
Limits for automatic verification of finite-state concurrent systems
Information Processing Letters
Reasoning about networks with many identical finite-state processes
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
The undecidability of propositional temporal logic for Petri nets
Computers and Artificial Intelligence
Proving properties of a ring of finite-state machines
Information Processing Letters
Communication and concurrency
IEEE Transactions on Computers
Problems concerning fairness and temporal logic for conflict-free Petri nets
Theoretical Computer Science
A structural induction theorem for processes
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Verifying properties of large sets of processes with network invariants
Proceedings of the international workshop on Automatic verification methods for finite state systems
Formal Analysis of the Alternating Bit Protocol by Temporal Petri Nets
IEEE Transactions on Software Engineering
A taxonomy of fairness and temporal logic problems for Petri nets
Theoretical Computer Science
Reasoning about systems with many processes
Journal of the ACM (JACM)
Synthesis of Communicating Processes from Temporal Logic Specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm
Proceedings of the IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XI
AUTO: A Verification Tool for Distributed Systems Using Reduction of Finite Automata Networks
FORTE '89 Proceedings of the IFIP TC/WG6.1 Second International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Compositional Minimization of Finite State Systems
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
IEEE Transactions on Software Engineering
Algorithmic Verification with Multiple and Nested Parameters
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Verifying parameterized taDOM+ lock managers
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Automated multiparameterised verification by cut-offs
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Petri nets for protocol engineering
Computer Communications
| Hi-index | 0.00 |
Presents a new structural induction theorem for rings consisting of identical components that are modeled using a Petri net and a temporal logic formula. The theorem gives a condition in terms of the behavior of the rings of sizes k/spl minus/1 and k, k/spl ges/5, under which all rings of size k/spl minus/1 or greater exhibit "similar" behavior. Using the example of demand-driven token circulation, we show how the theorem can be applied to formally infer the correctness of a ring of any large size from that of a ring having fewer components.