The following pages link to (Q2760246):
Displaying 47 items.
- Bounded situation calculus action theories (Q286407) (← links)
- Progression and verification of situation calculus agents with bounded beliefs (Q310089) (← links)
- Reducing behavioural to structural properties of programs with procedures (Q385023) (← links)
- Undecidability of performance equivalence of Petri nets (Q507373) (← links)
- Partially-commutative context-free processes: expressibility and tractability (Q532392) (← links)
- Reasoning about sequences of memory states (Q636268) (← links)
- Turing machines, transition systems, and interaction (Q703844) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Model independent approach to probabilistic models (Q831149) (← links)
- Complete symbolic reachability analysis using back-and-forth narrowing (Q860885) (← links)
- Decidability issues for extended ping-pong protocols (Q861694) (← links)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
- Theory of interaction (Q896903) (← links)
- Compositional verification of sequential programs with procedures (Q937300) (← links)
- Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm (Q958302) (← links)
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- Reachability is decidable for weakly extended process rewrite systems (Q1023281) (← links)
- Types and trace effects for object orientation (Q1029806) (← links)
- The complexity of bisimilarity-checking for one-counter processes. (Q1401395) (← links)
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (Q1763731) (← links)
- A brief history of process algebra (Q1781995) (← links)
- Simulation preorder over simple process algebras (Q1854513) (← links)
- Complexity of deciding bisimilarity between normed BPA and normed BPP (Q1959482) (← links)
- Bisimilarity on basic parallel processes (Q2072066) (← links)
- Characteristic invariants in Hennessy-Milner logic (Q2182678) (← links)
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems (Q2272985) (← links)
- Bounded model checking of infinite state systems (Q2369883) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- Deciding probabilistic bisimilarity over infinite-state probabilistic systems (Q2482725) (← links)
- A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
- Decidability of performance equivalence for basic parallel processes (Q2503324) (← links)
- Model checking for process rewrite systems and a class of action-based regular properties (Q2503332) (← links)
- Decidable first-order transition logics for PA-processes (Q2575856) (← links)
- Narrowing and Rewriting Logic: from Foundations to Applications (Q2873786) (← links)
- Partially-Commutative Context-Free Processes (Q3184678) (← links)
- CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence (Q3498448) (← links)
- On Recursion, Replication and Scope Mechanisms in Process Calculi (Q3525112) (← links)
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
- Normed BPA vs. Normed BPP Revisited (Q3541036) (← links)
- (Q4558784) (← links)
- An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems (Q4917080) (← links)
- Turing Machines, Transition Systems, and Interaction (Q4917087) (← links)
- Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences (Q5179048) (← links)
- On Decidability of LTL+Past Model Checking for Process Rewrite Systems (Q5179053) (← links)
- Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity (Q5875352) (← links)
- Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems (Q5892174) (← links)
- Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems (Q5894255) (← links)
