Decidability of safety properties of timed multiset rewriting

DOI10.1007/3-540-45739-9_12MaRDI QIDQ5392289zbMATH OpenOpenAlexFDO

Authors Mitsuharu Yamamoto, Jean-Marie Cottin, Masami Hagiya

Publication date 8 April 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45739-9_12

zbMATH Keywords

decidabilityreal-time systemstimed automatatimed Petri nets

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Depth boundedness in multiset rewriting systems with name binding
• scientific article; zbMATH DE number 1696456
• Dynamic networks of timed Petri nets
• scientific article; zbMATH DE number 1070625
• Undecidability of coverability and boundedness for timed-arc Petri nets with invariants

Cited in

(3)

• Depth boundedness in multiset rewriting systems with name binding
• Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems
• Multiset rewriting for the verification of depth-bounded processes with name binding

This page was built for publication: Decidability of safety properties of timed multiset rewriting

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