Symbolic analysis and parameter synthesis for time Petri nets using Maude and SMT solving
From MaRDI portal
Publication:6535202
Recommendations
Cites work
- scientific article; zbMATH DE number 1956600 (Why is no real title available?)
- scientific article; zbMATH DE number 1973125 (Why is no real title available?)
- scientific article; zbMATH DE number 7088727 (Why is no real title available?)
- Abstract logical model checking of infinite-state systems using narrowing
- Abstraction and completeness for real-time Maude
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Canonization of reconfigurable PT nets in \texttt{Maude}
- Coloured Petri Nets
- Conditional rewriting logic as a unified model of concurrency
- Cost problems for parametric time Petri nets
- Diagnosis Using Unfoldings of Parametric Time Petri Nets
- Generalized rewrite theories, coherence completion, and symbolic methods
- Model checking reconfigurable Petri nets with Maude
- Parametric Model-Checking of Time Petri Nets with Stopwatches Using the State-Class Graph
- Parametric model-checking of stopwatch Petri nets
- Petri nets are monoids
- Precise robustness analysis of time Petri nets with inhibitor ARCS
- Rewriting modulo SMT and open system analysis
- Romeo: a parametric model-checker for Petri nets with stopwatches
- Semantics and pragmatics of real-time maude
- Specification and analysis of the AER/NCA active network protocol suite in real-time Maude
- Specification of real-time and hybrid systems in rewriting logic
- Twenty years of rewriting logic
- Verifying hierarchical Ptolemy II discrete-event models using real-time maude
Cited in
(2)
This page was built for publication: Symbolic analysis and parameter synthesis for time Petri nets using Maude and SMT solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535202)
