Towards a consistent semantics for unsafe time Petri nets

DOI10.1007/978-3-642-10619-4_6MaRDI QIDQ5305757zbMATH OpenOpenAlexFDO

Authors Abdelkrim Abdelli

Publication date 23 March 2010

Published in Advances in Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10619-4_6

zbMATH Keywords

monoserver hypothesis

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Automated Technology for Verification and Analysis
• A causal semantic for time Petri nets
• On Multi-enabledness in Time Petri Nets
• Time processes for time Petri nets
• scientific article; zbMATH DE number 1836371

Cited in

(7)

• `True concurrency' semantics for time Petri nets with weak time and persistent atomic policies
• Back in time Petri nets
• Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
• Consistent timed semantics for nested Petri nets with restricted urgency
• scientific article; zbMATH DE number 1836371 (Why is no real title available?)
• Towards a general model to handle multi-enabledness in time Petri nets
• Automated Technology for Verification and Analysis

This page was built for publication: Towards a consistent semantics for unsafe time Petri nets

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