The following pages link to (Q4953875):
Displayed 19 items.
- Proactive communicating process with asymmetry in multiagent systems (Q364551) (← links)
- An equivalent CTL formulation for condition sequences (Q816698) (← links)
- Data structures for symbolic multi-valued model-checking (Q862857) (← links)
- Connectionist modal logic: representing modalities in neural networks (Q870254) (← links)
- Greening R. Thomas' framework with environment variables: a divide and conquer approach (Q2142101) (← links)
- Application of formal methods to biological regulatory networks: extending Thomas' asynchronous logical approach with temporal logic (Q2189295) (← links)
- Computation tree logic model checking based on multi-valued possibility measures (Q2213111) (← links)
- Automatic workflow verification and generation (Q2368986) (← links)
- Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams (Q2372185) (← links)
- Connectionist computations of intuitionistic reasoning (Q2503271) (← links)
- Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information (Q2805170) (← links)
- Formal Verification of Object-Oriented Graph Grammars Specifications (Q2867893) (← links)
- Algebra, Proof Theory and Applications for a Logic of Propositions, Actions and Adjoint Modal Operators (Q3178281) (← links)
- Abstracting and Verifying Strategy-Proofness for Auction Mechanisms (Q3601792) (← links)
- Adequate Sets of Temporal Connectives in CTL (Q4917081) (← links)
- On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs (Q5200103) (← links)
- Verifying Procedural Programs via Constrained Rewriting Induction (Q5278212) (← links)
- On some generalization of rough sets (Q6064262) (← links)
- Constrained Kripke structure for identifying parameters of biological models (Q6131194) (← links)