The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Deciding bisimulation equivalences for a class of non-finite-state programs
Information and Computation
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Distributed systems analysis with CCS
Distributed systems analysis with CCS
Communication and Concurrency
Checking Strong/Weak Bisimulation Equivalences and Observation Congruence for the pi-Calculus
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Symbolic Transition Graph with Assignment
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Efficient Local Correctness Checking
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming
Proceedings of the 17th International Conference on Logic Programming
Implementing Symbolic Models for Value Passing in TwoTowers
TOOLS '00 Proceedings of the 11th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
A symbolic framework for the conformance checking of value-passing choreographies
ICSOC'12 Proceedings of the 10th international conference on Service-Oriented Computing
| Hi-index | 0.00 |
We introduce an improved version of the symbolic transition graph with assignment (STGA) of Lin. The distinction of our model is that the assignment of a transition is performed after rather than before the action. Consequently, it has two advantages over the original one: on one hand, most regular value-passing processes can be represented more intuitively and compactly as such graphs; on the other hand, the natural definitions of symbolic double transitions can be given. The rules which generate the improved STGAs from regular value-passing processes are presented. The various versions (late/early, ground/symbolic) of strong operational semantics and strong bisimulation are given to such graphs, respectively. Our strong bisimulation algorithms are based on the late strong bisimulation algorithm of Lin, however, ours are more concise and practical. Finally, the improved STGAs are generalized to both symbolic observation graphs with assignments and symbolic congruence graphs with assignments, and therefore weak bisimulation equivalence and observation congruence can be checked, respectively.