On decidability of the control reachability problem in the asynchronous π-calculus
Nordic Journal of Computing
Bounded LTL Model Checking with Stable Models
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
A Parametric Analysis of the State Explosion Problem in Model Checking
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Bounded Reachability Checking with Process Semantics
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Towards an Efficient Algorithm for Unfolding Petri Nets
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
The State Explosion Problem from Trace to Bisimulation Equivalence
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Unifying Petri Nets, Advances in Petri Nets
Structural Characterization and Qualitative Properties of Product Form Stochastic Petri Nets
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
The complexity of achievement and maintenance problems in agent-based systems
Artificial Intelligence
Modeling and formal verification of embedded systems based on a Petri net representation
Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Synthesis and verification
Bounded LTL model checking with stable models
Theory and Practice of Logic Programming
Computation in networks of passively mobile finite-state sensors
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Product-form and stochastic Petri nets: a structural approach
Performance Evaluation
Merged processes: a new condensed representation of Petri net behaviour
CONCUR 2005 - Concurrency Theory
Structural soundness of workflow nets is decidable
Information Processing Letters
A parametric analysis of the state-explosion problem in model checking
Journal of Computer and System Sciences
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)
Computation in networks of passively mobile finite-state sensors
Distributed Computing - Special issue: PODC 04
Interprocedural analysis of asynchronous programs
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Detecting State Encoding Conflicts in STG Unfoldings Using SAT
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
Expressing and Verifying Temporal and Structural Properties of Mobile Agents
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Temporal Logic with Capacity Constraints
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
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
Information and Computation
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
A Rice-style theorem for parallel automata
Information and Computation
Output-Determinacy and Asynchronous Circuit Synthesis
Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
Fundamenta Informaticae - Petri Nets 2008
Polymorphic Systems with Arrays, 2-Counter Machines and Multiset Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Structural soundness of workflow nets is decidable
Information Processing Letters
On computation complexity of the concurrently enabled transition set problem
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Computing minimal elements of upward-closed sets for Petri nets
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
A workflow net similarity measure based on transition adjacency relations
Computers in Industry
The reachability problem for branching vector addition systems requires doubly-exponential space
Information Processing Letters
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Semantic business process engineering
ReasoningWeb'10 Proceedings of the 6th international conference on Semantic technologies for software engineering
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
Similarity of business process models: Metrics and evaluation
Information Systems
An algorithm for direct construction of complete merged processes
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Energy games in multiweighted automata
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Parameterized complexity results for 1-safe Petri nets
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
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
The complexity of reversal-bounded model-checking
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Stably computable properties of network graphs
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Signaling p systems and verification problems
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Model checking multithreaded programs with asynchronous atomic methods
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Algorithmic verification of asynchronous programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
On the termination of integer loops
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
Regular Expressions with Counting: Weak versus Strong Determinism
SIAM Journal on Computing
Reliable contracts for unreliable half-duplex communications
WS-FM'11 Proceedings of the 8th international conference on Web Services and Formal Methods
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
Fundamenta Informaticae - Petri Nets 2008
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
Output-Determinacy and Asynchronous Circuit Synthesis
Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Logic Synthesis for Asynchronous Circuits Based on STG Unfoldings and Incremental SAT
Fundamenta Informaticae - APPLICATION OF CONCURRENCY TO SYSTEM DESIGN (ACSD'04)
P- and t-systems in the nets-within-nets-formalism
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Expressing and Verifying Temporal and Structural Properties of Mobile Agents
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
Detecting State Encoding Conflicts in STG Unfoldings Using SAT
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
Asynchronous programs with prioritized task-buffers
Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering
On the Termination of Integer Loops
ACM Transactions on Programming Languages and Systems (TOPLAS)
The covering and boundedness problems for branching vector addition systems
Journal of Computer and System Sciences
A polynomial translation of π-calculus (FCP) to safe petri nets
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
On selective unboundedness of VASS
Journal of Computer and System Sciences
Foundations of data-aware process analysis: a database theory perspective
Proceedings of the 32nd symposium on Principles of database systems
On the topological complexity of ω-languages of non-deterministic Petri nets
Information Processing Letters
Computable fixpoints in well-structured symbolic model checking
Formal Methods in System Design
Reasoning about Data Repetitions with Counter Systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Conservative Elementary Object Systems
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
On the Complexity of the Reachability Problem for Safe, Elementary Hornets
Fundamenta Informaticae - Dedicated to the Memory of Professor Manfred Kudlek
Hi-index | 0.00 |