Pages that link to "Item:Q922711"
From MaRDI portal
The following pages link to An implementation of an efficient algorithm for bisimulation equivalence (Q922711):
Displaying 40 items.
- Conflict-preserving abstraction of discrete event systems using annotated automata (Q351736) (← links)
- Maximally permissive coordinated distributed supervisory control of nondeterministic discrete-event systems (Q445939) (← links)
- Computing maximal weak and other bisimulations (Q510897) (← links)
- Game-theoretic simulation checking tool (Q764005) (← links)
- Stepwise development of process-algebraic specifications in decorated trace semantics (Q816202) (← links)
- Symbolic models for control systems (Q868433) (← links)
- Nonconflict check by using sequential automaton abstractions based on weak observation equivalence (Q976261) (← links)
- Bisimulation and effectiveness (Q1118393) (← links)
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time (Q1128976) (← links)
- Minimizing the number of transitions with respect to observation equivalence (Q1182610) (← links)
- Essential transitions to bisimulation equivalences (Q1391753) (← links)
- Program constructions that are safe for bisimulation (Q1577351) (← links)
- Bisimulation indexes and their applications (Q1606119) (← links)
- Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types (Q1770362) (← links)
- A partition refinement algorithm for the \(\pi\)-calculus (Q1854406) (← links)
- Iterating transducers (Q1858440) (← links)
- An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
- Deciding bisimilarity and similarity for probabilistic processes. (Q1975973) (← links)
- Reduced-order observer design for fault diagnosis of Boolean control networks (Q2097771) (← links)
- Employing behavioral preorders to define controllability for nondeterministic discrete-event systems (Q2348368) (← links)
- Generating BDDs for symbolic model checking in CCS (Q2365568) (← links)
- Control protocol synthesis for multi-agent systems with similar actions instantiated from agent and requirement templates (Q2409354) (← links)
- Verifying chemical reaction network implementations: a bisimulation approach (Q2422008) (← links)
- Divergent stutter bisimulation abstraction for controller synthesis with linear temporal logic specifications (Q2665348) (← links)
- A tableau construction for finite linear-time temporal logic (Q2669249) (← links)
- An efficient fully symbolic bisimulation algorithm for non-deterministic systems (Q2842000) (← links)
- Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains (Q3523111) (← links)
- On Bisimilarity and Substitution in Presence of Replication (Q3587460) (← links)
- Bisimilarity Minimization in O(m logn) Time (Q3636842) (← links)
- (Q4037401) (← links)
- Compositionality in state space verification methods (Q4633153) (← links)
- Morphisms and Minimisation of Weighted Automata (Q5038573) (← links)
- A Study on Team Bisimulations for BPP Nets (Q5100755) (← links)
- (Q5146599) (← links)
- COMPOSITIONAL VERIFICATION OF THE GENERALIZED NONBLOCKING PROPERTY USING ABSTRACTION AND CANONICAL AUTOMATA (Q5168410) (← links)
- An <i>O</i> ( <i>m</i> log <i>n</i> ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation (Q5278211) (← links)
- Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking (Q5415660) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703795) (← links)
- On the computation of natural observers in discrete-event systems (Q5962024) (← links)
- A survey on compositional algorithms for verification and synthesis in supervisory control (Q6080680) (← links)