Formal Techniques for Networked and Distributed Systems - FORTE 2005
From MaRDI portal
Publication:5479174
DOI10.1007/11562436zbMath1169.68502OpenAlexW2915402656MaRDI QIDQ5479174
Yann Thierry-Mieg, Jean-Michel Couvreur
Publication date: 7 July 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11562436
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (8)
A decision diagram operation for reachability ⋮ Improving Saturation Efficiency with Implicit Relations ⋮ Hierarchical Set Decision Diagrams and Automatic Saturation ⋮ Symbolic coloured SCC decomposition ⋮ Crocodile: A Symbolic/Symbolic Tool for the Analysis of Symmetric Nets with Bag ⋮ Unnamed Item ⋮ Hierarchical Set Decision Diagrams and Regular Models ⋮ A lazy query scheme for reachability analysis in Petri nets
Uses Software
This page was built for publication: Formal Techniques for Networked and Distributed Systems - FORTE 2005
