The following pages link to PAT (Q25173):
Displaying 33 items.
- Modelling timed reactive systems from natural-language requirements (Q315301) (← links)
- Formalising concurrent UML state machines using coloured Petri nets (Q315307) (← links)
- Parameter synthesis for hierarchical concurrent real-time systems (Q488231) (← links)
- Verification of population protocols (Q523133) (← links)
- Enabling synchronous and asynchronous communications in CSP for SOC (Q530849) (← links)
- A semantics for behavior trees using CSP with specification commands (Q549693) (← links)
- Towards verification of computation orchestration (Q736807) (← links)
- A formal semantics of extended hierarchical state transition matrices using CSP\# (Q736828) (← links)
- A sublinear Sudoku solution in cP systems and its formal verification (Q821319) (← links)
- SeVe: automatic tool for verification of security protocols (Q1762179) (← links)
- A UTP semantics for communicating processes with shared variables and its formal encoding in PVS (Q1798665) (← links)
- Formal verification of cP systems using PAT3 and ProB (Q1982961) (← links)
- The complexity of verifying population protocols (Q2025857) (← links)
- A process calculus BigrTiMo of mobile systems and its formal semantics (Q2026376) (← links)
- Towards efficient verification of population protocols (Q2058386) (← links)
- Sound reasoning in \textit{tock}-CSP (Q2120813) (← links)
- Fundamentals of logic and computation. With practical automated reasoning and verification (Q2240968) (← links)
- Model checking approach to automated planning (Q2248102) (← links)
- Formal analysis of fairness for optimistic multiparty contract signing protocol (Q2336896) (← links)
- Advances in parameterized verification of population protocols (Q2399358) (← links)
- Model checking with fairness assumptions using PAT (Q2418662) (← links)
- Formal analysis of composable DeFi protocols (Q2670830) (← links)
- Proving Liveness Property under Strengthened Compassion Requirements (Q2898061) (← links)
- Model Checking under Fairness in ProB and Its Application to Fair Exchange Protocols (Q2915106) (← links)
- Model Checking LTLR Formulas under Localized Fairness (Q3164834) (← links)
- An Efficient Algorithm for Learning Event-Recording Automata (Q3172935) (← links)
- Process Algebra and Model Checking (Q3176390) (← links)
- Parametric Deadlock-Freeness Checking Timed Automata (Q3179417) (← links)
- Improved BDD-Based Discrete Analysis of Timed Systems (Q4647854) (← links)
- What’s Decidable About Parametric Timed Automata? (Q4686606) (← links)
- A Process Algebra Based Strategy for Generating Test Vectors from SCR Specifications (Q5200477) (← links)
- An Overview of the mCRL2 Toolset and Its Recent Advances (Q5326326) (← links)
- Towards a Combination of CafeOBJ and PAT (Q5403071) (← links)
