On the relations computable by a class of concurrent automata
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Schedulers as abstract interpretations of higher-dimensional automata
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Branching time controllers for discrete event systems
Theoretical Computer Science
Games and logics for a noninterleaving bisimulation
Nordic Journal of Computing
General Morphisms of Petri Nets (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Dihomotopy as a Tool in State Space Analysis
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
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
On Recognizable Stable Trace Languages
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
Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
On Concurrent Realization of Reactive Systems and Their Morphisms
Unifying Petri Nets, Advances in Petri Nets
Petri Nets, Configuration Structures and Higher Dimensional Automata
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Models for Name-Passing Processes: Interleaving and Causal
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
An algebraic characterization of independence of Petri net processes
Information Processing Letters - Special issue: Contribution to computing science
Investigation of concurrent processes by means of homotopy functors
Mathematical Structures in Computer Science
Geometry and concurrency: a user's guide
Mathematical Structures in Computer Science
Observational trees as models for concurrency
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Models for name-passing processes: interleaving and causal
Information and Computation
A set-theoretic framework for component composition
Fundamenta Informaticae
On the expressiveness of higher dimensional automata
Theoretical Computer Science - Expressiveness in concurrency
Algebraic topology and concurrency
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Erratum: Erratum to “On the expressiveness of higher dimensional automata”
Theoretical Computer Science
Towards a Framework for Modelling Systems with Rich Internal Structures of States and Processes
Fundamenta Informaticae
Fundamenta Informaticae
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
Concurrency, Graphs and Models
Semantics of Deterministic Shared-Memory Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Modelling Component Behaviour with Concurrent Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Modular system development with pullbacks
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Unfolding synthesis of asynchronous automata
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Concurrent automata vs. asynchronous systems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Axiomatic rewriting theory i: a diagrammatic standardization theorem
Processes, Terms and Cycles
Formal Relationships Between Geometrical and Classical Models for Concurrency
Electronic Notes in Theoretical Computer Science (ENTCS)
Timed transition systems with independence and marked scott domains: an adjunction
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Fundamenta Informaticae
Towards a Framework for Modelling Systems with Rich Internal Structures of States and Processes
Fundamenta Informaticae
A Set-Theoretic Framework for Component Composition
Fundamenta Informaticae
Finite Completeness of Categories of Petri Nets
Fundamenta Informaticae
The Synthesis Problem for Elementary Net Systems with Inhibitor Arcs
Fundamenta Informaticae
Fundamenta Informaticae
Parameterized Structured Operational Semantics
Fundamenta Informaticae
Fundamenta Informaticae
Asynchronous games: innocence without alternation
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |