Javier Esparza

According to our database1, Javier Esparza
  • authored at least 209 papers between 1989 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Minimizing Test Suites with Unfoldings of Multithreaded Programs.
ACM Trans. Embedded Comput. Syst., 2017

Model checking parameterized asynchronous shared-memory systems.
Formal Methods in System Design, 2017

Static Analysis of Deterministic Negotiations.
CoRR, 2017

From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata.
CoRR, 2017

Soundness in negotiations.
CoRR, 2017

Towards Efficient Verification of Population Protocols.
CoRR, 2017

Verification of population protocols.
Acta Inf., 2017

Advances in Quantitative Analysis of Free-Choice Workflow Petri Nets (Invited Talk).
Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Towards Efficient Verification of Population Protocols.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Static analysis of deterministic negotiations.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Advances in Parameterized Verification of Population Protocols.
Proceedings of the Computer Science - Theory and Applications, 2017

2016
Parameterized Verification of Crowds of Anonymous Processes.
Proceedings of the Dependable Software Systems Engineering, 2016

Negotiations and Petri Nets.
T. Petri Nets and Other Models of Concurrency, 2016

Parameterized Verification of Asynchronous Shared-Memory Systems.
J. ACM, 2016

Existence of home states in Petri nets is decidable.
Inf. Process. Lett., 2016

From LTL to deterministic automata - A safraless compositional approach.
Formal Methods in System Design, 2016

Polynomial Analysis Algorithms for Free Choice Probabilistic Workflow Nets.
CoRR, 2016

Reduction Rules for Colored Workflow Nets.
CoRR, 2016

Negotiation as Concurrency Primitive.
CoRR, 2016

Polynomial Analysis Algorithms for Free Choice Probabilistic Workflow Nets.
Proceedings of the Quantitative Evaluation of Systems - 13th International Conference, 2016

Model Checking Population Protocols.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Reduction Rules for Colored Workflow Nets.
Proceedings of the Fundamental Approaches to Software Engineering, 2016

Soundness in Negotiations.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

Limit-Deterministic Büchi Automata for Linear Temporal Logic.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015
FPSOLVE: A Generic Solver for Fixpoint Equations Over Semirings.
Int. J. Found. Comput. Sci., 2015

Model Checking Parameterized Asynchronous Shared-Memory Systems.
CoRR, 2015

Distributed Markov Chains.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2015

An SMT-based Approach to Fair Termination Analysis.
Proceedings of the Formal Methods in Computer-Aided Design, 2015

Verification of Population Protocols.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

Model Checking Parameterized Asynchronous Shared-Memory Systems.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

Negotiation Programs.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2015

Negotiations and Petri Nets.
Proceedings of the International Workshop on Petri Nets and Software Engineering (PNSE'15), 2015

Unfolding Based Minimal Test Suites for Testing Multithreaded Programs.
Proceedings of the 15th International Conference on Application of Concurrency to System Design, 2015

2014
Pattern-Based Verification for Multithreaded Programs.
ACM Trans. Program. Lang. Syst., 2014

Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141).
Dagstuhl Reports, 2014

From LTL to Deterministic Automata: A Safraless Compositional Approach.
CoRR, 2014

Negotiation Games.
CoRR, 2014

On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations.
CoRR, 2014

Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Corrected version).
CoRR, 2014

A Fully Verified Executable LTL Model Checker.
Archive of Formal Proofs, 2014

FPsolve: A Generic Solver for Fixpoint Equations over Semirings.
Proceedings of the Implementation and Application of Automata, 2014

Message-Passing Algorithms for the Verification of Distributed Protocols.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2014

Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk).
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

A Brief History of Strahler Numbers.
Proceedings of the Language and Automata Theory and Applications, 2014

On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

Fast and Accurate Unlexicalized Parsing via Structural Annotations.
Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, 2014

Deterministic Negotiations: Concurrency for Free.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

An SMT-Based Approach to Coverability Analysis.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

From LTL to Deterministic Automata: A Safraless Compositional Approach.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

2013
A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars.
Inf. Process. Lett., 2013

Analyzing probabilistic pushdown automata.
Formal Methods in System Design, 2013

Parameterized Verification of Asynchronous Shared-Memory Systems
CoRR, 2013

Computation of Summaries Using Net Unfoldings.
CoRR, 2013

On Negotiation as Concurrency Primitive.
CoRR, 2013

Computation of Summaries Using Net Unfoldings.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

On Negotiation as Concurrency Primitive.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

A Fully Verified Executable LTL Model Checker.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

Parameterized Verification of Asynchronous Shared-Memory Systems.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012
Space-efficient scheduling of stochastically generated tasks.
Inf. Comput., 2012

Deterministic Automata for the (F,G)-fragment of LTL
CoRR, 2012

Proving Termination of Probabilistic Programs Using Patterns
CoRR, 2012

A Perfect Model for Bounded Verification
CoRR, 2012

A Perfect Model for Bounded Verification.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Deterministic Automata for the (F, G)-Fragment of LTL.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

Proving Termination of Probabilistic Programs Using Patterns.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

Rabinizer: Small Deterministic Automata for LTL(F, G).
Proceedings of the Automated Technology for Verification and Analysis, 2012

Reactive and Proactive Diagnosis of Distributed Systems Using Net Unfoldings.
Proceedings of the 12th International Conference on Application of Concurrency to System Design, 2012

Three Case Studies on Verification of Infinite-State Systems.
Modern Applications of Automata Theory, 2012

2011
Derivation tree analysis for accelerated fixed-point computation.
Theor. Comput. Sci., 2011

Parikhʼs theorem: A simple and direct automaton construction.
Inf. Process. Lett., 2011

Learning Workflow Petri Nets.
Fundam. Inform., 2011

Probabilistic Abstractions with Arbitrary Domains
CoRR, 2011

Probabilistic Abstractions with Arbitrary Domains.
Proceedings of the Static Analysis - 18th International Symposium, 2011

Complexity of pattern-based verification for multithreaded programs.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

Solving Fixed-Point Equations by Derivation Tree Analysis.
Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2010
Newtonian Program Analysis - An Introduction.
Proceedings of the Logics and Languages for Reliability and Security, 2010

Computing the Least Fixed Point of Positive Polynomial Systems.
SIAM J. Comput., 2010

Newtonian program analysis.
J. ACM, 2010

Parikh's Theorem: A simple and direct construction
CoRR, 2010

Space-efficient scheduling of stochastically generated tasks
CoRR, 2010

Computing the Least Fixed Point of Positive Polynomial Systems
CoRR, 2010

Analysis of Systems with Stochastic Process Creation.
Proceedings of the Verification, 2010

Computing Least Fixed Points of Probabilistic Systems of Polynomials.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

A False History of True Concurrency: From Petri to Tools.
Proceedings of the Model Checking Software, 2010

Space-Efficient Scheduling of Stochastically Generated Tasks.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Verification of Graph Transformation Systems with Context-Free Specifications.
Proceedings of the Graph Transformations - 5th International Conference, 2010

A False History of True Concurrency: From Petri to Tools.
Proceedings of the Graph Transformations - 5th International Conference, 2010

Automatic Error Correction of Java Programs.
Proceedings of the Formal Methods for Industrial Critical Systems, 2010

Learning Workflow Petri Nets.
Proceedings of the Applications and Theory of Petri Nets, 2010

2009
Computing Least Fixed Points of Probabilistic Systems of Polynomials
CoRR, 2009

Modeling and Verification for Timing Satisfaction of Fault-Tolerant Systems with Finiteness
CoRR, 2009

FTOS-Verify: Analysis and Verification of Non-Functional Properties for Fault-Tolerant Systems
CoRR, 2009

On least fixed points of systems of positive polynomials.
ACM Comm. Computer Algebra, 2009

Stochastic Process Creation.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

On the Memory Consumption of Probabilistic Pushdown Automata.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

Solving Fixed-Point Equations on omega-Continuous Semirings.
Proceedings of the 6th Workshop on Fixed Points in Computer Science, 2009

Modeling and Verification for Timing Satisfaction of Fault-Tolerant Systems with Finiteness.
Proceedings of the 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications, 2009

Examining robotic systems with shape-adjustable manipulators under dynamic environments: From simulation to verification.
Proceedings of the IEEE International Symposium on Computational Intelligence in Robotics and Automation, 2009

2008
Unfoldings - A Partial-Order Approach to Model Checking
Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-77426-6, 2008

A negative result on depth-first net unfoldings.
STTT, 2008

Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems.
JSAT, 2008

On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs.
Fundam. Inform., 2008

Convergence Thresholds of Newton's Method for Monotone Polynomial Equations
CoRR, 2008

SDSIrep: A Reputation System Based on SDSI.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

Convergence Thresholds of Newton's Method for Monotone Polynomial Equations.
Proceedings of the STACS 2008, 2008

Symbolic Context-Bounded Analysis of Multithreaded Java Programs.
Proceedings of the Model Checking Software, 2008

Solving Monotone Polynomial Equations.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Newton's Method for omega-Continuous Semirings.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Derivation Tree Analysis for Accelerated Fixed-Point Computation.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007
On the convergence of Newton's method for monotone systems of polynomial equations.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

On Fixed Point Equations over Commutative Semirings.
Proceedings of the STACS 2007, 2007

An Extension of Newton's Method to omega -Continuous Semirings.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

jMoped: A Test Environment for Java Programs.
Proceedings of the Computer Aided Verification, 19th International Conference, 2007

2006
Model Checking Probabilistic Pushdown Automata.
Logical Methods in Computer Science, 2006

Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2006

Rewriting Models of Boolean Programs.
Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

Separability in Conflict-Free Petri Nets.
Proceedings of the Perspectives of Systems Informatics, 2006

Reachability analysis of multithreaded software with asynchronous communication.
Proceedings of the Software Verification: Infinite-State Model Checking and Static Program Analysis, 19.02., 2006

Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains.
Proceedings of the Automated Technology for Verification and Analysis, 2006

Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols.
Proceedings of the Automated Technology for Verification and Analysis, 2006

On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs.
Proceedings of the Sixth International Conference on Application of Concurrency to System Design (ACSD 2006), 2006

2005
Reachability Analysis of Synchronized PA Systems.
Electr. Notes Theor. Comput. Sci., 2005

Model Checking Probabilistic Pushdown Automata
CoRR, 2005

jMoped: A Java Bytecode Checker Based on Moped.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2005

A Note on On-the-Fly Verification Algorithms.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2005

Locality-Based Abstractions.
Proceedings of the Static Analysis, 12th International Symposium, 2005

Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

Reachability Analysis of Multithreaded Software with Asynchronous Communication.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract).
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004
A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs.
Fundam. Inform., 2004

Model Checking Probabilistic Pushdown Automata.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

Verifying Probabilistic Procedural Programs.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2003
A Logical Viewpoint on Process-algebraic Quotients.
J. Log. Comput., 2003

A Generic Approach to the Static Analysis of Concurrent Programs with Procedures.
Int. J. Found. Comput. Sci., 2003

Model checking LTL with regular valuations for pushdown systems.
Inf. Comput., 2003

Simple Representative Instantiations for Multicast Protocols.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2003

A generic approach to the static analysis of concurrent programs with procedures.
Proceedings of the Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2003

An Automata-Theoretic Approach to Software Verification.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

Synthesis of Distributed Algorithms Using Asynchronous Automata.
Proceedings of the CONCUR 2003, 2003

The Model-Checking Kit.
Proceedings of the Applications and Theory of Petri Nets 2003, 2003

A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs.
Proceedings of the 3rd International Conference on Application of Concurrency to System Design (ACSD 2003), 2003

2002
An Improvement of McMillan's Unfolding Algorithm.
Formal Methods in System Design, 2002

An Algebraic Approach to the Static Analysis of Concurrent Software.
Proceedings of the Static Analysis, 9th International Symposium, 2002

Grammars as Processes.
Proceedings of the Formal and Natural Computing, 2002

2001
Unfolding Based Algorithms for the Reachability Problem.
Fundam. Inform., 2001

Model-Checking LTL with Regular Valuations for Pushdown Systems.
Proceedings of the Theoretical Aspects of Computer Software, 4th International Symposium, 2001

Implementing LTL Model Checking with Net Unfoldings.
Proceedings of the Model Checking Software, 2001

Model Checking (with) Declarative Programs.
Proceedings of the 3rd international ACM SIGPLAN conference on Principles and practice of declarative programming, 2001

Net Reductions for LTL Model-Checking.
Proceedings of the Correct Hardware Design and Verification Methods, 2001

A BDD-Based Model Checker for Recursive Programs.
Proceedings of the Computer Aided Verification, 13th International Conference, 2001

More Infinite Results.
Current Trends in Theoretical Computer Science, 2001

2000
An efficient automata approach to some problems on context-free grammars.
Inf. Process. Lett., 2000

Verification of Safety Properties Using Integer Programming: Beyond the State Equation.
Formal Methods in System Design, 2000

A Uniform Framework for Problems on Context-Free Grammars.
Bulletin of the EATCS, 2000

Efficient Algorithms for pre* and post* on Interprocedural Parallel Flow Graphs.
Proceedings of the POPL 2000, 2000

Verification of Systems with an Infinite State Space.
Proceedings of the Modeling and Verification of Parallel Processes, 4th Summer School, 2000

Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

A New Unfolding Approach to LTL Model Checking.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Efficient Algorithms for Model Checking Pushdown Systems.
Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999
Petri Nets and Regular Processes.
J. Comput. Syst. Sci., 1999

On the Verification of Broadcast Protocols.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis.
Proceedings of the Foundations of Software Science and Computation Structure, 1999

A Logical Viewpoint on Process-Algebraic Quotients.
Proceedings of the Computer Science Logic, 13th International Workshop, 1999

Constraint-Based Analysis of Broadcast Protocols.
Proceedings of the Computer Science Logic, 13th International Workshop, 1999

Proof-Checking Protocols Using Bisimulations.
Proceedings of the CONCUR '99: Concurrency Theory, 1999

An Unfolding Algorithm for Synchronous Products of Transition Systems.
Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998
Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete.
Theor. Comput. Sci., 1998

1997
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes.
Fundam. Inform., 1997

More Infinite Results.
Bulletin of the EATCS, 1997

Decidability of Model Checking for Infinite-State Concurrent Systems.
Acta Inf., 1997

Reachability Analysis of Pushdown Automata: Application to Model-Checking.
Proceedings of the CONCUR '97: Concurrency Theory, 1997

An Automata Approach to Some Problems on Context-Free Grammars.
Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

Model Checking LTL Using Constraint Programming.
Proceedings of the Application and Theory of Petri Nets 1997, 1997

1996
Trapping Mutual Exclusion in the Box Calculus.
Theor. Comput. Sci., 1996

More infinite results.
Electr. Notes Theor. Comput. Sci., 1996

An Improvement of McMillan's Unfolding Algorithm.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1996

Deciding Finiteness of Petri Nets Up To Bisimulation.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

An Effective Tableau System for the Linear Time µ-Calculus.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

Checking System Properties via Integer Programming.
Proceedings of the Programming Languages and Systems, 1996

Verification Using PEP.
Proceedings of the Algebraic Methodology and Software Technology, 1996

Decidability and Complexity of Petri Net Problems - An Introduction.
Proceedings of the Lectures on Petri Nets I: Basic Models, 1996

1995
Complexity Results for 1-Safe Nets.
Theor. Comput. Sci., 1995

Shortest Paths in Reachability Graphs.
J. Comput. Syst. Sci., 1995

Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes.
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes.
Proceedings of the Computer Aided Verification, 1995

1994
Reduction and Synthesis of Live and Bounded Free Choice Petri Nets
Inf. Comput., October, 1994

Model Checking Using Net Unfoldings.
Sci. Comput. Program., 1994

Decidability Issues for Petri Nets - a survey.
Elektronische Informationsverarbeitung und Kybernetik, 1994

Decidability Issues for Petri Nets - a survey.
Bulletin of the EATCS, 1994

Operational Semantics for the Petri Box Calculus.
Proceedings of the CONCUR '94, 1994

On the Decidability of Model Checking for Several µ-calculi and Petri Nets.
Proceedings of the Trees in Algebra and Programming, 1994

1993
Reachability in Cyclic Extended Free-Choice Systems.
Theor. Comput. Sci., 1993

The Asynchronous Committee Meeting Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

Model Checking Using Net Unfoldings.
Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

General Refinement and Recursion Operators for the Petri Box Calculus.
Proceedings of the STACS 93, 1993

Complexity Results for 1-safe Nets.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

Shortest Paths in Reachability Graphs.
Proceedings of the Application and Theory of Petri Nets 1993, 1993

1992
A Polynomial-Time Algorithm to Decide Liveness of Bounded Free Choice Nets.
Theor. Comput. Sci., 1992

Traps Characterize Home States in Free Choice Systems.
Theor. Comput. Sci., 1992

A Solution to the Covering Problem for 1-Bounded Conflict-Free Petri Nets Using Linear Programming.
Inf. Process. Lett., 1992

1991
Reachability in Reversible Free Choice Systems.
Proceedings of the STACS 91, 1991

Model Checking of Persistent Petri Nets.
Proceedings of the Computer Science Logic, 5th Workshop, 1991

Compositional Synthesis of Live and Bounded Free Choice Petri Nets.
Proceedings of the CONCUR '91, 1991

1990
Synthesis Rules for Petri Nets, and How they Lead to New Results.
Proceedings of the CONCUR '90, 1990

Top-down synthesis of live and bounded free choice nets.
Proceedings of the Advances in Petri Nets 1991, 1990

1989
On the analysis and synthesis of free choice systems.
Proceedings of the Advances in Petri Nets 1990 [10th International Conference on Applications and Theory of Petri Nets, 1989

Circuits, handles, bridges and nets.
Proceedings of the Advances in Petri Nets 1990 [10th International Conference on Applications and Theory of Petri Nets, 1989


  Loading...