Verification of scenarios in Petri nets using compact tokenflows

DOI10.3233/FI-2015-1172MaRDI QIDQ2805422zbMATH OpenOpenAlexFDO

Authors Robin Bergenthum, Robert Lorenz

Publication date 11 May 2016

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2015-1172

zbMATH Keywords

verificationinhibitorscenarioPetri netlabelled partial orderlabelled stratified order structuretokenflow

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Faster verification of partially ordered runs in Petri nets using compact tokenflows
• Executability of scenarios in Petri nets
• Towards Synthesis of Petri Nets from Scenarios
• Oclets – Scenario-Based Modeling with Petri Nets
• Applications and Theory of Petri Nets 2005
• Data and abstraction for scenario-based modeling with Petri nets
• scientific article; zbMATH DE number 177243
• Some results on Petri net languages
• Construction and SAT-based verification of contextual unfoldings

Cited in

(7)

• Executability of scenarios in Petri nets
• Firing partial orders in a Petri net
• Applications and Theory of Petri Nets 2005
• Faster verification of partially ordered runs in Petri nets using compact tokenflows
• Token trail semantics -- modeling behavior of Petri nets with labeled Petri nets
• Oclets – Scenario-Based Modeling with Petri Nets
• Data and abstraction for scenario-based modeling with Petri nets

This page was built for publication: Verification of scenarios in Petri nets using compact tokenflows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805422)