scientific article; zbMATH DE number 7561313

DOI10.4230/LIPIcs.FSTTCS.2018.8MaRDI QIDQ5090941

Shankara Narayanan Krishna, Shaan Vaidya, Mohamed Faouzi Atig, Parosh Aziz Abdulla

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

reachabilitytimed automataasynchronous programs

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• A theory of timed automata
• The theory of well-quasi-ordering: a frequently discovered concept
• A Perfect Model for Bounded Verification
• The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
• Analyzing Asynchronous Programs with Preemption
• Interprocedural analysis of asynchronous programs
• Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
• Analyzing Real-Time Event-Driven Programs
• Verification of Asynchronous Programs with Nested Locks
• Delay-bounded scheduling
• Applications and Theory of Petri Nets 2005
• Model Checking Multithreaded Programs with Asynchronous Atomic Methods
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: