Symbolic transition graph with assignment

DOI10.1007/3-540-61604-7_47zbMath1515.68211OpenAlexW1522645051MaRDI QIDQ6104365

Huimin Lin

Publication date: 28 June 2023

Published in: CONCUR '96: Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61604-7_47

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

SMT-based generation of symbolic automata ⋮ Theory of interaction ⋮ Compositional equivalences based on open pNets ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Computing strong and weak bisimulations for psi-calculi ⋮ Verification of reactive systems via instantiation of parameterised Boolean equation systems

Cites Work

• Unnamed Item
• Symbolic bisimulations
• A proof system for communicating processes with value-passing
• A lattice-theoretical fixpoint theorem and its applications

This page was built for publication: Symbolic transition graph with assignment