Showing 1–20 of 21 results
/ Date/ Name
Jan 14, 2022The complexity of soundness in workflow netsSep 6, 2022Separators in Continuous Petri NetsOct 10, 2019Succinct Population Protocols for Presburger ArithmeticOct 15, 2020Directed Reachability for Infinite-State SystemsMar 13, 2017Towards Efficient Verification of Population ProtocolsJan 2, 2018Large Flocks of Small Birds: On the Minimal Size of Population ProtocolsNov 26, 2024Weakly acyclic diagrams: A data structure for infinite-state symbolic verificationJul 1, 2018Automatic Analysis of Expected Termination Time for Population ProtocolsJan 28, 2021Continuous One-Counter AutomataOct 19, 2017Forward Analysis for WSTS, Part III: Karp-Miller TreesSep 5, 2019The Complexity of Reachability in Affine Vector Addition Systems with StatesFeb 5, 2019Expressive Power of Broadcast Consensus ProtocolsMay 7, 2020Checking Qualitative Liveness Properties of Replicated Systems with Stochastic SchedulingJun 6, 2022Verifying generalised and structural soundness of workflow nets via relaxationsApr 26, 2023Verifying linear temporal specifications of constant-rate multi-mode systemsDec 13, 2014Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-completeSep 26, 2019Affine Extensions of Integer Vector Addition Systems with StatesMay 1, 2023Population Protocols with Unordered DataOct 20, 2015Approaching the Coverability Problem ContinuouslyAug 8, 2016Well Behaved Transition Systems