Model checking of systems with many identical timed processes
From MaRDI portal
Publication:1853589
DOI10.1016/S0304-3975(01)00330-9zbMATH Open1018.68046OpenAlexW2021255060MaRDI QIDQ1853589FDOQ1853589
Authors: Parosh A. Abdulla, Bengt Jonsson 
Publication date: 21 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00330-9
Recommendations
Cites Work
- Reasoning about systems with many processes
- A really temporal logic
- Deciding properties of integral relational automata
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reduction and covering of infinite reachability trees
- Algorithmic analysis of programs with well quasi-ordered domains.
- Verifying programs with unreliable channels
- Undecidable verification problems for programs with unreliable channels
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ordering by Divisibility in Abstract Algebras
- Hybrid automata with finite bisimulations
- Title not available (Why is that?)
- Recoverability of Communication Protocols--Implications of a Theoretical Study
- Deciding bisimulation equivalences for a class of non-finite-state programs
- A structural induction theorem for processes
- Decidability of a temporal logic problem for Petri nets
- Using partial orders for the efficient verification of deadlock freedom and safety properties
- Title not available (Why is that?)
- Decidability of bisimulation equivalence for normed pushdown processes
- Petri nets, commutative context-free grammars, and basic parallel processes
- Title not available (Why is that?)
Cited In (25)
- Title not available (Why is that?)
- Timed automata with disjoint activity
- CONCUR 2004 - Concurrency Theory
- Communicating Timed Automata: The More Synchronous, the More Difficult to Verify
- On the Verification of Timed Ad Hoc Networks
- Formal Modeling and Analysis of Timed Systems
- Nested timed automata with frozen clocks
- Parameterized model checking of weighted networks
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Controlling a population
- Well (and better) quasi-ordered transition systems
- Universal safety for timed Petri nets is PSPACE-complete
- Accuracy of message counting abstraction in fault-tolerant distributed algorithms
- Closed, open, and robust timed networks
- Formal Modeling and Analysis of Timed Systems
- Parameterized model checking of networks of timed automata with Boolean guards
- Liveness of parameterized timed networks
- Network invariants for real-time systems
- Network invariants for real-time systems
- Parameterized verification of time-sensitive models of ad hoc network protocols
- Cardinality constraints for arrays (decidability results and applications)
- Reachability of communicating timed processes
- Monotonic Abstraction for Programs with Dynamic Memory Heaps
- Timed Basic Parallel Processes
- On the complexity of verification of time-sensitive distributed systems
Uses Software
This page was built for publication: Model checking of systems with many identical timed processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853589)
