Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems
From MaRDI portal
Publication:4603575
DOI10.1007/978-3-319-44878-7_14zbMath1433.68058arXiv1606.07886OpenAlexW2471389158MaRDI QIDQ4603575
Tajana Ban Kirigin, Vivek Nigam, Max I. Kanovich, Carolyn L. Talcott, Andrej Scedrov
Publication date: 16 February 2018
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.07886
Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)
Related Items (2)
On the complexity of verification of time-sensitive distributed systems ⋮ A semantic model for interacting cyber-physical systems
This page was built for publication: Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems
