Cited in
(62)- Advances in parameterized verification of population protocols
- Formal analysis of fairness for optimistic multiparty contract signing protocol
- Formal analysis of composable DeFi protocols
- Sound reasoning in \textit{tock}-CSP
- Towards a combination of CafeOBJ and PAT
- Improved BDD-based discrete analysis of timed systems
- A semantics for behavior trees using CSP with specification commands
- Parametric Deadlock-Freeness Checking Timed Automata
- SeVe: automatic tool for verification of security protocols
- A sublinear Sudoku solution in cP systems and its formal verification
- A process calculus BigrTiMo of mobile systems and its formal semantics
- Model checking approach to automated planning
- A formal semantics of extended hierarchical state transition matrices using CSP\#
- Towards verification of computation orchestration
- Parameter synthesis for hierarchical concurrent real-time systems
- Model checking under fairness in ProB and its application to fair exchange protocols
- Model checking LTLR formulas under localized fairness
- IMITATOR
- Rabbit
- TAXYS
- VINAS-P
- APTS
- TINA
- TCOZ
- Maria
- Uppaal
- Casper
- SeVe
- ProB
- LTSmin
- LearnLib
- Dist-Orc
- JITty
- SMI++
- LinAIG
- LTSA-WS
- CSP-prover
- Shrinktech
- ERA-PAT
- Synthia
- PTSC
- Papyrus
- REDLIB
- MARTE
- P-Lingua
- ITS-Tools
- PSyHCoS
- The complexity of verifying population protocols
- Model checking with fairness assumptions using PAT
- Formal verification of cP systems using PAT3 and ProB
- An efficient algorithm for learning event-recording automata
- Formalising concurrent UML state machines using coloured Petri nets
- Modelling timed reactive systems from natural-language requirements
- Fundamentals of logic and computation. With practical automated reasoning and verification
- An overview of the mCRL2 toolset and its recent advances
- Verification of population protocols
- A UTP semantics for communicating processes with shared variables and its formal encoding in PVS
- Enabling synchronous and asynchronous communications in CSP for SOC
- Proving liveness property under strengthened compassion requirements
- Process algebra and model checking
- A Process Algebra Based Strategy for Generating Test Vectors from SCR Specifications
- What's decidable about parametric timed automata?
This page was built for software: PAT
