On the public citation graph
A technique of state space search based on unfolding
0 signed · 256 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/scj.4690221204openalex-snapshot
Acceleration of timing verification method based on time petri nets
inferredcites →https://doi.org/10.1006/inco.1994.1035openalex-snapshot
A Partial Approach to Model Checking
inferredcites →https://doi.org/10.1007/3-540-53863-1_36openalex-snapshot
Stubborn sets for reduced state space generation
inferredcites →https://doi.org/10.1007/3-540-55179-4_31openalex-snapshot
Partial-order model checking: A guide for the perplexed
inferredcites →https://doi.org/10.1007/bfb0023728openalex-snapshot
Using partial-order semantics to avoid the state explosion problem in asynchronous systems
inferredcites →https://doi.org/10.1007/bfb0023731openalex-snapshot
Using partial orders to improve automatic verification methods
inferredcites →https://doi.org/10.1016/0304-3975(81)90112-2openalex-snapshot
Petri nets, event structures and domains, part I
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1090/dimacs/003/03openalex-snapshot
Using partial-order semantics to avoid the state explosion problem in asynchronous systems
inferredcites →https://doi.org/10.1090/dimacs/003/04openalex-snapshot
A stubborn attack on state explosion
inferredcites →https://doi.org/10.1090/dimacs/003/21openalex-snapshot
Using partial orders to improve automatic verification methods
inferredcites →https://doi.org/10.7551/mitpress/6874.001.0001openalex-snapshot
Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits
inferredcites →https://doi.org/10.7907/b2dbm-s0762openalex-snapshot
The Design of a Self-timed Circuit for Distributed Mutual Exclusion
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470611647.ch13openalex-snapshot
Petri Net Unfoldings — Properties
inferred← citeshttps://doi.org/10.1002/cpe.3711openalex-snapshot
A systematic review of approaches for testing concurrent programs
inferred← citeshttps://doi.org/10.1007/10722167_37openalex-snapshot
Unfoldings of Unbounded Petri Nets
inferred← citeshttps://doi.org/10.1007/11526841_23openalex-snapshot
An Approach to Unfolding Asynchronous Communication Protocols
inferred← citeshttps://doi.org/10.1007/11562436_35openalex-snapshot
From Automata Networks to HMSCs: A Reverse Model Engineering Perspective
inferred← citeshttps://doi.org/10.1007/11589990_90openalex-snapshot
Reduced MDP Representation of a Logistical Planning Problem Using Petri-Nets
inferred← citeshttps://doi.org/10.1007/11767589_16openalex-snapshot
Infinite Process Semantics of Inhibitor Nets
inferred← citeshttps://doi.org/10.1007/11767589_8openalex-snapshot
Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
inferred← citeshttps://doi.org/10.1007/11787006_36openalex-snapshot
Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences
inferred← citeshttps://doi.org/10.1007/11813040_37openalex-snapshot
Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences Is Needed to Model-Check Traces
inferred← citeshttps://doi.org/10.1007/11901914_23openalex-snapshot
Timed Unfoldings for Networks of Timed Automata
inferred← citeshttps://doi.org/10.1007/11901914_24openalex-snapshot
Symbolic Unfoldings for Networks of Timed Automata
inferred← citeshttps://doi.org/10.1007/11901914_37openalex-snapshot
The Implementation of Mazurkiewicz Traces in POEM
inferred← citeshttps://doi.org/10.1007/11921240_8openalex-snapshot
Stronger Reduction Criteria for Local First Search
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_16openalex-snapshot
First Passage Time Analysis of Stochastic Process Algebra Using Partial Orders
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_31openalex-snapshot
A Sweep-Line Method for State Space Exploration
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_16openalex-snapshot
Reducing Model Checking from Multi-valued CTL* to CTL*
inferred← citeshttps://doi.org/10.1007/3-540-45711-9_14openalex-snapshot
Regular Event Structures and Finite Petri Nets: A Conjecture
inferred← citeshttps://doi.org/10.1007/3-540-48068-4_20openalex-snapshot
Regular Event Structures and Finite Petri Nets: The Conflict-Free Case
inferred← citeshttps://doi.org/10.1007/3-540-48153-2_24openalex-snapshot
Hazard—Freedom Checking in Speed—Independent Systems
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_18openalex-snapshot
A Complete Finite Prefix for Process Algebra
inferred← citeshttps://doi.org/10.1007/3-540-49059-0_17openalex-snapshot
Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-61042-1_40openalex-snapshot
An improvement of McMillan's unfolding algorithm
inferred← citeshttps://doi.org/10.1007/3-540-61363-3_19openalex-snapshot
A structural approach for the analysis of Petri Nets by reduced unfoldings
inferred← citeshttps://doi.org/10.1007/978-0-387-35198-8_16openalex-snapshot
On test case generation from asynchronously communicating state machines
inferred← citeshttps://doi.org/10.1007/978-0-387-35271-8_1openalex-snapshot
Specification-based testing of concurrent systems
inferred← citeshttps://doi.org/10.1007/978-1-4615-4493-7_43openalex-snapshot
Synthesis of Admissible Behavior of Petri Nets for Partial Order Specifications
inferred← citeshttps://doi.org/10.1007/978-3-030-03596-9_12openalex-snapshot
Explaining Non-compliance of Business Process Models Through Automated Planning
inferred← citeshttps://doi.org/10.1007/978-3-030-91014-3_13openalex-snapshot
Petri Net Invariant Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-06653-5_10openalex-snapshot
Petri Nets Semantics of Reaction Rules (RR) A Language for Ecosystems Modelling
inferred← citeshttps://doi.org/10.1007/978-3-031-33620-1_7openalex-snapshot
Taking Complete Finite Prefixes To High Level, Symbolically
inferred← citeshttps://doi.org/10.1007/978-3-031-65630-9_2openalex-snapshot
Parsimonious Optimal Dynamic Partial Order Reduction
inferred← citeshttps://doi.org/10.1007/978-3-031-75778-5_14openalex-snapshot
Measured Causes: Adding Time and Probability to True Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-031-75778-5_19openalex-snapshot
Ten Years of Petri Games
inferred← citeshttps://doi.org/10.1007/978-3-319-02922-1_2openalex-snapshot
APQL: A Process-Model Query Language
inferred← citeshttps://doi.org/10.1007/978-3-319-07734-5_10openalex-snapshot
Flow Unfolding of Multi-clock Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-07734-5_11openalex-snapshot
Non-interference by Unfolding
inferred← citeshttps://doi.org/10.1007/978-3-319-07734-5_9openalex-snapshot
A Programming Language for Spatial Distribution of Net Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-10172-9_17openalex-snapshot
Behavioral Comparison of Process Models Based on Canonically Reduced Event Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-10882-7_22openalex-snapshot
Distributed Testing of Concurrent Systems: Vector Clocks to the Rescue
inferred← citeshttps://doi.org/10.1007/978-3-319-11439-2_18openalex-snapshot
Compositional Reachability in Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-15317-9_17openalex-snapshot
Intransitive Non-Interference by Unfolding
inferred← citeshttps://doi.org/10.1007/978-3-319-19509-4_8openalex-snapshot
TAR++: A New Process Model Similarity Algorithm Based on the Importance of TARs
inferred← citeshttps://doi.org/10.1007/978-3-319-39086-4_11openalex-snapshot
Realizability of Schedules by Stochastic Time Petri Nets with Blocking Semantics
inferred← citeshttps://doi.org/10.1007/978-3-319-39519-7openalex-snapshot
Coordination Models and Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-39519-7_1openalex-snapshot
Multilevel Transitive and Intransitive Non-interference, Causally
inferred← citeshttps://doi.org/10.1007/978-3-319-48472-3_18openalex-snapshot
ExRORU: A New Approach to Characterize the Behavioral Semantics of Process Models (Short Paper)
inferred← citeshttps://doi.org/10.1007/978-3-319-49583-5_7openalex-snapshot
Deciding the Deadlock and Livelock in a Petri Net with a Target Marking Based on Its Basic Unfolding
inferred← citeshttps://doi.org/10.1007/978-3-319-57861-3_11openalex-snapshot
Model Checking Concurrency and Causality
inferred← citeshttps://doi.org/10.1007/978-3-319-59536-8_25openalex-snapshot
Structural Descriptions of Process Models Based on Goal-Oriented Unfolding
inferred← citeshttps://doi.org/10.1007/978-3-319-63121-9_26openalex-snapshot
Comparing Source Sets and Persistent Sets for Partial Order Reduction
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_108-1openalex-snapshot
Business Process Querying
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_108-2openalex-snapshot
Business Process Querying
inferred← citeshttps://doi.org/10.1007/978-3-319-77525-8_108openalex-snapshot
Business Process Querying
inferred← citeshttps://doi.org/10.1007/978-3-319-98648-7_15openalex-snapshot
Online Conformance Checking Using Behavioural Patterns
inferred← citeshttps://doi.org/10.1007/978-3-540-24617-6_13openalex-snapshot
Automatic Generation of Test Purposes for Testing Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-27755-2_18openalex-snapshot
Application of Coloured Petri Nets in System Development
inferred← citeshttps://doi.org/10.1007/978-3-540-27793-4_10openalex-snapshot
Finite Unfoldings of Unbounded Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-30476-0_11openalex-snapshot
SAT-Based Verification of Safe Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-39866-0_37openalex-snapshot
Improving the Consistency Checking Process by Reusing Formal Verification Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-540-45064-1_15openalex-snapshot
Reuse of Formal Verification Efforts of Incomplete Models at the Requirements Specification Stage
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_10openalex-snapshot
Causal Dataflow Analysis for Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_50openalex-snapshot
Bounded Reachability Checking of Asynchronous Systems Using Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_55openalex-snapshot
Unfolding Concurrent Well-Structured Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-75292-9_18openalex-snapshot
Failures: Their Definition, Modelling and Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-76928-6_83openalex-snapshot
Concurrent Temporal Planning Using Timed Petri Nets - Policy Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-642-00431-5_7openalex-snapshot
Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-13675-7_6openalex-snapshot
Efficient Computation of Causal Behavioural Profiles Using Structural Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-642-15928-2_1openalex-snapshot
A False History of True Concurrency: From Petri to Tools
inferred← citeshttps://doi.org/10.1007/978-3-642-16164-3_13openalex-snapshot
A False History of True Concurrency: From Petri to Tools
inferred← citeshttps://doi.org/10.1007/978-3-642-16952-6_17openalex-snapshot
Applying H m Heuristics in Petri Nets Reachability Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-19589-1_7openalex-snapshot
Generalised Computation of Behavioural Profiles Based on Petri-Net Unfoldings
inferred← citeshttps://doi.org/10.1007/978-3-642-21834-7_1openalex-snapshot
Occurrence Nets Then and Now: The Path to Structured Occurrence Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-21834-7_14openalex-snapshot
On the Origin of Events: Branching Cells as Stubborn Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-24541-1_22openalex-snapshot
Causality in Structured Occurrence Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-27549-4_70openalex-snapshot
Unfoldings of Bounded Hybrid Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-36926-1_20openalex-snapshot
The Structured Phase of Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-642-38697-8_18openalex-snapshot
Faster Verification of Partially Ordered Runs in Petri Nets Using Compact Tokenflows
inferred← citeshttps://doi.org/10.1007/978-3-642-40206-7_29openalex-snapshot
Penrose: Putting Compositionality to Work for Petri Net Reachability
inferred← citeshttps://doi.org/10.1007/978-3-642-53856-8_54openalex-snapshot
Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-60729-5_11openalex-snapshot
A description model to support test suite derivation for concurrent systems
inferred← citeshttps://doi.org/10.1007/978-3-662-46081-8_7openalex-snapshot
Distributed Markov Chains
inferred← citeshttps://doi.org/10.1007/978-981-15-1081-6_48openalex-snapshot
State Space Reduction Using Bounded Search Method
inferred← citeshttps://doi.org/10.1007/bf01438227openalex-snapshot
Deadlock prevention using Petri nets and their unfoldings
inferred← citeshttps://doi.org/10.1007/bfb0028760openalex-snapshot
A general approach to partial order reductions in symbolic verification
inferred← citeshttps://doi.org/10.1007/bfb0035386openalex-snapshot
Model-checking for a subclass of event structures
inferred← citeshttps://doi.org/10.1007/s00165-014-0329-4openalex-snapshot
Untanglings: a novel approach to analyzing concurrent systems
inferred← citeshttps://doi.org/10.1007/s10009-007-0030-5openalex-snapshot
A negative result on depth-first net unfoldings
inferred← citeshttps://doi.org/10.1007/s10009-009-0099-0openalex-snapshot
Decision-diagram-based techniques for bounded reachability checking of asynchronous systems
inferred← citeshttps://doi.org/10.1007/s10009-021-00615-1openalex-snapshot
Study of the efficiency of model checking techniques using results of the MCC from 2015 To 2019
inferred← citeshttps://doi.org/10.1007/s10270-016-0517-1openalex-snapshot
Scenario-based system design with colored Petri nets: an application to train control systems
inferred← citeshttps://doi.org/10.1007/s10626-005-4057-zopenalex-snapshot
Control of Safe Ordinary Petri Nets Using Unfolding
inferred← citeshttps://doi.org/10.1007/s11390-011-1199-3openalex-snapshot
Structure-Based Deadlock Checking of Asynchronous Circuits
inferred← citeshttps://doi.org/10.1016/b978-012646490-0/50006-8openalex-snapshot
Computational Issues in Intelligent Control: Discrete-Event and Hybrid Systems
inferred← citeshttps://doi.org/10.1016/j.cam.2010.12.026openalex-snapshot
An efficient algorithm for the parallel solution of high-dimensional differential equations
inferred← citeshttps://doi.org/10.1016/j.cie.2004.05.015openalex-snapshot
Modeling and scheduling of ratio-driven FMS using unfolding time Petri nets
inferred← citeshttps://doi.org/10.1016/j.conengprac.2004.10.005openalex-snapshot
Execution control of robotic tasks: a Petri net-based approach
inferred← citeshttps://doi.org/10.1016/j.disopt.2011.06.001openalex-snapshot
Courcelle’s theorem—A game-theoretic approach
inferred← citeshttps://doi.org/10.1016/j.envsoft.2024.106047openalex-snapshot
Iber-PEST: Automatic calibration in fully distributed hydrological models based on the 2D shallow water equations
inferred← citeshttps://doi.org/10.1016/j.ic.2007.10.004openalex-snapshot
Timed Petri nets and timed automata: On the discriminating power of zeno sequences
inferred← citeshttps://doi.org/10.1016/j.infsof.2026.108047openalex-snapshot
A first and fast symbolic approach for data-aware business process compliance checking
inferred← citeshttps://doi.org/10.1016/j.is.2015.09.009openalex-snapshot
Diagnosing behavioral differences between business process models: An approach based on event structures
inferred← citeshttps://doi.org/10.1016/j.is.2018.09.005openalex-snapshot
Variability in business processes: Automatically obtaining a generic specification
inferred← citeshttps://doi.org/10.1016/j.jlamp.2018.11.006openalex-snapshot
Combining free choice and time in Petri nets
inferred← citeshttps://doi.org/10.1016/j.matcom.2005.11.010openalex-snapshot
Scheduling analysis of FMS: An unfolding timed Petri nets approach
inferred← citeshttps://doi.org/10.1016/j.scico.2017.12.004openalex-snapshot
Realizability of schedules by stochastic time Petri nets with blocking semantics
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.10.004openalex-snapshot
Multilevel transitive and intransitive non-interference, causally
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.10.019openalex-snapshot
Relational structures for concurrent behaviours
inferred← citeshttps://doi.org/10.1016/s0167-9260(96)00010-7openalex-snapshot
Modelling, analysis and synthesis of asynchronous control circuits using Petri nets
inferred← citeshttps://doi.org/10.1016/s0167-9260(97)00023-0openalex-snapshot
RTL verification of timed asynchronous and heterogeneous systems using symbolic model checking
inferred← citeshttps://doi.org/10.1016/s0736-5845(00)00045-4openalex-snapshot
Process modeling and analysis of manufacturing supply chain networks using object-oriented Petri nets
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)30715-2openalex-snapshot
A systems theory view of Petri nets
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)30723-1openalex-snapshot
Control of safe ordinary petri nets with marking specifications using unfolding
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)33285-8openalex-snapshot
Scheduling Analysis in FMS using the Unfolding Time Petri Nets
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)35120-0openalex-snapshot
Execution Control of Robotic Tasks for UUVs
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)37160-4openalex-snapshot
Simulation of Petri Net Processes
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)37792-3openalex-snapshot
Execution Control and Reconfiguration of Navigation, Guidance and Control Tasks for UUVs
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80521-8openalex-snapshot
Petri nets with causal time for system verification
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80254-3openalex-snapshot
Efficient State Space Search for Time Petri Nets
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80293-2openalex-snapshot
Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding
inferred← citeshttps://doi.org/10.1023/a:1008669013857openalex-snapshot
Analysis of Petri Nets by Ordering Relations in Reduced Unfoldings
inferred← citeshttps://doi.org/10.1023/a:1014746130920openalex-snapshot
An Improvement of McMillan's Unfolding Algorithm
inferred← citeshttps://doi.org/10.1023/b:disc.0000028197.25480.d6openalex-snapshot
A Sufficient Condition for Reachability in a General Petri Net
inferred← citeshttps://doi.org/10.1023/b:form.0000004786.30007.f8openalex-snapshot
SAT-Solving the Coverability Problem for Petri Nets
inferred← citeshttps://doi.org/10.1093/comjnl/bxs126openalex-snapshot
Maximal Structuring of Acyclic Process Models
inferred← citeshttps://doi.org/10.1108/bpmj-02-2014-0013openalex-snapshot
Inter-organizational business process verification in public administration
inferred← citeshttps://doi.org/10.1109/acc.2007.4283060openalex-snapshot
On Probabilistic Diagnosis for Free-Choice Petri Nets
inferred← citeshttps://doi.org/10.1109/access.2016.2597061openalex-snapshot
A Branching-Process-Based Method to Check Soundness of Workflow Systems
inferred← citeshttps://doi.org/10.1109/acsd.2015.12openalex-snapshot
Unfolding Based Minimal Test Suites for Testing Multithreaded Programs
inferred← citeshttps://doi.org/10.1109/apsec.2004.28openalex-snapshot
An Improved Repository System for Effective and Efficient Reuse of Formal Verification Efforts
inferred← citeshttps://doi.org/10.1109/aspdac.1997.600112openalex-snapshot
RTL verification of timed asynchronous and heterogeneous systems using symbolic model checking
inferred← citeshttps://doi.org/10.1109/async.1997.587164openalex-snapshot
Symbolic techniques for performance analysis of timed systems based on average time separation of events
inferred← citeshttps://doi.org/10.1109/async.1999.761526openalex-snapshot
Bounding average time separations of events in stochastic timed Petri nets with choice
inferred← citeshttps://doi.org/10.1109/cdc.1998.758524openalex-snapshot
Programmable timed Petri nets in the analysis and design of hybrid control systems
inferred← citeshttps://doi.org/10.1109/chicc.2006.4347094openalex-snapshot
Reachable relation of markings analysis using net unfolding
inferred← citeshttps://doi.org/10.1109/cimsim.2012.41openalex-snapshot
A Case Analysis of IEEE 802.11 CSMA/CA Protocol via Sequence Diagrams
inferred← citeshttps://doi.org/10.1109/codit.2013.6689616openalex-snapshot
An algebra for branching processes
inferred← citeshttps://doi.org/10.1109/csd.1998.657548openalex-snapshot
Identifying state coding conflicts in asynchronous system specifications using Petri net unfoldings
inferred← citeshttps://doi.org/10.1109/csd.2003.1207699openalex-snapshot
Detecting state coding conflicts in STG unfoldings using SAT
inferred← citeshttps://doi.org/10.1109/dasc43569.2019.9081794openalex-snapshot
Challenges and Ways Forward for Avionics Platforms and their Development in 2019
inferred← citeshttps://doi.org/10.1109/edoc.2008.42openalex-snapshot
A Model Driven Approach to Represent Sequence Diagrams as Free Choice Petri Nets
inferred← citeshttps://doi.org/10.1109/edoc.2011.12openalex-snapshot
Conformance Checking Using Cost-Based Fitness Analysis
inferred← citeshttps://doi.org/10.1109/edocw.2011.12openalex-snapshot
Querying Process Models Based on the Temporal Relations between Tasks
inferred← citeshttps://doi.org/10.1109/efta.2007.4416824openalex-snapshot
Enforcing transition deadlines in time Petri nets
inferred← citeshttps://doi.org/10.1109/icnsc.2017.8000161openalex-snapshot
BUCKER: A basic unfolding based checker for soundness of workflow systems
inferred← citeshttps://doi.org/10.1109/icse.2013.6606566openalex-snapshot
Detecting spurious counterexamples efficiently in abstract model checking
inferred← citeshttps://doi.org/10.1109/icsmc.1997.637370openalex-snapshot
A concurrency characteristic in Petri net unfolding
inferred← citeshttps://doi.org/10.1109/icsmc.1997.637372openalex-snapshot
Application of Petri net unfoldings to asynchronous design
inferred← citeshttps://doi.org/10.1109/icsmc.1998.725398openalex-snapshot
Work in process (WIP) analysis of the flexible manufacturing system using time Petri nets unfolding
inferred← citeshttps://doi.org/10.1109/icsmc.2001.972957openalex-snapshot
Modeling and analysis of cycle schedule using Petri nets unfolding
inferred← citeshttps://doi.org/10.1109/icsmc.2002.1176085openalex-snapshot
Benchmarking study of the cyclic scheduling analysis methods in FMS
inferred← citeshttps://doi.org/10.1109/icsmc.2004.1400999openalex-snapshot
A deadlock prevention approach for FMS using siphons and the theory of regions
inferred← citeshttps://doi.org/10.1109/iti.2006.1708535openalex-snapshot
Model-based diagnosis of discrete event systems
inferred← citeshttps://doi.org/10.1109/qest.2011.35openalex-snapshot
Partial Order Reduction for Model Checking Markov Decision Processes under Unconditional Fairness
inferred← citeshttps://doi.org/10.1109/robot.2003.1241728openalex-snapshot
ERCN merged nets for modeling degraded behavior and parallel processes in semiconductor manufacturing systems
inferred← citeshttps://doi.org/10.1109/secdev.2016.017openalex-snapshot
Design Space Exploration for Security
inferred← citeshttps://doi.org/10.1109/sice.2002.1195391openalex-snapshot
Scheduling analysis with resources share using the transitive matrix based on P-invariant
inferred← citeshttps://doi.org/10.1109/tac.2004.831162openalex-snapshot
Counterexamples to “Liveness-Enforcing Supervision of Bounded Ordinary Petri Nets Using Partial-Order Methods”
inferred← citeshttps://doi.org/10.1109/tase.2006.884674openalex-snapshot
A Maximally Permissive Deadlock Prevention Policy for FMS Based on Petri Net Siphon Control and the Theory of Regions
inferred← citeshttps://doi.org/10.1109/tc.2017.2786723openalex-snapshot
A Compositional Approach for Verifying Protocols Running on On-Chip Networks
inferred← citeshttps://doi.org/10.1109/tcad.2016.2611508openalex-snapshot
A Structured Visual Approach to GALS Modeling and Verification of Communication Circuits
inferred← citeshttps://doi.org/10.1109/tkde.2016.2594785openalex-snapshot
Efficient Recovery of Missing Events
inferred← citeshttps://doi.org/10.1109/tra.2002.805655openalex-snapshot
Process nets with resources for manufacturing modeling and their analysis
inferred← citeshttps://doi.org/10.1109/tsc.2020.2984605openalex-snapshot
Efficient Transition Adjacency Relation Computation for Process Model Similarity
inferred← citeshttps://doi.org/10.1109/tsc.2023.3348294openalex-snapshot
Business Process Retrieval From Large Model Repositories for Industry 4.0
inferred← citeshttps://doi.org/10.1109/tse.2014.2357442openalex-snapshot
Making CEGAR More Efficient in Software Model Checking
inferred← citeshttps://doi.org/10.1109/tse.2017.2668418openalex-snapshot
Complete and Interpretable Conformance Checking of Business Processes
inferred← citeshttps://doi.org/10.1109/tsmca.2003.820579openalex-snapshot
ERCN* Merged Nets for Modeling Degraded Behavior and Parallel Processes in Semiconductor Manufacturing Systems
inferred← citeshttps://doi.org/10.1109/tsmca.2010.2076397openalex-snapshot
Enforcing Periodic Transition Deadlines in Time Petri Nets With Net Unfoldings
inferred← citeshttps://doi.org/10.1109/wsc.2007.4419655openalex-snapshot
Semantics of petri nets: A comparison
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2009.00674.xopenalex-snapshot
Planning without state space explosion: Petri net to Markov decision process
inferred← citeshttps://doi.org/10.1134/s0361768816040071openalex-snapshot
“Truly concurrent” and nondeterministic semantics of discrete-time Petri nets
inferred← citeshttps://doi.org/10.1142/s021819400500249xopenalex-snapshot
ARIFS METHODOLOGY: REUSING INCOMPLETE MODELS AT THE REQUIREMENTS SPECIFICATION STAGE
inferred← citeshttps://doi.org/10.1145/2535838.2535845openalex-snapshot
Optimal dynamic partial order reduction
inferred← citeshttps://doi.org/10.1145/2578855.2535845openalex-snapshot
Optimal dynamic partial order reduction
inferred← citeshttps://doi.org/10.1145/3012281openalex-snapshot
Minimizing Test Suites with Unfoldings of Multithreaded Programs
inferred← citeshttps://doi.org/10.1145/3158105openalex-snapshot
Effective stateless model checking for C/C++ concurrency
inferred← citeshttps://doi.org/10.1145/3158119openalex-snapshot
Data-centric dynamic partial order reduction
inferred← citeshttps://doi.org/10.1145/3360550openalex-snapshot
Value-centric dynamic partial order reduction
inferred← citeshttps://doi.org/10.1145/3466933.3466979openalex-snapshot
On the use of online clustering for anomaly detection in trace streams
inferred← citeshttps://doi.org/10.1155/2013/962765openalex-snapshot
Efficient Semantics-Based Compliance Checking Using LTL Formulae and Unfolding
inferred← citeshttps://doi.org/10.1155/2014/642630openalex-snapshot
Path‐Wise Test Data Generation Based on Heuristic Look‐Ahead Methods
inferred← citeshttps://doi.org/10.1155/2015/579623openalex-snapshot
Deadlock Prevention Policy with Behavioral Optimality or Suboptimality Achieved by the Redundancy Identification of Constraints and the Rearrangement of Monitors
inferred← citeshttps://doi.org/10.1155/2015/617685openalex-snapshot
A Hybrid Intelligent Search Algorithm for Automatic Test Data Generation
inferred← citeshttps://doi.org/10.11606/t.55.2018.tde-10102018-141934openalex-snapshot
Search based software testing for the generation of synchronization sequences for mutation testing of concurrent programs
inferred← citeshttps://doi.org/10.1186/1752-0509-4-15openalex-snapshot
Minimally perturbing a gene regulatory network to avoid a disease phenotype: the glioma network as a test case
inferred← citeshttps://doi.org/10.14236/ewic/vocs2008.11openalex-snapshot
Events, Causality and Symmetry
inferred← citeshttps://doi.org/10.14778/2536206.2536212openalex-snapshot
Efficient recovery of missing events
inferred← citeshttps://doi.org/10.1590/s0103-17592011000600006openalex-snapshot
Applying global time Petri net analysis on the embedded software context
inferred← citeshttps://doi.org/10.25148/etd.fi14032340openalex-snapshot
Formal verification and testing of software architectural models
showing the first 200 of 243 · page through all 243
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.