The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ryszard Janicki: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ryszard Janicki, Ridha Khédri
    Remarks on Mereology of Relations. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2000, pp:133-140 [Conf]
  2. Ryszard Janicki
    How to relieve a programmer from synchronization details. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1988, pp:438-446 [Conf]
  3. Ryszard Janicki, Tomasz Müldner
    Complete Sequential Specification Allows for Concurrent Execution. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1989, pp:221-231 [Conf]
  4. Ryszard Janicki, Tomasz Müldner
    A Simple Realization of a Parallel Device Recognizing Regular Trace Languages. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1990, pp:147-153 [Conf]
  5. Ryszard Janicki, Maciej Koutny
    Structure of Concurrency. [Citation Graph (0, 0)][DBLP]
    AMAST, 1991, pp:98-107 [Conf]
  6. Guangyuan Guo, Ryszard Janicki
    Modelling Concurrent Behaviours by Commutativity and Weak Causality Relations. [Citation Graph (0, 0)][DBLP]
    AMAST, 2002, pp:178-191 [Conf]
  7. Ryszard Janicki, Maciej Koutny
    On equivalent execution semantics of concurrent systems. [Citation Graph (0, 0)][DBLP]
    European Workshop on Applications and Theory of Petri Nets, 1986, pp:89-103 [Conf]
  8. Ryszard Janicki, Maciej Koutny
    Optimal simulations, nets and reachability graphs. [Citation Graph (0, 0)][DBLP]
    Applications and Theory of Petri Nets, 1990, pp:205-226 [Conf]
  9. Yu-Tong He, Ryszard Janicki
    Verifying protocols by model checking: a case study of the wireless application protocol and the model checker SPIN. [Citation Graph (0, 0)][DBLP]
    CASCON, 2004, pp:174-188 [Conf]
  10. Ryszard Janicki, Alan Wassyng
    On tabular expressions. [Citation Graph (0, 0)][DBLP]
    CASCON, 2003, pp:92-106 [Conf]
  11. Ryszard Janicki, Maciej Koutny
    Using Optimal Simulations to Reduce Reachability Graphs. [Citation Graph (0, 0)][DBLP]
    CAV, 1990, pp:166-175 [Conf]
  12. Ryszard Janicki, Maciej Koutny
    Invariant Semantics of Nets with Inhibitor Arcs. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1991, pp:317-331 [Conf]
  13. Ryszard Janicki, Peter E. Lauer, Raymond R. Devillers
    Maximally Concurrent Evolution of Non-sequential Systems. [Citation Graph (0, 0)][DBLP]
    Seminar on Concurrency, 1984, pp:268-280 [Conf]
  14. Ryszard Janicki
    Vectors of Coroutines over Blikle Nets. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:113-119 [Conf]
  15. Ryszard Janicki
    Analysis of vectors of coroutines by means of components. [Citation Graph (0, 0)][DBLP]
    FCT, 1979, pp:207-213 [Conf]
  16. Ryszard Janicki, Maciej Koutny
    Order Structures and Generalisations of Szpilrajn's Theorem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:348-357 [Conf]
  17. Ryszard Janicki, Yuanyuan Zhang
    A simplistic Mereological System for Relations. [Citation Graph (0, 0)][DBLP]
    IC-AI, 2002, pp:1206-1212 [Conf]
  18. Ryszard Janicki
    On the Design of Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1981, pp:455-466 [Conf]
  19. Ryszard Janicki
    A Construction of Concurrent Systems by Means of Sequential Solutions and Concurrency Relations. [Citation Graph (0, 0)][DBLP]
    ICFPC, 1981, pp:327-334 [Conf]
  20. Ryszard Janicki, Peter E. Lauer
    On the Semantics Of Priority Systems. [Citation Graph (0, 0)][DBLP]
    ICPP (2), 1988, pp:150-156 [Conf]
  21. Ryszard Janicki
    Towards a Formal Semantics of Parnas Tables. [Citation Graph (0, 0)][DBLP]
    ICSE, 1995, pp:231-240 [Conf]
  22. Ryszard Janicki
    A Generalisation of a Relational Structures Model of Concurrency. [Citation Graph (0, 0)][DBLP]
    ICTAC, 2004, pp:84-98 [Conf]
  23. Ryszard Janicki
    On a Mereological System for Relational Software Specifications. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:375-386 [Conf]
  24. Ryszard Janicki
    Basic Mereology with Equivalence Relations. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:507-519 [Conf]
  25. Ryszard Janicki
    Vectors of Coroutines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:377-384 [Conf]
  26. Ryszard Janicki
    Synthesis of Concurrent Schemes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1978, pp:298-307 [Conf]
  27. Ryszard Janicki
    On Atomic Nets and Concurrency Relations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1980, pp:320-333 [Conf]
  28. Ryszard Janicki, Maciej Koutny
    Towards A Theory Of Simulation For Verification Of Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    PARLE (2), 1989, pp:73-88 [Conf]
  29. Ryszard Janicki, Maciej Koutny
    Invariants and Paradigms of Concurrency Theory. [Citation Graph (0, 0)][DBLP]
    PARLE (2), 1991, pp:59-74 [Conf]
  30. Ryszard Janicki, Maciej Koutny
    Deriving Histories of Nets with Priority Relation. [Citation Graph (0, 0)][DBLP]
    PARLE, 1994, pp:623-634 [Conf]
  31. Daniela Rosu 0002, Ryszard Janicki
    On Concurrency Control in Object-oriented Databases. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2002, pp:956-962 [Conf]
  32. Ryszard Janicki
    An Algebraic Structure of Petri Nets. [Citation Graph (0, 0)][DBLP]
    Symposium on Programming, 1980, pp:177-192 [Conf]
  33. Ryszard Janicki
    A Method for Developing Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    Symposium on Programming, 1984, pp:155-166 [Conf]
  34. Dai Tri Man Le, Ryszard Janicki
    On a Parthood Specification Method for Component Software. [Citation Graph (0, 0)][DBLP]
    RSCTC, 2006, pp:537-546 [Conf]
  35. Ryszard Janicki
    Towards a Mereological System for Direct Products and Relations. [Citation Graph (0, 0)][DBLP]
    Rough Sets and Current Trends in Computing, 2002, pp:113-122 [Conf]
  36. Ryszard Janicki, Yan Liu
    On Trace Assertion Method of Module Interface Specification with Concurrency. [Citation Graph (0, 0)][DBLP]
    Rough Sets and Current Trends in Computing, 2000, pp:632-641 [Conf]
  37. Ryszard Janicki
    A Characterization of Concurrency-Like Relations. [Citation Graph (0, 0)][DBLP]
    Semantics of Concurrent Computation, 1979, pp:109-122 [Conf]
  38. Yu-Tong He, Ryszard Janicki
    Verification of the WAP Transaction Layer. [Citation Graph (0, 0)][DBLP]
    SEFM, 2004, pp:366-375 [Conf]
  39. Ryszard Janicki, Yun Zhai
    On Properties of 'Part of' Relations. [Citation Graph (0, 0)][DBLP]
    Software Engineering Research and Practice, 2004, pp:393-399 [Conf]
  40. Yuwen Yang, Ryszard Janicki
    Modelling Concurrency with Tabular Expressions. [Citation Graph (0, 0)][DBLP]
    Software Engineering Research and Practice, 2004, pp:455-461 [Conf]
  41. Ryszard Janicki, Maciej Koutny
    Fundamentals of Modelling Concurrency Using Discrete Relational Structures. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1997, v:34, n:5, pp:367-388 [Journal]
  42. Ryszard Janicki
    A Formal Semantics for Concurrent Systems with a Priority Relation. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1987, v:24, n:1, pp:33-55 [Journal]
  43. Ryszard Janicki
    An Equivalence Notion for Path Expressions Systems. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1985, v:21, n:6, pp:283-295 [Journal]
  44. Ryszard Janicki, Maciej Koutny
    Representations of Discrete Interval Orders and Semi-Orders. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1994, v:30, n:3, pp:161-168 [Journal]
  45. Ryszard Janicki, Maciej Koutny
    On Causality Semantics of Nets with Priorities. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:38, n:3, pp:223-255 [Journal]
  46. Ryszard Janicki, Alan Wassyng
    Tabular Expressions and Their Relational Semantics. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:67, n:4, pp:343-370 [Journal]
  47. Ryszard Janicki
    Preface. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2004, v:62, n:2, pp:- [Journal]
  48. Ryszard Janicki
    Special Issueon Application of Concurrency to System Design. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:70, n:1-2, pp:- [Journal]
  49. Ryszard Janicki
    Some remarks on deterministic Mazurkiewicz algorithms and languages associated with them. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1980, v:3, n:1, pp:65-76 [Journal]
  50. Ryszard Janicki, Dai Tri Man Le
    Towards a Pragmatic Mereology. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:75, n:1-4, pp:295-314 [Journal]
  51. Ryszard Janicki, Maciej Koutny
    Semantics of Inhibitor Nets. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:123, n:1, pp:1-16 [Journal]
  52. Ryszard Janicki, Ridha Khédri
    On a formal semantics of tabular expressions. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2001, v:39, n:2-3, pp:189-213 [Journal]
  53. Ryszard Janicki
    Nets, Sequential Components and Concurrency Relations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:29, n:, pp:87-121 [Journal]
  54. Ryszard Janicki
    Transforming Sequential Systems into Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:36, n:, pp:27-58 [Journal]
  55. Ryszard Janicki, Maciej Koutny
    Structure of Concurrency. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:112, n:1, pp:5-52 [Journal]
  56. Ryszard Janicki, Peter E. Lauer, Maciej Koutny, Raymond R. Devillers
    Concurrent and Maximally Concurrent Evolution of Nonsequential Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:43, n:, pp:213-238 [Journal]
  57. Ryszard Janicki, Tomasz Müldner
    Transformations of Sequential Specifications into Concurrent Specifications by Synchronization Guards. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:77, n:1&2, pp:97-129 [Journal]
  58. Ryszard Janicki, Emil Sekerinski
    Foundations of the Trace Assertion Method of Module Interface Specification. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 2001, v:27, n:7, pp:577-598 [Journal]

  59. Modelling Concurrency with Quotient Monoids. [Citation Graph (, )][DBLP]


  60. Attacking the Web Cancer with the Automatic Understanding Approach. [Citation Graph (, )][DBLP]


  61. On Closure Operator for Interval Order Structures. [Citation Graph (, )][DBLP]


  62. Closure Operators for Order Structures. [Citation Graph (, )][DBLP]


  63. Pairwise Comparisons, Incomparability and Partial Orders. [Citation Graph (, )][DBLP]


  64. Some Remarks on Approximations of Arbitrary Binary Relations by Partial Orders. [Citation Graph (, )][DBLP]


  65. On Rough Sets with Structures and Properties. [Citation Graph (, )][DBLP]


  66. Ranking with Partial Orders and Pairwise Comparisons. [Citation Graph (, )][DBLP]


  67. Proving Properties of Programs with Theorem Provers - Experiments with Z3 and Simplify. [Citation Graph (, )][DBLP]


  68. Benefits of Using Tabular Expressions in Planning Health Services. [Citation Graph (, )][DBLP]


  69. Tabular Expressions vs Software Cost Reduction. [Citation Graph (, )][DBLP]


  70. Relational structures model of concurrency. [Citation Graph (, )][DBLP]


  71. Modelling Concurrency with Comtraces and Generalized Comtraces [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002