Pages that link to "Item:Q1600655"

The following pages link to An improvement of McMillan's unfolding algorithm (Q1600655):

Displaying 45 items.

• What topology tells us about diagnosability in partial order semantics (Q351726) (← links)
• Efficient semantics-based compliance checking using LTL formulae and unfolding (Q364600) (← links)
• Computing the reveals relation in occurrence nets (Q391112) (← links)
• Recent advances in unfolding technique (Q403021) (← links)
• The sweep-line state space exploration method (Q418783) (← links)
• Efficient unfolding of contextual Petri nets (Q443729) (← links)
• Control of safe ordinary Petri nets using unfolding (Q816699) (← links)
• Model checking \(\omega \)-regular properties with decoupled search (Q832281) (← links)
• Merged processes: a new condensed representation of Petri net behaviour (Q854679) (← links)
• Verification of bounded Petri nets using integer programming (Q878111) (← links)
• Untanglings: a novel approach to analyzing concurrent systems (Q903488) (← links)
• A theory of structural stationarity in the \(\pi\)-calculus (Q1014276) (← links)
• STG decomposition strategies in combination with unfolding (Q1031867) (← links)
• Multilevel transitive and intransitive non-interference, causally (Q1680560) (← links)
• Star-topology decoupled state space search (Q1749386) (← links)
• Spreading nets: a uniform approach to unfoldings (Q1987731) (← links)
• Detection of temporal anomalies for partially observed timed PNs (Q1992544) (← links)
• Pomset bisimulation and unfolding for reset Petri nets (Q2113378) (← links)
• Unfolding of parametric Boolean networks (Q2130572) (← links)
• Verification of concurrent programs using Petri net unfoldings (Q2234071) (← links)
• Symbolic unfolding of parametric stopwatch Petri nets (Q2248088) (← links)
• QoS-aware management of monotonic service orchestrations (Q2248094) (← links)
• On the well-foundedness of adequate orders used for construction of complete unfolding prefixes (Q2380011) (← links)
• Parameter space abstraction and unfolding semantics of discrete regulatory networks (Q2422012) (← links)
• Trellis processes: a compact representation for runs of concurrent systems (Q2465670) (← links)
• Realizability of Schedules by Stochastic Time Petri Nets with Blocking Semantics (Q2822654) (← links)
• Process Mining Reloaded: Event Structures as a Unified Representation of Process Models and Event Logs (Q2941141) (← links)
• An Algorithm for Direct Construction of Complete Merged Processes (Q3011883) (← links)
• Efficient Contextual Unfolding (Q3090840) (← links)
• Unfolding Graph Transformation Systems: Theory and Applications to Verification (Q3507354) (← links)
• Directed Unfolding of Petri Nets (Q3599218) (← links)
• McMillan’s Complete Prefix for Contextual Nets (Q3599219) (← links)
• Critical Paths in the Partial Order Unfolding of a Stochastic Petri Net (Q3648819) (← links)
• A structural approach for the analysis of Petri Nets by reduced unfoldings (Q4633172) (← links)
• (Q5090956) (← links)
• (Q5111631) (← links)
• Flow Unfolding of Multi-clock Nets (Q5166763) (← links)
• Construction and SAT-Based Verification of Contextual Unfoldings (Q5200078) (← links)
• Merging Relations: A Way to Compact Petri Nets’ Behaviors Uniformly (Q5739008) (← links)
• Star-Topology Decoupling in SPIN (Q5883577) (← links)
• A Practical Approach to Verification of Mobile Systems Using Net Unfoldings (Q5900141) (← links)
• Cut-off theorems for the \textit{PV}-model (Q6108429) (← links)
• Taking complete finite prefixes to high level, symbolically (Q6535189) (← links)
• Computing a parametric reveals relation for bounded equal-conflict Petri nets (Q6550563) (← links)
• Taking complete finite prefixes to high level, symbolically (Q6622143) (← links)