Symbolic transition graph with assignment
From MaRDI portal
Publication:6104365
DOI10.1007/3-540-61604-7_47zbMath1515.68211MaRDI QIDQ6104365
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
68Q55: Semantics in the theory of computing
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
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, Theory of interaction, SMT-based generation of symbolic automata, Compositional equivalences based on open pNets
Cites Work