Solving coverability problems of petri nets by partial deduction
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Recursive Nested Petri Nets: Analysis of Semantic Properties and Expessibility
Programming and Computing Software
Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
Modeling dynamic objects in distributed systems with nested Petri nets
Fundamenta Informaticae
On decidability of the control reachability problem in the asynchronous π-calculus
Nordic Journal of Computing
On the Expressiveness of Event Notification in Data-Driven Coordination Languages
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
An Algorithm Constructing the Semilinear Post* for 2-Dim Reset/Transfer VASS
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Decidability of Reachability Problems for Classes of Two Counters Automata
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Temporary Data in Shared Dataspace Coordination Languages
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction
CL '00 Proceedings of the First International Conference on Computational Logic
Testing Undecidability of the Reachability in Petri Nets with the Help of 10th Hilbert Problem
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Theoretical Aspects of Recursive Petri Nets
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Some Decidability Results for Nested Petri Nets
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Undecidable problems in unreliable computations
Theoretical Computer Science - Latin American theoretical informatics
Expired data collection in shared dataspaces
Theoretical Computer Science - Foundations of software science and computation structures
Structural and Dynamic Changes in Concurrent Systems: Reconfigurable Petri Nets
IEEE Transactions on Computers
Tree automata with one memory set constraints and cryptographic protocols
Theoretical Computer Science - Automata, languages and programming
On the ω-language expressive power of extended petri nets
Theoretical Computer Science - Expressiveness in concurrency
Boundedness undecidability for synchronized nets
Information Processing Letters
Nested Petri Nets: Multi-level and Recursive Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Determining Sound Markings in Structured Nets
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Operational semantics for Petri net components
Theoretical Computer Science
Decidability Problems of a Basic Class of Object Nets
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Modelling collaborative workflows using recursive ECATNets
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
Discovery, Verification and Conformance of Workflows with Cancellation
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Tree Pattern Rewriting Systems
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Soundness-preserving reduction rules for reset workflow nets
Information Sciences: an International Journal
Nets with Tokens which Carry Data
Fundamenta Informaticae - PETRI NETS 2007
On Trace-Expressible Behaviour of Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Reduction rules for YAWL workflows with cancellation regions and OR-joins
Information and Software Technology
Petri Net Transformations for Business Processes --- A Survey
Transactions on Petri Nets and Other Models of Concurrency II
A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Forward Analysis for WSTS, Part II: Complete WSTS
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On the Expressiveness of Communication Channels for Object Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
On the Relationship between η-Calculus and Finite Place/Transition Petri Nets
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Reduction rules for reset/inhibitor nets
Journal of Computer and System Sciences
About Fast and TReX Accelerations
Electronic Notes in Theoretical Computer Science (ENTCS)
A well-structured framework for analysing petri net extensions
Information and Computation
Expressiveness of Petri Nets with Stopwatches. Dense-time Part
Fundamenta Informaticae
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS
Journal of Computer and System Sciences
Decidability of properties of timed-arc Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Model checking lossy vector addition systems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Nets with tokens which carry data
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
On the dynamics of PB systems with volatile membranes
WMC'07 Proceedings of the 8th international conference on Membrane computing
A feature-complete Petri net semantics for WS-BPEL 2.0
WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
simpA: An agent-oriented approach for programming concurrent applications on top of Java
Science of Computer Programming
Noetherian spaces in verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Lossy counter machines decidability cheat sheet
RP'10 Proceedings of the 4th international conference on Reachability problems
Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
A classification of the expressive power of well-structured transition systems
Information and Computation
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
BPM'06 Proceedings of the 4th international conference on Business Process Management
Transforming BPEL to petri nets
BPM'05 Proceedings of the 3rd international conference on Business Process Management
Achieving a general, formal and decidable approach to the OR-Join in workflow using reset nets
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
A complete abstract interpretation framework for coverability properties of WSTS
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Expand, enlarge, and check: new algorithms for the coverability problem of WSTS
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
From post systems to the reachability problems for matrix semigroups and multicounter automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Algorithmic verification of asynchronous programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Translating orc features into petri nets and the join calculus
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
Forward analysis for petri nets with name creation
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
On the relationship between spatial logics and behavioral simulations
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Reachability problems in BioAmbients
Theoretical Computer Science
Ideal abstractions for well-structured transition systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Catalytic petri nets are turing complete
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Solving coverability problem for monotonic counter systems by supercompilation
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Accelerations for the Coverability Set of Petri Nets with Names
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
On the Expressiveness of Communication Channels for Object Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Expressiveness of Petri Nets with Stopwatches. Dense-time Part
Fundamenta Informaticae
On Trace-Expressible Behaviour of Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Nets with Tokens which Carry Data
Fundamenta Informaticae - PETRI NETS 2007
Decidability Problems of a Basic Class of Object Nets
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
The theory of WSTS: the case of complete WSTS
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Complexity of the soundness problem of bounded workflow nets
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Determining Sound Markings in Structured Nets
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Modeling Dynamic Objects in Distributed Systems with Nested Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
Nested Petri Nets: Multi-level and Recursive Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Comparing the expressive power of well-structured transition systems
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
On the coverability and reachability languages of monotonic extensions of Petri nets
Theoretical Computer Science
The expressive power of time Petri nets
Theoretical Computer Science
Assigning Ontological Meaning to Workflow Nets
Journal of Database Management
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Structural counter abstraction
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On selective unboundedness of VASS
Journal of Computer and System Sciences
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Incremental, inductive coverability
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Computable fixpoints in well-structured symbolic model checking
Formal Methods in System Design
Complexity of the Soundness Problem of Workflow Nets
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
| Hi-index | 0.01 |