scientific article; zbMATH DE number 7561313
From MaRDI portal
Publication:5090941
DOI10.4230/LIPICS.FSTTCS.2018.8MaRDI QIDQ5090941FDOQ5090941
Authors: Mohamed Faouzi Atig, Shankara Narayanan Krishna, S. Vaidya, Parosh A. Abdulla 
Publication date: 21 July 2022
Title of this publication is not available (Why is that?)
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Cites Work
- A theory of timed automata
- Title not available (Why is that?)
- The theory of well-quasi-ordering: a frequently discovered concept
- Ordering by Divisibility in Abstract Algebras
- Delay-bounded scheduling
- Model Checking Multithreaded Programs with Asynchronous Atomic Methods
- A Perfect Model for Bounded Verification
- The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
- Interprocedural analysis of asynchronous programs
- Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
- Analyzing Real-Time Event-Driven Programs
- Applications and Theory of Petri Nets 2005
- Analyzing Asynchronous Programs with Preemption
- Verification of Asynchronous Programs with Nested Locks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090941)
