Rewriting logic as a unifying framework for Petri nets
From MaRDI portal
Recommendations
- Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework
- Rewriting logic and Elan: Prototyping tools for Petri nets with time
- scientific article; zbMATH DE number 3921987
- Coding mobile synchronizing Petri nets into rewriting logic
- Rewriting logic and Maude: Concepts and applications
Cited in
(26)- Specification of real-time and hybrid systems in rewriting logic
- Rewriting logic: Roadmap and bibliography
- A natural semantic framework for ECATNets
- Twenty years of rewriting logic
- Programming and symbolic computation in Maude
- Semantic foundations for generalized rewrite theories
- Tiling transactions in rewriting logic
- Coding mobile synchronizing Petri nets into rewriting logic
- Expander2: program verification between interaction and automation
- A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems
- Probabilistic real-time rewrite theories and their expressive power
- Component-Based Security Policy Design with Colored Petri Nets
- Model checking reconfigurable Petri nets with Maude
- Verifiable abstractions for contract-oriented systems
- scientific article; zbMATH DE number 3921987 (Why is no real title available?)
- Rewriting logic and Elan: Prototyping tools for Petri nets with time
- Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework
- A Non-Deterministic Multiset Query Language
- Modular rewritable Petri nets: an efficient model for dynamic distributed systems
- Session-based concurrency in Maude: executable semantics and type checking
- Canonization of reconfigurable PT nets in \texttt{Maude}
- Symbolic analysis and parameter synthesis for time Petri nets using Maude and SMT solving
- A rewriting-logic-with-SMT-based formal analysis and parameter synthesis framework for parametric time Petri nets
- Formalization and analysis of the post-quantum signature scheme FALCON with Maude
- Multiset rewriting for the verification of depth-bounded processes with name binding
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
This page was built for publication: Rewriting logic as a unifying framework for Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4421726)