General distributions in process algebra
Lectures on formal methods and performance analysis
Timed Petri Nets in Hybrid Systems: Stability and SupervisoryControl
Discrete Event Dynamic Systems
An Improvement of McMillan's Unfolding Algorithm
Formal Methods in System Design
Place/transition Petri net evolutions: recording ways, analysis and synthesis
Fundamenta Informaticae
Reachability in contextual nets
Fundamenta Informaticae
Characterizing Timed Net Processes Categorically
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Probabilistic Unfoldings and Partial Order Fairness in Petri Nets
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for 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
Black Box Unfolding with Local First Search
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Parallelisation of the Petri Net Unfolding Algorithm
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
On the Semantics of Place/Transition Nets
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Model Checking of Time Petri Nets Based on Partial Order Semantics
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
LP Deadlock Checking Using Partial Order Dependencies
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
A Static Analysis Technique for Graph Transformation Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Randomized Non-sequential Processes
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
Model Checking Logics for Communicating Sequential Agents
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
A Complete Finite Prefix for Process Algebra
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Detection of Illegal Behaviors Based on Unfoldings
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Unfolding of Products of Symmetrical Petri Nets
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Computing a Finite Prefix of a Time Petri Net
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Canonical Prefixes of Petri Net Unfoldings
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Formal and natural computing
Probabilistic cluster unfoldings
Fundamenta Informaticae
An algebraic characterization of independence of Petri net processes
Information Processing Letters - Special issue: Contribution to computing science
Theoretical Computer Science
On the semantics of place/transition Petri nets
Mathematical Structures in Computer Science
A Sufficient Condition for Reachability in a General Petri Net
Discrete Event Dynamic Systems
Distributed Monitoring of Concurrent and Asynchronous Systems*
Discrete Event Dynamic Systems
Diagnosis of asynchronous discrete event systems: datalog to the rescue!
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The individual and collective token interpretations of Petri nets
CONCUR 2005 - Concurrency Theory
On the expressiveness of higher dimensional automata
Theoretical Computer Science - Expressiveness in concurrency
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)
Clusters, Confusion and Unfoldings
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Erratum: Erratum to “On the expressiveness of higher dimensional automata”
Theoretical Computer Science
Detecting State Encoding Conflicts in STG Unfoldings Using SAT
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
Behaviour and Instantiation of High-Level Petri Net Processes
Fundamenta Informaticae
Towards a Framework for Modelling Systems with Rich Internal Structures of States and Processes
Fundamenta Informaticae
Associative Omega-product of Processes
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Verification of bounded Petri nets using integer programming
Formal Methods in System Design
On the well-foundedness of adequate orders used for construction of complete unfolding prefixes
Information Processing Letters
Trellis Processes: A Compact Representation for Runs of Concurrent Systems
Discrete Event Dynamic Systems
Processes of Petri Nets with Range Testing
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
A framework for the verification of infinite-state graph transformation systems
Information and Computation
Faster Unfolding of General Petri Nets Based on Token Flows
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
McMillan's Complete Prefix for Contextual Nets
Transactions on Petri Nets and Other Models of Concurrency I
Adding Branching to the Strand Space Model
Electronic Notes in Theoretical Computer Science (ENTCS)
Composition and Independence of High-Level Net Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Oclets --- Scenario-Based Modeling with Petri Nets
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Configuration structures, event structures and Petri nets
Theoretical Computer Science
Critical Paths in the Partial Order Unfolding of a Stochastic Petri Net
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Modular Construction of Finite and Complete Prefixes of Petri net Unfoldings
Fundamenta Informaticae - Application of Concurrency to System Design
Unfolding Semantics of Petri Nets Based on Token Flows
Fundamenta Informaticae - Petri Nets 2008
Modeling the Exogenous Coordination of Mobile Channel-based Systems with Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Designing a LTL model-checker based on unfolding graphs
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Liveness verification of discrete event systems modeled by n-safe ordinary Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Hierarchical timed high level nets and their branching processes
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Branching processes of high-level Petri nets
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
A false history of true concurrency: from Petri to tools
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
A new type of behaviour-preserving transition insertions in unfolding prefixes
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Abstract processes of place/transition systems
Information Processing Letters
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
How much is worth to remember? a taxonomy based on petri nets unfoldings
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Branching processes of general petri nets
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
On causal semantics of Petri nets
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Simplifying mined process models: an approach based on unfoldings
BPM'11 Proceedings of the 9th international conference on Business process management
Parsing algorithms for grammars with regulated rewriting
ACS'11 Proceedings of the 11th WSEAS international conference on Applied computer science
Time supervision of concurrent systems using symbolic unfoldings of time petri nets
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
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
The (true) concurrent markov property and some applications to markov nets
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Structuring acyclic process models
Information Systems
Petri nets with localities and testing
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Factorization properties of symbolic unfoldings of colored petri nets
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Unfolding Semantics of Petri Nets Based on Token Flows
Fundamenta Informaticae - Petri Nets 2008
Modular Construction of Finite and Complete Prefixes of Petri net Unfoldings
Fundamenta Informaticae - Application of Concurrency to System Design
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)
Associative Omega-product of Processes
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Behaviour and Instantiation of High-Level Petri Net Processes
Fundamenta Informaticae
Towards a Framework for Modelling Systems with Rich Internal Structures of States and Processes
Fundamenta Informaticae
Detecting State Encoding Conflicts in STG Unfoldings Using SAT
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
Place/Transition Petri net Evolutions: Recording Ways, Analysis and Synthesis
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
Reachability in Contextual Nets
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
Probabilistic Cluster Unfoldings
Fundamenta Informaticae
Clusters, Confusion and Unfoldings
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Fundamenta Informaticae
A Partial Order Representation of Processes of Transforming Graphs
Fundamenta Informaticae
Reachability In Some Classes Of Acyclic Petri Nets
Fundamenta Informaticae
Reachability In Some Classes Of Acyclic Petri Nets
Fundamenta Informaticae
What topology tells us about diagnosability in partial order semantics
Discrete Event Dynamic Systems
Simplifying discovered process models in a controlled manner
Information Systems
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Efficient recovery of missing events
Proceedings of the VLDB Endowment
Querying business process model repositories
World Wide Web
Branching Processes of General Petri Nets
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2011
Building Occurrence Nets from Reveals Relations
Fundamenta Informaticae
Defining Multi-Party Compromises using Unfoldings of Workflow Nets
Fundamenta Informaticae - Concurrency, Specification and Programming
| Hi-index | 0.00 |