Invariance and non-determinacy
Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages
Fairness and partial order semantics
Information Processing Letters
Information and Computation
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Efficiency of Asynchronous Systems and Read Arcs in Petri Nets
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Unfolding and Finite Prefix for Nets with Read Arcs
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Functorial Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Verifying Properties of Large Sets of Processes with Network Invariants
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Veryfying Parameterized Networks using Abstraction and Regular Languages
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Efficiency of Token-Passing MUTEX-Solutions - Some Experiments
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Using Compositional Preorders in the Verification of Sliding Window Protocal
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
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
| Hi-index | 0.01 |
We introduce partial S-invariants of Petri nets, which can help to determine invariants and to prove safety if large nets are built from smaller ones using parallel composition withsync hronous communication. Partial S-invariants can support compositional reduction and, in particular, the fixed-point approach, used for verifying infinite parameterized families of concurrent systems. Withpartial S-invariants and the fixed-point approach we prove the correctness of two solutions to the MUTEX-problem based on token rings; for this, we only have to prove liveness of a simplified version due to previous results.