Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
On decidability of the control reachability problem in the asynchronous π-calculus
Nordic Journal of Computing
An automata-theoretic approach to the reachability analysis of RPPS systems
Nordic Journal of Computing
Verification of Embedded Reactive Fiffo Systems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Symbolic Representation of Upward-Closed Sets
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Parameterized Verification of Multithreaded Software Libraries
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Beyond Parameterized Verification
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Towards the Automated Verification of Multithreaded Java Programs
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Constraint-Based Model Checking for Parameterized Synchronous Systems
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
Decidability of Safety Properties of Timed Multiset Rewriting
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
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
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Attacking Symbolic State Explosion
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Algorithmic Verification of Invalidation-Based Protocols
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Some Decidability Results for Nested Petri Nets
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Well-abstracted transition systems: application to FIFO automata
Information and Computation
Constraint-Based Verification of Parameterized Cache Coherence Protocols
Formal Methods in System Design
SAT-Solving the Coverability Problem for Petri Nets
Formal Methods in System Design
An effective fixpoint semantics for linear logic programs
Theory and Practice of Logic Programming
Model checking linear logic specifications
Theory and Practice of Logic Programming
On model checking data-independent systems with arrays without reset
Theory and Practice of Logic Programming
On the expressive power of movement and restriction in pure mobile ambients
Theoretical Computer Science - Special issue: Foundations of wide area network computing
On the computational strength of pure ambient calculi
Theoretical Computer Science - Expressiveness in concurrency
Quantitative analysis of probabilistic lossy channel systems
Information and Computation
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
A general approach to comparing infinite-state systems with their finite-state specifications
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Modeling and analysis of biological processes by mem(brane) calculi and systems
Proceedings of the 38th conference on Winter simulation
Complete symbolic reachability analysis using back-and-forth narrowing
Theoretical Computer Science - Algebra and coalgebra in computer science
Communities of Interacting Automata for Modelling Distributed Systems with Dynamic Structure
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Using well-structured transition systems to decide divergence for catalytic P systems
Theoretical Computer Science
Constraint-based automatic verification of abstract models of multithreaded programs
Theory and Practice of Logic Programming
Update and Abstraction in Model Checking of Knowledge and Branching Time
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Higher-Order and Symbolic Computation
Alternating two-way AC-tree automata
Information and Computation
Narrowing and Rewriting Logic: from Foundations to Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
ReSpecT Nets: Towards an Analysis Methodology for ReSpecT Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Learning to verify branching time properties
Formal Methods in System Design
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
ACM Transactions on Computational Logic (TOCL)
ACM Transactions on Computational Logic (TOCL)
Expressiveness Issues in Brane Calculi: A Survey
Electronic Notes in Theoretical Computer Science (ENTCS)
On Communicating Automata with Bounded Channels
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Monotonic Abstraction for Programs with Dynamic Memory Heaps
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
On the Reachability Analysis of Acyclic Networks of Pushdown Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A Biologically Inspired Model with Fusion and Clonation of Membranes
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Discovery, Verification and Conformance of Workflows with Cancellation
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
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
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
Name Creation vs. Replication in Petri Net Systems
Fundamenta Informaticae - PETRI NETS 2007
Computational expressiveness of Genetic Systems
Theoretical Computer Science
On the Qualitative Analysis of Conformon P Systems
Membrane Computing
Event-Clock Visibly Pushdown Automata
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Automatic non-interference lemmas for parameterized model checking
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Model-checking Timed Temporal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
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
On the Expressive Power of Process Interruption and Compensation
Web Services and Formal Methods
On the expressive power of process interruption and compensation
Mathematical Structures in Computer Science
Satisfiability and relevance for queries over active documents
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximated Context-Sensitive Analysis for Parameterized Verification
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
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)
Deciding branching time properties for asynchronous programs
Theoretical Computer Science
The Reachability Problem over Infinite Graphs
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
On the Expressiveness of Forwarding in Higher-Order Communication
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
The κ-Lattice: Decidability Boundaries for Qualitative Analysis in Biological Languages
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Automatic Verification of Directory-Based Consistency Protocols
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
How to Tackle Integer Weighted Automata Positivity
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
On the computational power of BlenX
Theoretical Computer Science
Reduction rules for reset/inhibitor nets
Journal of Computer and System Sciences
Forcing Monotonicity in Parameterized Verification: From Multisets to Words
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Decidability of Reachability for Polymorphic Systems with Arrays: A Complete Classification
Electronic Notes in Theoretical Computer Science (ENTCS)
A New Approach to Upward-Closed Set Backward Reachability Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Games for Counting Abstractions
Electronic Notes in Theoretical Computer Science (ENTCS)
On the verification problem for weak memory models
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Quantitative analysis of probabilistic lossy channel systems
Information and Computation
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
On the expressive power of recursion, replication and iteration in process calculi
Mathematical Structures in Computer Science
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS
Journal of Computer and System Sciences
On the expressiveness of interaction
Theoretical Computer Science
Recognizing boolean closed A-tree languages with membership conditional rewriting mechanism
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Replication vs. recursive definitions in channel based calculi
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Quantitative analysis of probabilistic lossy channel systems
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Well-structured model checking of multiagent systems
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Interacting automata for modelling distributed systems
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartII
A generic framework for reasoning about dynamic networks of infinite-state processes
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
Formalization and verification of EPCs with OR-joins based on state and context
CAiSE'07 Proceedings of the 19th international conference on Advanced information systems engineering
From many places to few: automatic abstraction refinement for Petri nets
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
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
Name creation vs. replication in Petri net systems
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Symbolic model checking of infinite-state systems using narrowing
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Undecidability of universality for timed automata with minimal resources
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Is lazy abstraction a decision procedure for broadcast protocols?
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
A forward-backward abstraction refinement algorithm
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Forward-XPath and extended register automata on data-trees
Proceedings of the 13th International Conference on Database Theory
Nested Petri nets for adaptive process modeling
Pillars of computer science
A cut-off approach for bounded verification of parameterized systems
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1
Spatial and behavioral types in the pi-calculus
Information and Computation
Decidability properties for fragments of chr
Theory and Practice of Logic Programming
Noetherian spaces in verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Reachability games on extended vector addition systems with states
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
Depth boundedness in multiset rewriting systems with name binding
RP'10 Proceedings of the 4th international conference on Reachability problems
Energy and mean-payoff games with imperfect information
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Taming distributed asynchronous systems
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Constrained monotonic abstraction: a CEGAR for parameterized verification
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Parameterized verification of ad hoc networks
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
On the verification of membrane systems with dynamic structure
Natural Computing: an international journal
Multiset rewriting: a semantic framework for concurrency with name binding
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Alternating automata on data trees and XPath satisfiability
ACM Transactions on Computational Logic (TOCL)
A classification of the expressive power of well-structured transition systems
Information and Computation
Verification of timed-arc Petri nets
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
opaal: a lattice model checker
NFM'11 Proceedings of the Third international conference on NASA Formal methods
On the power of cliques in the parameterized verification of Ad Hoc networks
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Forward analysis and model checking for trace bounded WSTS
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Combined logics of knowledge, time, and actions for reasoning about multi-agent systems
KONT'07/KPP'07 Proceedings of the First international conference on Knowledge processing and data analysis
Well-quasi-ordering hereditarily finite sets
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Multiply-recursive upper bounds with Higman's Lemma
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Decidability of LTL for vector addition systems with one zero-test
RP'11 Proceedings of the 5th international conference on Reachability problems
Complexity analysis of the backward coverability algorithm for VASS
RP'11 Proceedings of the 5th international conference on Reachability problems
Computing with genetic gates, proteins, and membranes
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Branching-time temporal logic extended with qualitative presburger constraints
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Branching pushdown tree automata
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
On metric temporal logic and faulty turing machines
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Decision problems for the verification of real-time software
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Flat acceleration in symbolic model checking
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Analysis of recursively parallel programs
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Decidability and complexity results for timed automata via channel machines
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
BPM'06 Proceedings of the 4th international conference on Business Process Management
Deciding behavioural properties in brane calculi
CMSB'06 Proceedings of the 2006 international conference on Computational Methods in Systems Biology
On the computational power of brane calculi
Transactions on Computational Systems Biology VI
Model checking multithreaded programs with asynchronous atomic methods
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Empirically efficient verification for a class of infinite-state systems
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Petruchio: from dynamic networks to nets
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
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
Deciding safety properties in infinite-state pi-calculus via behavioural types
Information and Computation
Expand, enlarge and check... made efficient
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Complete symbolic reachability analysis using back-and-forth narrowing
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
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
A kleene theorem for a class of communicating automata with effective algorithms
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)
Forward analysis for petri nets with name creation
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Rewriting models of boolean programs
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Analysis of communicating automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Language-based comparison of petri nets with black tokens, pure names and ordered data
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Forward analysis of depth-bounded processes
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
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
Algorithmic metatheorems for decidable LTL model checking over infinite systems
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Reachability analysis of communicating pushdown systems
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Antichain algorithms for finite automata
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Behavioural contracts with request-response operations
COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
On model checking data-independent systems with arrays with whole-array operations
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Safety metric temporal logic is fully decidable
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Steps on the road to component evolvability
FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
Ideal abstractions for well-structured transition systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Multiset rewriting for the verification of depth-bounded processes with name binding
Information and Computation
ICCPS '12 Proceedings of the 2012 IEEE/ACM Third International Conference on Cyber-Physical Systems
Attacking the dimensionality problem of parameterized systems via bounded reachability graphs
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Decidability of behavioral equivalences in process calculi with name scoping
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Exponential acceleration of model checking for perfect recall systems
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Reliable contracts for unreliable half-duplex communications
WS-FM'11 Proceedings of the 8th international conference on Web Services and Formal Methods
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)
Nets with Tokens which Carry Data
Fundamenta Informaticae - PETRI NETS 2007
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
Name Creation vs. Replication in Petri Net Systems
Fundamenta Informaticae - PETRI NETS 2007
On Communicating Automata with Bounded Channels
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
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
Cost soundness for priced resource-constrained workflow nets
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Update and Abstraction in Model Checking of Knowledge and Branching Time
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Communities of Interacting Automata for Modelling Distributed Systems with Dynamic Structure
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Fixpoint-guided abstraction refinements
SAS'07 Proceedings of the 14th international conference on Static Analysis
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Decidability results for well-structured transition systems with auxiliary storage
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
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
Efficient coverability analysis by proof minimization
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Decidability problems for actor systems
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Multi-core reachability for timed automata
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Towards the verification of adaptable processes
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Well-structured graph transformation systems with negative application conditions
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
On the coverability and reachability languages of monotonic extensions of Petri nets
Theoretical Computer Science
Programming and Computing Software
The parametric ordinal-recursive complexity of post embedding problems
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
Analysis of Recursively Parallel Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Component reconfiguration in the presence of conflicts
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Rational subsets and submonoids of wreath products
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Incremental, inductive coverability
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
The power of well-structured systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Well-Structured pushdown systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Safety verification of asynchronous pushdown systems with shaped stacks
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
The power of priority channel systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Generalizing simulation to abstract domains
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Computable fixpoints in well-structured symbolic model checking
Formal Methods in System Design
Conservative Elementary Object Systems
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
Safety and Soundness for Priced Resource-Constrained Workflow Nets
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
| Hi-index | 5.23 |