Compositional Reachability Analysis of Finite-State Distributed Systems With User-Specified Constraints

doi 10.1145/222124.222149

Full Text

Abstract

Available in

Date

Authors

Publisher

ACM Press

Related search

Reachability Analysis on Distributed Executions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Compositional Verification of Reactive Systems Specified by Graph Transformation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Checking Subsystem Safety Properties in Compositional Reachability Analysis

English

Reachability Analysis for Some Models of Infinite-State Transition Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

Compositional Reachability in Petri Nets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Reachability Analysis of Communicating Pushdown Systems

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Minimal Controllability Time for Finite-Dimensional Control Systems Under State Constraints

Automatica
ControlSystems EngineeringElectricalElectronic Engineering
2018English

Reachability Analysis of Hybrid Systems via Predicate Abstraction

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Robust Nonlinear Control Design of Distributed Process Systems With Input Constraints

IFAC Proceedings Volumes
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy