Liveness of Parameterized Timed Networks

DOI10.1007/978-3-662-47666-6_30zbMath1440.68170arXiv1609.04176OpenAlexW2296248291MaRDI QIDQ3449490

Florian Zuleger, Francesco Spegni, Sasha Rubin, Benjamin Aminof

Publication date: 4 November 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.04176

Mathematics Subject Classification ID

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

Related Items (8)

Parameterized model checking of rendezvous systems ⋮ Verification of agent navigation in partially-known environments ⋮ Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms ⋮ The polynomial complexity of vector addition systems with states ⋮ Deciding Fast Termination for Probabilistic VASS with Nondeterminism ⋮ Universal safety for timed Petri nets is PSPACE-complete ⋮ Parameterized model checking of networks of timed automata with Boolean guards ⋮ Model Checking Parameterised Multi-token Systems via the Composition Method

Cites Work

• Unnamed Item
• Unnamed Item
• Parameterised verification for multi-agent systems
• Timed verification of the generic architecture of a memory circuit using parametric timed automata
• Proving properties of a ring of finite-state machines
• Model checking of systems with many identical timed processes
• Parameterized Model Checking of Token-Passing Systems
• Beyond $\omega$-Regular Languages
• Parameterized Model Checking of Rendezvous Systems
• Parameterized Verification of Ad Hoc Networks
• Reasoning about systems with many processes

This page was built for publication: Liveness of Parameterized Timed Networks