Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Moller, Faron G. - Department of Computer Science, University of Wales Swansea
Appeared in: IEEE Aerospace and Electronics Systems Magazine 12(3):3844 (1997). The Specification of an Asynchronous Router
Proceedings of SOFSEM'99: The 26th Seminar on Current Trends in Theory and Practice of Informatics, LNCS 1725:398407 (1999).
In Proof, Language, Interaction: Essays in honour of Robin Milner pp497509, MIT Press (2000)
Journal of Mathematical Structures in Computer Science 6:251259 (1996). A polynomialtime algorithm
Invited paper for CONCUR'99, Lecture Notes in Computer Science 1664:3045 (1999).
Automated Verification of Signalling Principles in Railway Interlocking Systems1
Formal Verification of OneCounter Automata: A Generic Method for Proving Lower Bounds 2
Journal of Computer and Systems Sciences 59(3):476--503 (1999). Petri Nets and Regular Processes
Proceedings of LICS'99: Logic in Computer Science, pages 360369 (1999). On the Expressive Power of CTL \Lambda
Invited paper for CONCUR'96, Lecture Notes in Computer Science 1119:195216 (1996). Infinite Results \Lambda
Journal of Theoretical Computer Science 158:143159 (1996). A polynomial algorithm for deciding bisimilarity
Weak Bisimulation Approximants Will Harwood and Faron Moller
Proceedings of STACS2000: Symposium in Theoretical Aspects of Computer Science. Simulation and Bisimulation over OneCounter Processes
Electronic Notes in Theoretical Computer Science 18 (1998) URL: http://www.elsevier.nl/locate/entcs/volume18.html 20 pages
Information and Computation 188 (2004) 119 www.elsevier.com/locate/ic
Deciding Bisimilarity between BPA and BPP Processes ? Petr Jancar 1 , Antonn Kucera 2 , and Faron Moller 3
On the Complexity of Parity Games Arnold Beckmann Faron Moller
The INFINITY workshops aim at providing a forum for researchers in-terested in the development of mathematical techniques for the analysis and
Automated Verification of Signalling Principles in Railway Interlocking Systems1
