Compositional minimization of finite state systems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 177239
- scientific article; zbMATH DE number 1799526
- Compositional minimisation of finite state systems using interface specifications
- Minimizing the number of transitions with respect to observation equivalence
- On-the-Fly Branching Bisimulation Minimization for Compositional Analysis
Cited in
(27)- Minimizing the number of transitions with respect to observation equivalence
- Minimal state graph generation
- Using partial orders for the efficient verification of deadlock freedom and safety properties
- Compositional minimisation of finite state systems using interface specifications
- Iterating transducers
- Compositional verification of concurrent systems by combining bisimulations
- On the computation of counterexamples in compositional nonblocking verification
- Cartesian difference categories
- Compositional verification of asynchronous concurrent systems using CADP
- A framework for compositional nonblocking verification of extended finite-state machines
- Context-dependent minimization of state/event systems
- Interaction abstraction for compositional finite state systems
- Compositional failure-based equivalence of constraint automata
- Compositional minimization in Span(Graph): some examples
- Compositional reasoning
- scientific article; zbMATH DE number 177239 (Why is no real title available?)
- scientific article; zbMATH DE number 177241 (Why is no real title available?)
- Compositional state space generation with partial order reductions for asynchronous communicating systems
- Compositional synthesis of supervisors in the form of state machines and state maps
- Minimality Notions via Factorization Systems and Examples
- Sharp congruences adequate with temporal logics combining weak and strong modalities
- Progressive events in supervisory control and compositional verification
- On-the-Fly Branching Bisimulation Minimization for Compositional Analysis
- A survey on compositional algorithms for verification and synthesis in supervisory control
- Equivalence checking 40 years after: a review of bisimulation tools
- Compositional verification of concurrent systems by combining bisimulations
- Unified bisimulation applied to incremental abstraction of Petri nets
This page was built for publication: Compositional minimization of finite state systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037383)
