NEXUS
发表于 2025-3-23 10:13:26
Proving Behavioural Apartness, on bisimilarity requires an infinite quantification over couplings, whereas behavioural apartness instantiates to a finite rule. In addition, we provide optimised proof rules for behavioural apartness and show their use in several examples.
flutter
发表于 2025-3-23 16:20:24
http://reply.papertrans.cn/25/2422/242183/242183_12.png
galley
发表于 2025-3-23 21:12:53
,A Compositional Framework for Petri Nets,a graphical language of morphisms in a PROP and a semantic category that describes the evolution of markings in a Petri net. Compared to previous work, the novelty is that computations in a Petri net are stateful, requiring specific care. This framework allows us to solve reachability compositionally.
Genistein
发表于 2025-3-23 23:15:22
Type 2: Violent Rapists and Sexual Predators on bisimilarity requires an infinite quantification over couplings, whereas behavioural apartness instantiates to a finite rule. In addition, we provide optimised proof rules for behavioural apartness and show their use in several examples.
正式演说
发表于 2025-3-24 03:52:37
,Coalgebraic CTL: Fixpoint Characterization and Polynomial-Time Model Checking,ur logic can be used to formalize properties of systems modeled as coalgebras with branching. We present the syntax and path-based semantics of CCTL, and show how to encode this logic into a coalgebraic fixpoint logic with a step-wise semantics. Our main result shows that this encoding is semantics-
结束
发表于 2025-3-24 07:03:01
http://reply.papertrans.cn/25/2422/242183/242183_16.png
Crater
发表于 2025-3-24 12:40:24
,Preorder-Constrained Simulations for Program Refinement with Effects,ions of program refinement for different effects, such as exception, nondeterminism and I/O. Preorder-constrained simulation is additionally parameterised by a positive number (“look-ahead bound”), and forms a generative spectrum governed by the look-ahead bound. We analyse the complexity of determi
forestry
发表于 2025-3-24 17:38:47
,Automata in W-Toposes, and General Myhill-Nerode Theorems,de theorems in our setting, including an explicit relationship between the syntactic monoid and the transition monoid of the minimal automaton. As a special case we recover the result of Bojańczyk, Klin and Lasota [.] for orbit-finite nominal automata by considering automata in the Myhill-Schanuel t
cogitate
发表于 2025-3-24 20:16:20
http://reply.papertrans.cn/25/2422/242183/242183_19.png
爆炸
发表于 2025-3-25 00:43:40
,Explicit Hopcroft’s Trick in Categorical Partition Refinement,rithms in the literature often obscures the essence of Hopcroft’s trick. Our contribution is twofold. Firstly, we present a novel formulation of Hopcroft’s trick in terms of general trees with weights. This clean and explicit formulation—we call it .—is crucially used in our second contribution, nam