Compositional State Space Reduction Using Untangled Actions

TL;DR: A method of analysis for a class of Petri nets called parallel process net with resources (PPNRs) is presented, based on reduced reachability graph (RRG) of PPNRs to verify the correspondence between required specification of manufacturing system and its PN representation.

TL;DR: This paper develops a theoretical basis for using process algebra and associated model checking tools to verify asynchronous circuits and shows how the model can be translated into CSP, and how the satisfaction of safeness and progress requirements can be reduced to refinement checks in CSP.

TL;DR: In this paper, the weakest livelock-preserving congruence is defined and compared to Hoare's failures-divergences equivalence in the CSP theory.

TL;DR: This work presents a capability calculus for checking partial confluence of channel-communicating concurrent processes, which automatically detects more programs to be partially confluent than previous approaches and is able to handle a mix of different kinds of communication channels.

TL;DR: Algorithmic Learning Theory Akira Marouka and Eiji Takimoto Augmented Reality Reinhold Behringer Chinese Text Spelling Check and Configuration Kin Hong Lee, Qin Lu, and Mau Kit, and Hai Jin Cluster Computing and Application, and Evaluation of Software Systems.

TL;DR: This work combines both approaches and develops a method for using partial-order reduction techniques in symbolic BDD-based invariant checking, and presents theoretical results to prove the correctness of the method, and experimental results to demonstrate its efficacy.

TL;DR: In this paper, several notions for confluence in processes and how these relate to τ-inertness are provided. But these notions can conveniently be used to simplify the structure of processes while preserving equivalence.