Decidability of split equivalence
Information and Computation
The role of dependencies in component-based systems evolution
Proceedings of the International Workshop on Principles of Software Evolution
Axiomatizing the subsumption and subword preorders on finite and infinite partial words
Theoretical Computer Science
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Infinite Series-Parallel Posets: Logic and Languages
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
2-Nested Simulation Is Not Finitely Equationally Axiomatizable
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Emptiness Is Decidable for Asynchronous Cellular Machines
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Regular Sets of Pomsets with Autoconcurrency
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Series and Parallel Operations on Pomsets
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Toward a Formal Macroset Theory
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Pomsets for local trace languages
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
Towards a language theory for infinite N-free pomsets
Theoretical Computer Science
The order type of the collection of finite series-parallel posets
Discrete Mathematics
Transition and cancellation in concurrency and branching time
Mathematical Structures in Computer Science
Higher dimensional automata revisited
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Varieties generated by languages with poset operations
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Nested semantics over finite trees are equationally hard
Information and Computation
A hierarchy theorem for regular languages over free bisemigroups
Acta Cybernetica
Branching automata with costs: a way of reflecting parallelism in costs
Theoretical Computer Science - Implementation and application of automata
CCS with Hennessy's merge has no finite-equational axiomatization
Theoretical Computer Science - Expressiveness in concurrency
Bisimilarity is not finitely based over BPA with interrupt
Theoretical Computer Science - Algebra and coalgebra in computer science
European Journal of Combinatorics
Semantics of petri nets: a comparison
Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
Event Correlation with Boxed Pomsets
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Working with the Past: Integrating History in Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Unifying Petri Net Semantics with Token Flows
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Pomset Languages of Finite Step Transition Systems
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Journal of Artificial Intelligence Research
Branching automata with costs: a way of reflecting parallelism in costs
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
On locality and the exchange law for concurrent processes
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Bisimilarity is not finitely based over BPA with interrupt
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Finite equational bases in process algebra: results and open questions
Processes, Terms and Cycles
Algebra, logic, locality, concurrency
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Models for data-flow sequential processes
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Algebra, logic, locality, concurrency
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Canonizable partial order generators
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Working with the Past: Integrating History in Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
The laws of programming unify process calculi
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
The saga of the axiomatization of parallel composition
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Information Sciences: an International Journal
| Hi-index | 5.23 |