Enhancing compositional reachability analysis with context constraints
SIGSOFT '93 Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering
An integrated method for effective behaviour analysis of distributed systems
ICSE '94 Proceedings of the 16th international conference on Software engineering
Derivation of formal representations from process-based specification and implementation models
ISSS '97 Proceedings of the 10th international symposium on System synthesis
Workflow, transactions and datalog
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Compositional Petri Net Approach to the Development of Concurrent and Distributed Systems
Programming and Computing Software
The box algebra = Petri nets + process expressions
Information and Computation
Mapping Petri Nets with Inhibitor Arcs onto Basic LOTOS Behavior Expressions
IEEE Transactions on Computers
NTIF: A General Symbolic Model for Communicating Sequential Processes with Data
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
The Box Algebra - A Model of Nets and Process Expressions
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Translating TPAL Specifications into Timed-Arc Petri Nets
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Towards Petri net calculi based on synchronization via places
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Stochastic Petri net semantics for stochastic process algebras
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Fundamenta Informaticae
Generating BDDs for symbolic model checking in CCS
Distributed Computing
A translation of TPALp into a class of timed-probabilistic Petri nets
Theoretical Computer Science
Failure-free coordinators synthesis for component-based architectures
Science of Computer Programming
Journal of Systems and Software
The decidability of the reachability problem for CCS!
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Mapping RT-LOTOS specifications into time petri nets
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Effective representation of RT-LOTOS terms by finite time petri nets
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Decidability of behavioral equivalences in process calculi with name scoping
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Fundamenta Informaticae
Mechanization Of Real-Time Linear Csp With Higher Order Logic
Fundamenta Informaticae
On the Decidability of Non-Interleaving Process Equivalences
Fundamenta Informaticae
ON FOUR PARTIAL ORDERING SEMANTICS FOR A PROCESS CALCULUS
Fundamenta Informaticae
Combining Ccs And Petri Nets Via Structural Axioms
Fundamenta Informaticae
| Hi-index | 0.00 |