Analysis of Petri Nets by Ordering Relations in Reduced Unfoldings
Formal Methods in System Design
An Improvement of McMillan's Unfolding Algorithm
Formal Methods in System Design
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
A Sweep-Line Method for State Space Exploration
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
First Passage Time Analysis of Stochastic Process Algebra Using Partial Orders
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast}
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Hazard-Freedom Checking in Speed-Independent Systems
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
A Complete Finite Prefix for Process Algebra
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Regular Event Structures and Finite Petri Nets: The Conflict-Free Case
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Regular Event Structures and Finite Petri Nets: A Conjecture
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Tutorial: Compiling concurrent languages for sequential processors
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Regular event structures and finite Petri nets: a conjecture
Formal and natural computing
Bounding Average Time Separations of Events in Stochastic Timed Petri Nets with Choice
ASYNC '99 Proceedings of the 5th International Symposium on Advanced Research in Asynchronous Circuits and Systems
SAT-Solving the Coverability Problem for Petri Nets
Formal Methods in System Design
A Sufficient Condition for Reachability in a General Petri Net
Discrete Event Dynamic Systems
Control of Safe Ordinary Petri Nets Using Unfolding
Discrete Event Dynamic Systems
Scheduling analysis of FMS: an unfolding timed Petri nets approach
Mathematics and Computers in Simulation - Special issue: Computational engineering in systems applications (CESA 2003)
Logic synthesis for asynchronous circuits based on STG unfoldings and incremental SAT
Fundamenta Informaticae - Special issue on application of concurrency to system design (ACSD'04)
Detecting State Encoding Conflicts in STG Unfoldings Using SAT
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
Timed Petri nets and timed automata: On the discriminating power of zeno sequences
Information and Computation
Semantics of petri nets: a comparison
Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
Processes of Petri Nets with Range Testing
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Quickly prototyping petri nets tools with SNAKES
Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
Model based reactive planning and prediction for autonomic systems
Proceedings of the 2007 Workshop on INnovative SERvice Technologies
Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic
Model Checking and Artificial Intelligence
Scheduling analysis of FMS: An unfolding timed Petri nets approach
Mathematics and Computers in Simulation
Causal dataflow analysis for concurrent programs
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Bounded reachability checking of asynchronous systems using decision diagrams
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Unfolding concurrent well-structured transition systems
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Failures: their definition, modelling and analysis
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Concurrent temporal planning using timed Petri nets: policy evaluation
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
A false history of true concurrency: from Petri to tools
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
An efficient algorithm for the parallel solution of high-dimensional differential equations
Journal of Computational and Applied Mathematics
Applying Hmheuristics in Petri nets reachability problem
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
Generalised computation of behavioural profiles based on petri-net unfoldings
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
Occurrence nets then and now: the path to structured occurrence nets
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Parsing algorithms for grammars with regulated rewriting
ACS'11 Proceedings of the 11th WSEAS international conference on Applied computer science
Reduced MDP representation of a logistical planning problem using petri-nets
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Complete finite prefixes of symbolic unfoldings of safe time petri nets
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Infinite process semantics of inhibitor nets
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Stronger reduction criteria for local first search
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
An approach to unfolding asynchronous communication protocols
FM'05 Proceedings of the 2005 international conference on Formal Methods
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Efficient computation of causal behavioural profiles using structural decomposition
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
FM'06 Proceedings of the 14th international conference on Formal Methods
Timed unfoldings for networks of timed automata
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Symbolic unfoldings for networks of timed automata
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
The implementation of mazurkiewicz traces in POEM
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Causality in structured occurrence nets
Dependable and Historic Computing
Unfoldings of bounded hybrid petri nets
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Events, causality and symmetry
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Structure-based deadlock checking of asynchronous circuits
Journal of Computer Science and Technology - Special issue on Natural Language Processing
Causal Behavioural Profiles - Efficient Computation, Applications, and Evaluation
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Processes of Petri Nets with Range Testing
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Logic Synthesis for Asynchronous Circuits Based on STG Unfoldings and Incremental SAT
Fundamenta Informaticae - APPLICATION OF CONCURRENCY TO SYSTEM DESIGN (ACSD'04)
Detecting State Encoding Conflicts in STG Unfoldings Using SAT
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
Detecting spurious counterexamples efficiently in abstract model checking
Proceedings of the 2013 International Conference on Software Engineering
Faster verification of partially ordered runs in petri nets using compact tokenflows
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Optimal dynamic partial order reduction
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Efficient recovery of missing events
Proceedings of the VLDB Endowment
Branching Processes of General Petri Nets
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2011
| Hi-index | 0.00 |