POEM

swMATH3469MaRDI QIDQ16001FDOQ16001

Author name not available (Why is that?)

Official website: https://doi.org/10.1007/11901914_37

Described by source

• The Implementation of Mazurkiewicz Traces in POEM

Cited In (10)

• Zone-based verification of timed automata: extrapolations, simulations and what next?
• Unfoldings: A partial-order approach to model checking.
• Using non-convex approximations for efficient analysis of timed automata
• Exploiting step semantics for efficient bounded model checking of asynchronous systems
• Stronger Reduction Criteria for Local First Search
• Punf
• Checkfence
• SAT based bounded model checking with partial order semantics for timed automata
• REDLIB
• A Nice labelling for tree-like event structures of degree 3

This page was built for software: POEM