Moller, Faron, 1962-....
Faron Moller
Moller, Faron
Moller, F. (Faron)
Moller, F.
VIAF ID: 34433726 (Personal)
Permalink: http://viaf.org/viaf/34433726
Preferred Forms
- 100 0 _ ‡a Faron Moller
- 100 0 _ ‡a Faron Moller
-
-
- 100 1 _ ‡a Moller, Faron
-
-
-
- 100 1 _ ‡a Moller, Faron ‡d 1962-
- 100 1 _ ‡a Moller, Faron, ‡d 1962-
- 100 1 0 ‡a Moller, Faron, ‡d 1962-
-
-
- 100 1 _ ‡a Moller, Faron, ‡d 1962-....
4xx's: Alternate Name Forms (7)
5xx's: Related Names (2)
Works
Title | Sources |
---|---|
Asynchronous router specification | |
Behavioural abstraction in TCCS | |
Boolean Algebras and Circuits | |
Concurrent Processes | |
Decidability results in automata and process theory | |
Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes, 1992: | |
Defining and Model Checking Abstractions of Complex Railway Models Using CSP||B | |
Distinguishing Between Processes | |
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds* | |
Functions | |
Guest Editorial | |
The importance of the left merge operator in process algebras | |
Inductive and Recursive Definitions | |
Infinite results | |
Introduction | |
Logics for concurrency : structure versus automata | |
The mindstorm effect | |
The mobility workbench — A tool for the π-Calculus | |
Modelling computing systems : mathematics for computer science | |
The nonexistence of finite axiomatisations for CCS congruences | |
Die Notenbanken der Welt : unter besonderer Berücksichtigung der Veränderungen und Neugründungen in der Zeit von 1914-1925 und mit dem amtlichen Wortlaut der Notenbankgesetze in Deutschland, England, Frankreich, Russland und den Vereinigten Staaten von Amerika (federal reserve act) | |
On the computational complexity of bisimulation, redux | |
On the expressive power of CTL | |
An overview of TCCS | |
Petri Nets and Regular Processes | |
A polynomial-time algorithm for deciding equivalence of normed context-free processes | |
Predicate Logic | |
Preface | |
Process Algebra as a Tool for Real Time Analysis | |
Proof Strategies | |
Proofs by Induction | |
Propositional Logic | |
Pushdown automata, multiset automata, and Petri nets | |
Relating processes with respect to speed | |
Relations | |
Safety and Line Capacity in Railways – An Approach in Timed CSP | |
Sets | |
Simulation and Bisimulation over One-Counter Processes | |
A Specification Theory of Real-Time Processes | |
A survey of systolic systems for solving the algebraic path problem. | |
A Taxonomy of Infinite State Processes | |
Techniques for Decidability and Undecidability of Bisimilarity | |
Techniques for modelling and verifying railway interlockings | |
Technocamps | |
A temporal calculus of communicating systems | |
Temporal Properties | |
Unique decomposition of processes | |
A university-based model for supporting computer science curriculum reform | |
Verification of parallel systems via decomposition | |
Verification of Scheme Plans Using CSP $$||$$ | | B | |
Verification of Solid State Interlocking Programs | |
Verification on Infinite Structures | |
Weak Bisimulation Approximants | |
ভূমিকা | |
মুখবন্ধ |