`True concurrency' semantics for time Petri nets with weak time and persistent atomic policies

DOI10.1134/S0361768821050078zbMath1483.68237OpenAlexW3200696153WikidataQ113434474 ScholiaQ113434474MaRDI QIDQ2664520

Yanyan Li

Publication date: 17 November 2021

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0361768821050078

zbMATH Keywords

timed Petri nets

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Comparative trace semantics of time Petri nets
• A causal semantic for time Petri nets
• Back in Time Petri Nets
• Time and Petri Nets
• Weak Time Petri Nets Strike Back!
• Comparison of the Expressiveness of Arc, Place and Transition Time Petri Nets
• Recoverability of Communication Protocols--Implications of a Theoretical Study
• True Concurrent Equivalences in Time Petri Nets*
• On Multi-enabledness in Time Petri Nets
• Automated Technology for Verification and Analysis
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: `True concurrency' semantics for time Petri nets with weak time and persistent atomic policies